Arnoldi decomposition, GMRES, and preconditioning for linear discrete ill-posed problems
From MaRDI portal
Publication:2311788
DOI10.1016/j.apnum.2019.02.010zbMath1417.65119arXiv1806.06599OpenAlexW2964285268MaRDI QIDQ2311788
Silvia Gazzola, Silvia Noschese, Paolo Novati, Lothar Reichel
Publication date: 4 July 2019
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.06599
GMRESTikhonov regularizationtruncated singular value decompositionArnoldi processlinear discrete ill-posed problemtruncated iteration
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 (8)
Golub-Kahan vs. Monte Carlo: a comparison of bidiagonlization and a randomized SVD method for the solution of linear discrete ill-posed problems ⋮ GMRES algorithms over 35 years ⋮ Some transpose-free CG-like solvers for nonsymmetric ill-posed problems ⋮ On the banded Toeplitz structured distance to symmetric positive semidefiniteness ⋮ ADMM-softmax: an ADMM approach for multinomial logistic regression ⋮ The regularizing properties of global GMRES for solving large-scale linear discrete ill-posed problems with several right-hand sides ⋮ Iterative Tikhonov regularization of tensor equations based on the Arnoldi process and some of its generalizations ⋮ Augmented GMRES-type versus CGNE methods for the solution of linear ill-posed problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arnoldi methods for image deblurring with anti-reflective boundary conditions
- A GCV based Arnoldi-Tikhonov regularization method
- Implementations of range restricted iterative methods for linear discrete ill-posed problems
- Adaptive preconditioners for nonlinear systems of equations
- The structured distance to normality of an irreducible real tridiagonal matrix
- Noise propagation in regularizing iterations for image deblurring
- Simple square smoothing regularization operators
- Iterative regularization with minimum-residual methods
- Arnoldi-Tikhonov regularization methods
- Computing a nearest symmetric positive semidefinite matrix
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- GMRES, L-curves, and discrete ill-posed problems
- On the regularizing properties of the GMRES method
- Old and new parameter choice rules for discrete ill-posed problems
- Simplified GSVD computations for the solution of linear discrete ill-posed problems
- On Krylov projection methods and Tikhonov regularization
- Circulant preconditioners for discrete ill-posed Toeplitz systems
- Any admissible harmonic Ritz value set is possible for GMRES
- Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
- A note on superoptimal generalized circulant preconditioners
- Regularization tools version \(4.0\) for matlab \(7.3\)
- The structured distance to normality of Toeplitz matrices with application to preconditioning
- Embedded techniques for choosing the parameter in Tikhonov regularization
- A modified truncated singular value decomposition method for discrete ill-posed problems
- GMRES On (Nearly) Singular Systems
- Nonlinearly Preconditioned Krylov Subspace Methods for Discrete Newton Algorithms
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- An Optimal Circulant Preconditioner for Toeplitz Systems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- The Use of Auto-correlation for Pseudo-rank Determination in Noisy III-conditioned Linear Least-squares Problems
- Optimal and Superoptimal Circulant Preconditioners
- How Fast are Nonsymmetric Matrix Iterations?
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- The Arnoldi Method for Normal Matrices
- A Note on the Superlinear Convergence of GMRES
- Which circulant preconditioner is better?
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Some Properties of the Arnoldi-Based Methods for Linear Ill-Posed Problems
- Breakdown-free GMRES for Singular Systems
- Tridiagonal Toeplitz matrices: properties and novel applications
- Numerical Methods in Matrix Computations
- An Introduction to Iterative Toeplitz Solvers
- Smoothing‐Norm Preconditioning for Regularizing Minimum‐Residual Methods
This page was built for publication: Arnoldi decomposition, GMRES, and preconditioning for linear discrete ill-posed problems
