On the choice of solution subspace for nonstationary iterated Tikhonov regularization
DOI10.1007/S11075-015-0079-2zbMATH Open1350.65034OpenAlexW2292996040MaRDI QIDQ306369FDOQ306369
Authors: Feng Yin, Guang-Xin Huang, Lothar Reichel 
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
Recommendations
- Projected nonstationary iterated Tikhonov regularization
- On the choice of subspace for large-scale Tikhonov regularization problems in general form
- Tikhonov regularization based on generalized Krylov subspace methods
- Iterated Tikhonov regularization with a general penalty term.
- scientific article; zbMATH DE number 1740439
numerical experimentsill-posed problemKrylov subspace methodArnoldi processgeneralized Krylov subspace methodGolub-Kahan bidiagonalizationlarge sparse linear least squares problemsnonstationary iterated Tikhonov regularization
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)
Cites Work
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Rank-Deficient and Discrete Ill-Posed Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical methods in matrix computations
- On Krylov projection methods and Tikhonov regularization
- Improvement of the resolution of an instrument by numerical solution of an integral equation
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- A weighted pseudoinverse, generalized singular values, and constrained least squares problems
- Rescaling the GSVD with application to ill-posed problems
- Orthogonal projection regularization operators
- Implementations of range restricted iterative methods for linear discrete ill-posed problems
- Fast nonstationary preconditioned iterative methods for ill-posed problems, with application to image deblurring
- Nonstationary iterated Tikhonov regularization
- An Arnoldi method for nonlinear eigenvalue problems
- Large-scale dual regularized total least squares
- Projected nonstationary iterated Tikhonov regularization
- Large-scale Tikhonov regularization via reduction by orthogonal projection
- Tikhonov regularization based on generalized Krylov subspace methods
- A Projection‐Based Approach to General‐Form Tikhonov Regularization
- An iterative method for Tikhonov regularization with a general linear regularization operator
- A fast algorithm for solving regularized total least squares problems
- On the choice of the regularization parameter for iterated Tikhonov regularization of ill-posed problems
- \(L\)-curve curvature bounds via Lanczos bidiagonalization
- Simplified GSVD computations for the solution of linear discrete ill-posed problems
- A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems
- Iterated fractional Tikhonov regularization
- Matrix decompositions for Tikhonov regularization
Cited In (11)
- A convergence result for some Krylov-Tikhonov methods in Hilbert spaces
- On the choice of subspace for large-scale Tikhonov regularization problems in general form
- Title not available (Why is that?)
- Some numerical aspects of Arnoldi-Tikhonov regularization
- A class of parameter choice rules for stationary iterated weighted Tikhonov regularization scheme
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- Multisplitting for regularized least squares with Krylov subspace recycling.
- Projected nonstationary iterated Tikhonov regularization
- Tikhonov regularization based on generalized Krylov subspace methods
- 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
Uses Software
This page was built for publication: On the choice of solution subspace for nonstationary iterated Tikhonov regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306369)
