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)
- 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
- Sparsity- and continuity-promoting seismic image recovery with curvelet frames
- On the generalized reflexive and anti-reflexive solutions to a system of matrix equations
- Generalized Hybrid Iterative Methods for Large-Scale Bayesian Inverse Problems
- On solutions of matrix equation \(XF-AX=C\) and \(XF-A\widetilde{X}=C\) over quaternion field
- Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Sylvester equations and the numerical solution of partial fractional differential equations
- The role eigenvalues play in forming GMRES residual norms with non-normal matrices
- Orthogonal projection regularization operators
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- A relaxed version of Karmarkar's method
- Multistep matrix splitting iteration preconditioning for singular linear systems
- Reconstructing material properties by deconvolution of full-field measurement images: the conductivity case
- Combined single domain and subdomain BEM for 3D laminar viscous flow
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- An augmented LSQR method
- On the estimation of a large sparse Bayesian system: the Snaer program
- Error estimates for the regularization of least squares problems
- Error estimates for large-scale ill-posed problems
- Minimization of functionals on the solution of a large-scale discrete ill-posed problem
- Velocity-vorticity formulation for 3D natural convection in an inclined enclosure by BEM
- Inexact semismooth Newton methods for large-scale complementarity problems
- Convergence of inner-iteration GMRES methods for rank-deficient least squares problems
- Sylvester Tikhonov-regularization methods in image restoration
- On application of fast and adaptive periodic Battle-Lemarie wavelets for modeling of multiple lossy transmission lines
- Skew-symmetric methods for nonsymmetric linear systems with multiple right-hand sides
- Algorithm 937: MINRES-QLP for symmetric and Hermitian linear equations and least-squares problems
- Persistent cohomology and circular coordinates
- Factorization strategies for third-order tensors
- GKB-FP: An algorithm for large-scale discrete ill-posed problems
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- The block least squares method for solving nonsymmetric linear systems with multiple right-hand sides
- An approximate inverse preconditioner for Toeplitz systems with multiple right-hand sides
- Simple backward error bounds for linear least-squares problems
- Parameter selection and preconditioning for a graph form solver
- Quadratically constrained least squares and quadratic problems
- Error bounds for computed least squares estimators
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- Semidefinite programming for the educational testing problem
- Modulus methods for nonnegatively constrained image restoration
- Conjugate gradient-like solution algorithms for the mixed finite element approximation of the biharmonic equation, applied to plate bending problems
- Learning multivariate functions with low-dimensional structures using polynomial bases
- A survey on variational characterizations for nonlinear eigenvalue problems
- Finite element method with optimal nodal velocity
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- Hybrid methods for large sparse nonlinear least squares
- Sparse QR factorization on a massively parallel computer
- Sharp 2-norm error bounds for LSQR and the conjugate gradient method
- A polynomial based iterative method for linear parabolic equations
- Rapid, efficient analysis of the \(\lambda(n)/C_{k}/r/N\) queue, with application to decomposition of closed queuing networks.
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)