An implicit shift bidiagonalization algorithm for ill-posed systems
From MaRDI portal
Publication:1347073
Iterative methods based on Lanczos bidiagonalization (LBD) with full reorthogonalization are considered for solving large scale discrete ill- posed linear least squares problems of the form \(\min_ x \| Ax - b \|_ 2\). Section 1 discusses the use of generalized cross-validation to estimate the optimal regularization of an LBD solution when the noise level is unknown. Section 4 studies the implicitly restarted LBD method. Section 5 explores the use of implicit restarts in the context of determining regularization parameters for the LBD, and presents some numerical examples to demonstrate their efficiency.
Recommendations
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- scientific article; zbMATH DE number 4035016
- scientific article; zbMATH DE number 7771100
- An implicit method for linear ill‐posed problems with perturbed operators
- Nonlinear implicit iterative method for solving nonlinear ill-posed problems
- An efficient discretization scheme for solving ill-posed problems
- Alternating Direction Implicit Iteration for Systems with Complex Spectra
- Hybrid enriched bidiagonalization for discrete ill-posed problems.
- Implicit iterative method for III-posed equations with perturbed operators and data
- scientific article; zbMATH DE number 1383438
Cites work
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
- A fast ``Monte-Carlo cross-validation procedure for large least squares problems with noisy data
- A Practical Examination of Some Numerical Methods for Linear Discrete Ill-Posed Problems
- Accelerated Landweber iterations for the solution of ill-posed equations
- Accurate Singular Values of Bidiagonal Matrices
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 4046975 (Why is no real title available?)
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Iterative SVD-Based Methods for Ill-Posed Problems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Regularization methods for large-scale problems
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
Cited in
(30)- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- Solving large-scale constrained least-squares problems.
- CGLS-GCV: A hybrid algorithm for low-rank-deficient problems.
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- Large scale least squares scattered data fitting
- Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
- GKB-FP: An algorithm for large-scale discrete ill-posed problems
- Primal-dual weak Galerkin finite element methods for elliptic Cauchy problems
- Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- Implicitly restarting the LSQR algorithm
- An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- Large-Scale Inverse Problems in Imaging
- A stopping rule for the conjugate gradient regularization method applied to inverse problems in acoustics
- A hybrid LSMR algorithm for large-scale Tikhonov regularization
- Regularization tools for training large feed-forward neural networks using automatic differentiation∗
- A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
- Parameterized eigensolution technique for solving constrained least squares problems∗
- Low Regularity Primal-Dual Weak Galerkin Finite Element Methods for Ill-Posed Elliptic Cauchy Problems
- Regularization properties of LSQR for linear discrete ill-posed problems in the multiple singular value case and best, near best and general low rank approximations
- An inner-outer iterative method for edge preservation in image restoration and reconstruction
- Train Like a (Var)Pro: Efficient Training of Neural Networks with Variable Projection
- Hybrid enriched bidiagonalization for discrete ill-posed problems.
- A framework for regularization via operator approximation
- Harmonic multi-symplectic Lanczos algorithm for quaternion singular triplets
- Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches
- Lanczos tridiagonalization and core problems
- Restarted block Lanczos bidiagonalization methods
This page was built for publication: An implicit shift bidiagonalization algorithm for ill-posed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1347073)
