The Singular Value Decomposition in Product Form

DOI10.1137/0904016zbMATH Open0517.65017OpenAlexW2033253580MaRDI QIDQ3666136FDOQ3666136

Authors: J. J. M. Cuppen 

Publication date: 1983

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0904016

zbMATH Keywords

singular value decompositionill-posed problemsrectangular matrixproduct formGolub Reinsch algorithmultimate shifts

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Cited In (4)

• Lanczos, Householder transformations, and implicit deflation for fast and reliable dominant singular subspace computation
• A note on the computation of the generalized cross-validation function for ill-conditioned least squares problems
• A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
• Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems

This page was built for publication: The Singular Value Decomposition in Product Form

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3666136)