Enriched Krylov subspace methods for ill-posed problems
From MaRDI portal
If a linear system is ill-posed, there may be a few eigenvectors with small eigenvalues. Krylov subspace methods are accelerated if directions are added that model the directions of those eigenvectors. The resulting matrices are low rank updates of matrices that are found in standard Krylov space methods. Detailed numerical examples conclude the paper.
Recommendations
- Tikhonov regularization based on generalized Krylov subspace methods
- A conjugate-gradient-type rational Krylov subspace method for ill-posed problems
- A framework for studying the regularizing properties of Krylov subspace methods
- scientific article; zbMATH DE number 16954
- Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems
Cites work
- Algorithm 686: FORTRAN subroutines for updating the QR decomposition
- Fast CG-Based Methods for Tikhonov--Phillips Regularization
- scientific article; zbMATH DE number 592770 (Why is no real title available?)
- scientific article; zbMATH DE number 783550 (Why is no real title available?)
- Methods of conjugate gradients for solving linear systems
- Parallel iterative methods for sparse linear systems
- Quasi-Newton approach to nonnegative image restorations
- Regularization methods for large-scale problems
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- The Use of Auto-correlation for Pseudo-rank Determination in Noisy III-conditioned Linear Least-squares Problems
Cited in
(11)- Some transpose-free CG-like solvers for nonsymmetric ill-posed problems
- Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems
- IR tools: a MATLAB package of iterative regularization methods and large-scale test problems
- Decomposition methods for large linear discrete ill-posed problems
- Exploiting compression in solving discretized linear systems
- A generalized LSQR algorithm
- Hybrid projection methods with recycling for inverse problems
- Hybrid Projection Methods with Recycling for Inverse Problems
- Augmented GMRES-type versus CGNE methods for the solution of linear ill-posed problems
- A survey of subspace recycling iterative methods
- A short-term rational Krylov method for linear inverse problems
This page was built for publication: Enriched Krylov subspace methods for ill-posed problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1863587)
