The block Lanczos algorithm for linear ill-posed problems
From MaRDI portal
Publication:1675423
DOI10.1007/s10092-016-0206-zzbMath1376.65063OpenAlexW2518811656MaRDI QIDQ1675423
M. El Guide, Abdeslem Hafid Bentbib, Khalide Jbilou
Publication date: 27 October 2017
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10092-016-0206-z
numerical examplesTikhonov regularizationill-conditioned systemblock Gauss quadrature rulessymmetric block Lanczos algorithm
Related Items (3)
The regularizing properties of global GMRES for solving large-scale linear discrete ill-posed problems with several right-hand sides ⋮ Shifted extended global Lanczos processes for trace estimation with application to network analysis ⋮ Block Updating/Downdating Algorithms for Regularised Least Squares Problems and Applications to Linear Discriminant Analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extrapolated TSVD method for linear discrete ill-posed problems with Kronecker structure
- Oblique projection methods for linear systems with multiple right-hand sides
- Error estimates for the regularization of least squares problems
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- Kronecker product and SVD approximations in image restoration
- Quadratically constrained least squares and quadratic problems
- Tikhonov regularization of large linear problems
- A block version of BiCGSTAB for linear systems with multiple right-hand sides
- Tikhonov regularization with nonnegativity constraint
- \(L\)-curve curvature bounds via Lanczos bidiagonalization
- The block Lanczos method for linear systems with multiple right-hand sides
- Old and new parameter choice rules for discrete ill-posed problems
- Estimation of the \(L\)-curve via Lanczos bidiagonalization
- Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides
- A Trust-Region Approach to the Regularization of Large-Scale Discrete Forms of Ill-Posed Problems
- Deblurring Images
- Improvement of Space-Invariant Image Deblurring by Preconditioned Landweber Iterations
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Algorithms for the regularization of ill-conditioned least squares problems
- Rank-Deficient and Discrete Ill-Posed Problems
- Kronecker Product Approximations forImage Restoration with Reflexive Boundary Conditions
- Tikhonov Regularization with a Solution Constraint
- An interior-point trust-region-based method for large-scale non-negative regularization
- Anti-Gaussian quadrature formulas
- Block Gauss and Anti-Gauss Quadrature with Application to Networks
- Dealing with linear dependence during the iterations of the restarted block Lanczos methods
- A global Lanczos method for image restoration
This page was built for publication: The block Lanczos algorithm for linear ill-posed problems
