A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
From MaRDI portal
(Redirected from Publication:1111337)
Recommendations
Cites work
- 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 Practical Examination of Some Numerical Methods for Linear Discrete Ill-Posed Problems
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Algorithms for the regularization of ill-conditioned least squares problems
- 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
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Some Superlinear Convergence Results for the Conjugate Gradient Method
- The Collinearity Problem in Linear Regression. The Partial Least Squares (PLS) Approach to Generalized Inverses
- The Lanczos Algorithm with Selective Orthogonalization
- The Singular Value Decomposition in Product Form
- The block conjugate gradient algorithm and related methods
Cited in
(55)- A hybrid sensitivity function and Lanczos bidiagonalization-Tikhonov method for structural model updating: application to a full-scale bridge structure
- Application of denoising methods to regularizationof ill-posed problems
- Hybrid Projection Methods with Recycling for Inverse Problems
- Adaptive Arnoldi-Tikhonov regularization for image restoration
- SIRT- and CG-type methods for the iterative solution of sparse linear least-squares problems
- The regularizing properties of global GMRES for solving large-scale linear discrete ill-posed problems with several right-hand sides
- A regularizing Lanczos iteration method for underdetermined linear systems
- A survey on variational characterizations for nonlinear eigenvalue problems
- Low-CP-rank tensor completion via practical regularization
- A short-term rational Krylov method for linear inverse problems
- Some numerical aspects of Arnoldi-Tikhonov regularization
- Some results on the regularization of LSQR for large-scale discrete ill-posed problems
- Some matrix nearness problems suggested by Tikhonov regularization
- Lanczos tridiagonalization and core problems
- A hybrid LSMR algorithm for large-scale Tikhonov regularization
- On nondecreasing sequences of regularization parameters for nonstationary iterated Tikhonov
- A preconditioned Krylov subspace method for linear inverse problems with general-form Tikhonov regularization
- Efficient determination of the hyperparameter in regularized total least squares problems
- The discrete Picard condition for discrete ill-posed problems
- GCV for Tikhonov regularization by partial SVD
- Large-scale Tikhonov regularization via reduction by orthogonal projection
- A generalized Krylov subspace method for \(\ell_p\)-\(\ell_q\) minimization
- Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems
- Arnoldi-Tikhonov regularization methods
- On the choice of solution subspace for nonstationary iterated Tikhonov regularization
- Noise representation in residuals of LSQR, LSMR, and CRAIG regularization
- Sampling method based projection approach for the reconstruction of 3D acoustically penetrable scatterers
- The block Lanczos algorithm for linear ill-posed problems
- The Joint Bidiagonalization of a Matrix Pair with Inaccurate Inner Iterations
- Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction
- Large scale least squares scattered data fitting
- Large-Scale Inverse Problems in Imaging
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- A modified truncated singular value decomposition method for discrete ill-posed problems.
- An implicit shift bidiagonalization algorithm for ill-posed systems
- A GCV based Arnoldi-Tikhonov regularization method
- Greedy Tikhonov regularization for large linear ill-posed problems
- Double precision is not necessary for LSQR for solving discrete linear ill-posed 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
- GCV for Tikhonov regularization via global Golub-Kahan decomposition.
- The regularized global GMERR method for solving large-scale linear discrete ill-posed problems
- SEBSM-Based Iterative Method for Solving Large Systems of Linear Equations and Its Applications in Engineering Computation
- Learning regularization parameters of inverse problems via deep neural networks
- Simple and efficient determination of the Tikhonov regularization parameter chosen by the generalized discrepancy principle for discrete ill-posed problems
- A special modified Tikhonov regularization matrix for discrete ill-posed problems
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- Hybrid projection methods with recycling for inverse problems
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Square regularization matrices for large linear discrete ill-posed problems.
- Backward error analysis of the Lanczos bidiagonalization with reorthogonalization
- An Algorithm for the Regularization of Ill-Conditioned, Banded Least Squares Problems
- Relations between SVD and GSVD of discrete regularization problems in standard and general form
- A framework for regularization via operator approximation
- GKB-FP: An algorithm for large-scale discrete ill-posed problems
- An inner-outer iterative method for edge preservation in image restoration and reconstruction
This page was built for publication: A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111337)
