Rank Degeneracy
- 1 June 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 5 (2) , 403-413
- https://doi.org/10.1137/0905030
Abstract
At some point in many applications a decision must be made about the rank of a matrix. The decision is frequently complicated by the fact that the matrix in question is contaminated with errors. This paper surveys some of the more commonly used methods for approximating rank, with particular attention being paid to the effects of errors.Keywords
This publication has 11 references indexed in Scilit:
- An Improved Algorithm for Computing the Singular Value DecompositionACM Transactions on Mathematical Software, 1982
- The Efficient Generation of Random Orthogonal Matrices with an Application to Condition EstimatorsSIAM Journal on Numerical Analysis, 1980
- LINPACK Users' GuidePublished by Society for Industrial & Applied Mathematics (SIAM) ,1979
- Numerical Methods for a Class of Finite Dimensional Bifurcation ProblemsSIAM Journal on Numerical Analysis, 1978
- On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares ProblemsSIAM Review, 1977
- Inversion of Positive Definite Matrices by the Gauss-Jordan MethodPublished by Springer Nature ,1971
- Singular value decomposition and least squares solutionsNumerische Mathematik, 1970
- Numerical methods for solving linear least squares problemsNumerische Mathematik, 1965
- SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMSThe Quarterly Journal of Mathematics, 1960
- The approximation of one matrix by another of lower rankPsychometrika, 1936