Inheritance of the discrete Picard condition in Krylov subspace methods
From MaRDI portal
Publication:329014
Recommendations
- Inheritance properties of Krylov subspace methods for continuous-time algebraic Riccati equations
- The discrete Picard condition for discrete ill-posed problems
- A framework for studying the regularizing properties of Krylov subspace methods
- On Krylov projection methods and Tikhonov regularization
- Iterative regularization with minimum-residual methods
Cites work
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 783550 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems
- A GCV based Arnoldi-Tikhonov regularization method
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Choosing regularization parameters in iterative methods for ill-posed problems
- Computation of the singular value expansion
- Deblurring Images
- Embedded techniques for choosing the parameter in Tikhonov regularization.
- Iterative methods for image deblurring: A Matlab object-oriented approach
- Iterative regularization with minimum-residual methods
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- On Krylov projection methods and Tikhonov regularization
- On the regularizing properties of the GMRES method
- Rank-Deficient and Discrete Ill-Posed Problems
- Regularization Tools Version 3. 0 for Matlab 5. 2
- Regularization methods for large-scale problems
- Regularization tools version \(4.0\) for matlab \(7.3\)
- The discrete Picard condition for discrete ill-posed problems
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- Updating the singular value decomposition
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
- Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches
- Some properties of the Arnoldi-based methods for linear ill-posed problems
- 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
- A joint bidiagonalization based iterative algorithm for large scale general-form Tikhonov regularization
- 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
- GMRES methods for tomographic reconstruction with an unmatched back projector
- Regularization by inexact Krylov methods with applications to blind deblurring
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)
