CGLS-GCV: A hybrid algorithm for low-rank-deficient problems.

DOI10.1016/S0168-9274(03)00060-6zbMath1049.65026MaRDI QIDQ1412332

Fermin S. Viloche Bazán

Publication date: 10 November 2003

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-9274(03)00060-6

zbMATH Keywords

algorithm; numerical example; regularization; Iterative methods; Krylov subspace; minimum norm solution; magnetic resonance spectroscopy; conjugate-gradient method; Signal reconstruction; Rank-deficient problems

Mathematics Subject Classification ID

65F20: Numerical solutions to overdetermined systems, pseudoinverses

Related Items

CGLS-GCV

Uses Software

• Regularization tools
• UTV

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regularization methods for large-scale problems
• Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
• An implicit shift bidiagonalization algorithm for ill-posed systems
• Conditioning of infinite Hankel matrices of finite rank
• UTV tools: Matlab templates for rank-revealing UTV decompositions
• Matrices with Low-Rank-Plus-Shift Structure: Partial SVD and Latent Semantic Indexing
• Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
• A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems
• Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
• Pseudoinversus and conjugate gradients
• Fast Estimation of Principal Eigenspace Using Lanczos Algorithm
• Rank-Deficient and Discrete Ill-Posed Problems
• Conditioning of Rectangular Vandermonde Matrices with Nodes in the Unit Disk
• Perturbation bounds in connection with singular value decomposition