On the choice of solution subspace for nonstationary iterated Tikhonov regularization

DOI10.1007/s11075-015-0079-2zbMath1350.65034OpenAlexW2292996040MaRDI QIDQ306369

Feng Yin, Lothar Reichel, Guang-Xin Huang

Publication date: 31 August 2016

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-015-0079-2

zbMATH Keywords

numerical experimentsill-posed problemKrylov subspace methodlarge sparse linear least squares problemsArnoldi processgeneralized Krylov subspace methodGolub-Kahan bidiagonalizationnonstationary iterated Tikhonov regularization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10)

Related Items

Golub-Kahan vs. Monte Carlo: a comparison of bidiagonlization and a randomized SVD method for the solution of linear discrete ill-posed problems ⋮ A non-stationary iterative Tikhonov regularization method for simultaneous inversion in a time-fractional diffusion equation ⋮ Some numerical aspects of Arnoldi-Tikhonov regularization ⋮ A class of parameter choice rules for stationary iterated weighted Tikhonov regularization scheme

Uses Software

• LSQR
• Regularization tools
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• Projected nonstationary iterated Tikhonov regularization
• Large-scale Tikhonov regularization via reduction by orthogonal projection
• Implementations of range restricted iterative methods for linear discrete ill-posed problems
• Tikhonov regularization based on generalized Krylov subspace methods
• An iterative method for Tikhonov regularization with a general linear regularization operator
• A fast algorithm for solving regularized total least squares problems
• Matrix decompositions for Tikhonov regularization
• On the choice of the regularization parameter for iterated Tikhonov regularization of ill-posed problems
• A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
• Nonstationary iterated Tikhonov regularization
• Tikhonov regularization and the L-curve for large discrete ill-posed problems
• An Arnoldi method for nonlinear eigenvalue problems
• A weighted pseudoinverse, generalized singular values, and constrained least squares problems
• \(L\)-curve curvature bounds via Lanczos bidiagonalization
• Rescaling the GSVD with application to ill-posed problems
• Simplified GSVD computations for the solution of linear discrete ill-posed problems
• On Krylov projection methods and Tikhonov regularization
• Regularization tools version \(4.0\) for matlab \(7.3\)
• Large-scale dual regularized total least squares
• Improvement of the resolution of an instrument by numerical solution of an integral equation
• Orthogonal projection regularization operators
• A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
• Rank-Deficient and Discrete Ill-Posed Problems
• Iterated fractional Tikhonov regularization
• Numerical Methods in Matrix Computations
• A Projection‐Based Approach to General‐Form Tikhonov Regularization
• Fast nonstationary preconditioned iterative methods for ill-posed problems, with application to image deblurring