The Singular Value Analysis in Matrix Computation / Richard A. Becker, Neil Kaden, Virginia Klema.
Material type:
- Hardcopy version available to institutional subscribers
Item type | Home library | Collection | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|---|
Working Paper | Biblioteca Digital | Colección NBER | nber w0046 (Browse shelf(Opens below)) | Not For Loan |
Collection: Colección NBER Close shelf browser (Hides shelf browser)
July 1974.
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.
Hardcopy version available to institutional subscribers
System requirements: Adobe [Acrobat] Reader required for PDF files.
Mode of access: World Wide Web.
Print version record
There are no comments on this title.