LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
DOI10.1145/355984.355989zbMATH Open0478.65016OpenAlexW2097897435MaRDI QIDQ3936097FDOQ3936097
Authors: Christopher C. Paige, Michael A. Saunders
Publication date: 1982
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/355984.355989
conjugate gradientsnumerical testslinear least squaresbidiagonalizationsparse and very large systemsestimates of errors
Numerical smoothing, curve fitting (65D10) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Computer aspects of numerical algorithms (65Y99) Iterative numerical methods for linear systems (65F10)
Cited In (only showing first 100 items - show all)
- On Tikhonov-type regularization with approximated penalty terms
- Vector extrapolation based Landweber method for discrete ill-posed problems
- The regularizing properties of global GMRES for solving large-scale linear discrete ill-posed problems with several right-hand sides
- Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
- LSMR iterative method for solving one- and two-dimensional linear Fredholm integral equations
- Highly accurate verified error bounds for Krylov type linear system solvers
- Anderson Accelerated Douglas--Rachford Splitting
- Trajectory-based methods for modeling and characterization
- On regularizing effects of MINRES and MR-II for large scale symmetric discrete ill-posed problems
- Hybrid and iteratively reweighted regularization by unbiased predictive risk and weighted GCV for projected systems
- A penalty method for PDE-constrained optimization in inverse problems
- Edge-promoting reconstruction of absorption and diffusivity in optical tomography
- Matrix forms of iterative algorithms to solve large-scale discrete ill-posed problems with an application to image restoration
- Incremental regularized least squares for dimensionality reduction of large-scale data
- The block preconditioned \textit{LSQR} and \textit{GL}-\textit{LSQR} algorithms for the block partitioned matrices
- Sampling method based projection approach for the reconstruction of 3D acoustically penetrable scatterers
- Low-rank approximation of linear parabolic equations by space-time tensor Galerkin methods
- A regularized factorization-free method for equality-constrained optimization
- Accuracy of the Lanczos process for the eigenproblem and solution of equations
- The AZ algorithm for least squares systems with a known incomplete generalized inverse
- Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides
- Structure in loss of orthogonality
- Tensor methods for the Boltzmann-BGK equation
- Flexible Krylov methods for \(\ell_p\) regularization
- A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems
- Towards Practical Large-Scale Randomized Iterative Least Squares Solvers through Uncertainty Quantification
- Interpretable approximation of high-dimensional data
- Fast computation of reconciled forecasts for hierarchical and grouped time series
- On the Lanczos and Golub-Kahan reduction methods applied to discrete ill-posed problems.
- Edge-enhancing reconstruction algorithm for three-dimensional electrical impedance tomography
- Modified truncated randomized singular value decomposition (MTRSVD) algorithms for large scale discrete ill-posed problems with general-form regularization
- Goal-oriented optimal approximations of Bayesian linear inverse problems
- An unfitted RBF-FD method in a least-squares setting for elliptic PDEs on complex geometries
- Preconditioning by approximations of the discrete Laplacian for 2‐D non‐linear free convection elliptic equations
- A novel dictionary learning method based on total least squares approach with application in high dimensional biological data
- Learning regularization parameters of inverse problems via deep neural networks
- Algorithms and application for special classes of nonlinear least squares problems
- The LSQR method for solving tensor least-squares problems
- Inversion methods in helioseismology and solar tomography
- Algorithms for integration of stochastic differential equations using parallel optimized sampling in the Stratonovich calculus
- An interior-point implementation developed and tuned for radiation therapy treatment planning
- A Tikhonov regularized penalty function approach for solving polylinear programming problems
- A computational framework for edge-preserving regularization in dynamic inverse problems
- A parameter choice rule for Tikhonov regularization based on predictive risk
- Conjugate gradient least squares algorithm for solving the generalized coupled Sylvester matrix equations
- State estimation with structural priors in fMRI
- Iterative solution schemes for quadratic DRM-MD
- Extension of GKB-FP algorithm to large-scale general-form Tikhonov regularization.
- A flexible uncertainty propagation framework for general multiphysics systems
- Some properties of the Arnoldi-based methods for linear ill-posed problems
- Implementing the alternating direction method of multipliers for big datasets: a case study of least absolute shrinkage and selection operator
- The joint bidiagonalization process with partial reorthogonalization
- A hybrid sensitivity function and Lanczos bidiagonalization-Tikhonov method for structural model updating: application to a full-scale bridge structure
- Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs
- A robust algorithm for semidefinite programming
- On the convergence of the Bl-LSQR algorithm for solving matrix equations
- A survey of direct methods for sparse linear systems
- Approximating the extreme Ritz values and upper bounds for the \(A\)-norm of the error in CG
- Coordinate difference matrices
- Solving semidefinite programs using preconditioned conjugate gradients
- Restrictively preconditioned conjugate gradient method for a series of constantly augmented least squares problems
- A generalized projection iterative methods for solving non-singular linear systems
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
- Some results on the regularization of LSQR for large-scale discrete ill-posed problems
- A hybrid LSMR algorithm for large-scale Tikhonov regularization
- Random walks on simplicial complexes and the normalized Hodge 1-Laplacian
- A multi-iterate method to solve systems of nonlinear equations
- A joint bidiagonalization based iterative algorithm for large scale general-form Tikhonov regularization
- A new iterative model updating technique based on least squares minimal residual method using measured modal data
- Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems
- Preconditioners for symmetrized Toeplitz and multilevel Toeplitz matrices
- Solving Hankel matrix approximation problem using semidefinite programming
- Noise representation in residuals of LSQR, LSMR, and CRAIG regularization
- The block Lanczos algorithm for linear ill-posed problems
- Peaks, plateaus, numerical instabilities in a Galerkin minimal residual pair of methods for solving \(Ax=b\)
- Large scale least squares scattered data fitting
- Conditioning of multiple-point statistics facies simulations to tomographic images
- Fitting multiple Bell curves stably and accurately to a time series as applied to Hubbert cycles or other phenomena
- Greedy Tikhonov regularization for large linear ill-posed problems
- Automatic stopping rule for iterative methods in discrete ill-posed problems
- Preconditioning and Iterative Solution of All-at-Once Systems for Evolutionary Partial Differential Equations
- Partial condition number for the equality constrained linear least squares problem
- Fast \(l_ p\) solution of large, sparse, linear systems: Application to seismic travel time tomography
- The solution of large-scale least-squares problems on supercomputers
- Iterative methods for solving consistent or inconsistent matrix inequality \({AXB} \geqslant C\) with linear constraints
- High resolution inverse scattering in two dimensions using recursive linearization
- Vector processing in simplex and interior methods for linear programming
- Solving emission tomography problems on vector machines
- A new taxonomy of conjugate gradient methods
- Efficient linear discriminant analysis with locality preserving for face recognition
- Compression approaches for the regularized solutions of linear systems from large-scale inverse problems
- A new iterative method for solving linear Fredholm integral equations using the least squares method
- Conjugate gradient based acceleration for inverse problems
- Computational experience with numerical methods for nonnegative least-squares problems.
- Solution methods for linear discrete ill-posed problems for color image restoration
- Simple and efficient determination of the Tikhonov regularization parameter chosen by the generalized discrepancy principle for discrete ill-posed problems
- Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications
- Simple stopping criteria for the LSQR method applied to discrete ill-posed problems
- Variable projection for nonlinear least squares problems
- FGMRES for linear discrete ill-posed problems
This page was built for publication: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3936097)