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)
- 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
- An iterative algorithm for a least squares solution of a matrix equation
- Approximate Toeplitz matrix problem using semidefinite programming
- A fast and accurate algorithm for spherical harmonic analysis on HEALPix grids with applications to the cosmic microwave background radiation
- On the solution of a two ball trust region subproblem
- Efficient GOCE satellite gravity field recovery based on least-squares using QR decomposition
- Discrete vector calculus and Helmholtz Hodge decomposition for classical finite difference summation by parts operators
- Relax-and-split method for nonconvex inverse problems
- Tensor Equivalents for Solution of Linear Systems: A Parallel Algorithm
- Fast boundary-domain integral method for heat transfer simulations
- A preconditioned MINRES method for nonsymmetric Toeplitz matrices
- Parallel tensor methods for high-dimensional linear PDEs
- An efficient method for solving a matrix least squares problem over a matrix inequality constraint
- Testing matrix function algorithms using identities
- Regularization parameter estimation for large-scale Tikhonov regularization using a priori information
- 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
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)