SIAM Journal on Matrix Analysis and Applications · 2005 · 71 citations · 13 references
ComputingComputer ScienceAlgorithmsComputational GeometryScientific ComputingIterative SolversMatrix ComputationMatrix FactorizationNumerical AlgorithmsNumerical AnalysisNumerical Linear AlgebraDeflation TechniquesLow-rank ApproximationNull SpaceRank-revealing FactorizationsSingular Value DecompositionSparse Linear AlgebraSparse Matrix AlgorithmsSparse Matrix Computation
A new rank-revealing method is proposed. For a given matrix and a threshold for near-zero singular values, by employing a globally convergent iterative scheme as well as a deflation technique the method calculates approximate singular values below the threshold one by one and returns the approximate rank of the matrix along with an orthonormal basis for the approximate null space. When a row or column is inserted or deleted, algorithms for updating/downdating the approximate rank and null space are straightforward, stable, and efficient. Numerical results exhibiting the advantages of our code over existing packages based on two-sided orthogonal rank-revealing decompositions are presented. Also presented are applications of the new algorithm in numerical computation of the polynomial GCD as well as identification of nonisolated zeros of polynomial systems.
13
Numerical methods for least squares problems
Choice Reviews Online · 1996 · 3.1K citations
SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
L. Mirsky · The Quarterly Journal of Mathematics · 1960 · 626 citations · Full text
Rank revealing QR factorizations
Tony F. Chan · Linear Algebra and its Applications · 1987 · 527 citations