The Singular Value Analysis in Matrix Computation

Richard A. Becker, Neil Kaden and Virginia Klema

No 46, NBER Working Papers from National Bureau of Economic Research, Inc

Abstract: This paper discusses the robustness and the computational stability of the singular value decomposition algorithm used at the NBER Computer Research Center. The effect of perturbations on input data is explored. Suggestions are made for using the algorithm to get information about the rank of a real square or rectangular matrix. The algorithm can also be used to compute the best approximate solution of linear system of equations in the least squares sense, to solve linear systems of equations with equality constraints, and to determine dependencies or near dependencies among the rows or columns of a matrix. A copy of the subroutine that is used and some examples on which it has been tested are included in the appendixes.

Date: 1974-07
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.nber.org/papers/w0046.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:nbr:nberwo:0046

Ordering information: This working paper can be ordered from
http://www.nber.org/papers/w0046

Access Statistics for this paper

More papers in NBER Working Papers from National Bureau of Economic Research, Inc National Bureau of Economic Research, 1050 Massachusetts Avenue Cambridge, MA 02138, U.S.A.. Contact information at EDIRC.
Bibliographic data for series maintained by ().