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
- Knot tightening by constrained gradient descent
- Modulated luminescence tomography
- Statistical ranking and combinatorial Hodge theory
- Regularized reconstruction of a surface from its measured gradient field
- SIRT- and CG-type methods for the iterative solution of sparse linear least-squares problems
- Two projection methods for regularized total least squares approximation
- Space-time discretization of the heat equation
- The stability of formulae of the Gohberg-Semencul-Trench type for Moore-Penrose and group inverses of Toeplitz matrices
- Solving linearly constrained matrix least squares problem by LSQR
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- Noise-reducing cascadic multilevel methods for linear discrete ill-posed problems
- Stochastic matrix-free equilibration
- Computing projections with LSQR
- Cascadic multilevel methods for fast nonsymmetric blur- and noise-removal
- LSQR iterative common symmetric solutions to matrix equations \(AXB = E\) and \(CXD = F\)
- Regularization parameter determination for discrete ill-posed problems
- Extending the CGLS algorithm for least squares solutions of the generalized Sylvester-transpose matrix equations
- Some properties of LSQR for large sparse linear least squares problems
- Error estimation in preconditioned conjugate gradients
- Computational results of an interior point algorithm for large scale linear programming
- Invertible smoothing preconditioners for linear discrete ill-posed problems
- Matrix iterative solutions to the least squares problem of \(BXA^{T} = F\) with some linear constraints
- Iterative solution of linear systems in the 20th century
- Trust-region and other regularisations of linear least-squares problems
- A Kronecker approximation with a convex constrained optimization method for blind image restoration
- LSQR iterative method for generalized coupled Sylvester matrix equations
- Direct minimization of the discontinuous least-squares spectral element method for viscoelastic fluids
- A matrix LSQR iterative method to solve matrix equation \(AXB=C\)
- Minimum residual methods for augmented systems
- Implementing cholesky factorization for interior point methods of linear programming
- Solution of sparse rectangular systems using LSQR and Craig
- Least squares solution of the linear operator equation
- On the choice of solution subspace for nonstationary iterated Tikhonov regularization
- Developing the CGLS algorithm for the least squares solutions of the general coupled matrix equations
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- Matrix-free interior point method
- A regularized structured total least squares algorithm for high-resolution image reconstruction
- A Golub-Kahan-type reduction method for matrix pairs
- Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction
- An efficient computational approach for evaluating radiation flux for laser driven inertial confinement fusion targets
- On the global convergence of the inexact semi-smooth Newton method for absolute value equation
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- On the real convergence rate of the conjugate gradient method
- Old and new parameter choice rules for discrete ill-posed problems
- A generalized LSQR algorithm
- Inheritance of the discrete Picard condition in Krylov subspace methods
- LSQR
- An iterative algorithm for least squares problem in quaternionic quantum theory
- Regularized total least squares based on quadratic eigenvalue problem solvers
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)