Inheritance of the discrete Picard condition in Krylov subspace methods
DOI10.1007/S10543-015-0578-5zbMATH Open1353.65023OpenAlexW1931725016MaRDI QIDQ329014FDOQ329014
Publication date: 21 October 2016
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10543-015-0578-5
iterative regularizationdiscrete Picard conditionArnoldi algorithmGMRES residualLanczos bidiagonalization algorithm
Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Regularization Tools Version 3. 0 for Matlab 5. 2
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Rank-Deficient and Discrete Ill-Posed Problems
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Regularization methods for large-scale problems
- On Krylov projection methods and Tikhonov regularization
- Deblurring Images
- Updating the singular value decomposition
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- On the regularizing properties of the GMRES method
- Iterative methods for image deblurring: A Matlab object-oriented approach
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- Choosing regularization parameters in iterative methods for ill-posed problems
- The discrete Picard condition for discrete ill-posed problems
- Iterative regularization with minimum-residual methods
- A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems
- Computation of the singular value expansion
- Embedded techniques for choosing the parameter in Tikhonov regularization
- A GCV based Arnoldi-Tikhonov regularization method
Cited In (10)
- Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs
- Some transpose-free CG-like solvers for nonsymmetric ill-posed problems
- A joint bidiagonalization based iterative algorithm for large scale general-form Tikhonov regularization
- The low rank approximations and Ritz values in LSQR for linear discrete ill-posed problem
- Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems
- Regularization by Inexact Krylov Methods with Applications to Blind Deblurring
- GMRES methods for tomographic reconstruction with an unmatched back projector
- Regularization properties of LSQR for linear discrete ill-posed problems in the multiple singular value case and best, near best and general low rank approximations
- Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches
- Some Properties of the Arnoldi-Based Methods for Linear Ill-Posed Problems
Uses Software
This page was built for publication: Inheritance of the discrete Picard condition in Krylov subspace methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329014)
