Lanczos based preconditioner for discrete ill-posed problems
From MaRDI portal
Publication:975318
DOI10.1007/s00607-010-0090-3zbMath1190.65049OpenAlexW1975280676MaRDI QIDQ975318
Mansoor Rezghi, Mohammed Hosseini Ali Abadi
Publication date: 9 June 2010
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-010-0090-3
numerical examplespreconditionerTikhonov regularizationill-posed problemsLanczos bidiagonalizationimage deblurringsemiconvergent
Ill-posedness and regularization problems in numerical linear algebra (65F22) Preconditioners for iterative methods (65F08)
Related Items (6)
Preconditioned RRGMRES for Discrete Ill-Posed Problems ⋮ A special modified Tikhonov regularization matrix for discrete ill-posed problems ⋮ Optimal Kronecker Product Approximation of Block Toeplitz Matrices ⋮ A preconditioned multiple shooting shadowing algorithm for the sensitivity analysis of chaotic systems ⋮ An efficient method to set up a Lanczos based preconditioner for discrete ill-posed problems ⋮ Even-order Toeplitz tensor: framework for multidimensional structured linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- L-curve and curvature bounds for Tikhonov regularization
- Inverse Toeplitz preconditioners for ill-posed problems
- Kronecker product and SVD approximations in image restoration
- Regularization methods for large-scale problems
- Estimation of the \(L\)-curve via Lanczos bidiagonalization
- An adaptive pruning algorithm for the discrete L-curve criterion
- Singular value decomposition and least squares solutions
- Optimal Kronecker Product Approximation of Block Toeplitz Matrices
- Choosing Regularization Parameters in Iterative Methods for Ill-Posed Problems
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
This page was built for publication: Lanczos based preconditioner for discrete ill-posed problems
