Computing Truncated Singular Value Decomposition Least Squares Solutions by Rank Revealing QR-Factorizations

DOI10.1137/0911029zbMath0699.65030OpenAlexW2035885121WikidataQ57397439 ScholiaQ57397439MaRDI QIDQ3477883

Tony F. Chan, Per Christian Hansen

Publication date: 1990

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

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

zbMATH Keywords

QR factorizationill-conditionedNumerical examplesrank deficient linear least squares problemssingular value solution

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Ill-conditioning of the truncated singular value decomposition, Tikhonov regularization and their applications to numerical partial differential equations ⋮ Maximizing bilinear forms subject to linear constraints ⋮ Column subset selection problem is UG-hard ⋮ Relations between SVD and GSVD of discrete regularization problems in standard and general form ⋮ Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values ⋮ A block algorithm for computing rank-revealing QR factorizations ⋮ A hybrid Clough-Tocher method for surface fitting with application to leaf data ⋮ An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition ⋮ Adaptively Compressed Polarizability Operator for Accelerating Large Scale Ab Initio Phonon Calculations ⋮ A reduced-space line-search method for unconstrained optimization via random descent directions ⋮ Tikhonov Regularization and Randomized GSVD ⋮ Split representation of adaptively compressed polarizability operator