The block Lanczos algorithm for linear ill-posed problems
From MaRDI portal
Recommendations
- The block Lanczos method for linear systems with multiple right-hand sides
- Estimation of the \(L\)-curve via Lanczos bidiagonalization
- Error estimates for large-scale ill-posed problems
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- An improved Lanczos algorithm for solving ill-conditioned linear equations
Cites work
- \(L\)-curve curvature bounds via Lanczos bidiagonalization
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
- A block version of BiCGSTAB for linear systems with multiple right-hand sides
- A global Lanczos method for image restoration
- A trust-region approach to the regularization of large-scale discrete forms of ill-posed problems
- Algorithms for the regularization of ill-conditioned least squares problems
- An extrapolated TSVD method for linear discrete ill-posed problems with Kronecker structure
- 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
- Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
- Dealing with linear dependence during the iterations of the restarted block Lanczos methods
- Deblurring Images
- Error estimates for the regularization of least squares problems
- Estimation of the \(L\)-curve via Lanczos bidiagonalization
- Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides
- scientific article; zbMATH DE number 3868512 (Why is no real title available?)
- scientific article; zbMATH DE number 554737 (Why is no real title available?)
- scientific article; zbMATH DE number 741107 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Improvement of Space-Invariant Image Deblurring by Preconditioned Landweber Iterations
- Kronecker product and SVD approximations in image restoration
- Kronecker Product Approximations forImage Restoration with Reflexive Boundary Conditions
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Matrices, moments and quadrature with applications
- Oblique projection methods for linear systems with multiple right-hand sides
- Old and new parameter choice rules for discrete ill-posed problems
- Quadratically constrained least squares and quadratic problems
- Rank-Deficient and Discrete Ill-Posed Problems
- Regularization tools version 4.0 for matlab 7.3
- The block Lanczos method for linear systems with multiple right-hand sides
- Tikhonov regularization of large linear problems
- Tikhonov Regularization with a Solution Constraint
- Tikhonov regularization with nonnegativity constraint
Cited in
(13)- A block Lanczos method for the linear response eigenvalue problem
- An adaptive block Lanczos algorithm
- 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
- On block minimal residual methods
- scientific article; zbMATH DE number 782066 (Why is no real title available?)
- Block Updating/Downdating Algorithms for Regularised Least Squares Problems and Applications to Linear Discriminant Analysis
- On the block Lanczos and block Golub–Kahan reduction methods applied to discrete ill‐posed problems
- Dealing with linear dependence during the iterations of the restarted block Lanczos methods
- The regularized global GMERR method for solving large-scale linear discrete ill-posed problems
- The regularized block GMERR method and its simpler version for solving large-scale linear discrete ill-posed problems
- Block method for problems on L-shaped domains
- Efficient computation of dominant eigenvalues using adaptive block Lanczos with Chebyshev filtering
This page was built for publication: The block Lanczos algorithm for linear ill-posed problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675423)
