On the Lanczos and Golub–Kahan reduction methods applied to discrete ill‐posed problems

DOI10.1002/nla.2020zbMath1413.65120OpenAlexW2098038291MaRDI QIDQ5739757

Giuseppe Rodriguez, Silvia Gazzola, Enyinda Onunwor, Lothar Reichel

Publication date: 19 July 2016

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.2020

zbMATH Keywords

LSQRGolub-Kahan bidiagonalizationTSVDdiscrete ill-posed problemsLanczos decomposition

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

On the computation of a truncated SVD of a large linear discrete ill-posed problem, Tensor Krylov subspace methods via the Einstein product with applications to image and video processing, Regularized minimal-norm solution of an overdetermined system of first kind integral equations, Approximation of the Tikhonov regularization parameter through Aitken's extrapolation, A majorization-minimization Golub-Kahan bidiagonalization method for \(\ell_2-\ell_q\) mimimization with applications in image restorization, ADMM-softmax: an ADMM approach for multinomial logistic regression, Solution methods for linear discrete ill-posed problems for color image restoration

Uses Software

• Matlab
• Regularization tools
• Eigtool

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A GCV based Arnoldi-Tikhonov regularization method
• Implementations of range restricted iterative methods for linear discrete ill-posed problems
• An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
• The structure of iterative methods for symmetric linear discrete ill-posed problems
• Regularization tools version \(4.0\) for matlab \(7.3\)
• Embedded techniques for choosing the parameter in Tikhonov regularization
• Numerical Methods for Large Eigenvalue Problems
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Rank-Deficient and Discrete Ill-Posed Problems
• IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
• Augmented Implicitly Restarted Lanczos Bidiagonalization Methods