LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares

DOI10.1145/355984.355989zbMath0478.65016OpenAlexW2097897435MaRDI QIDQ3936097

Michael A. Saunders, Christopher C. Paige

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

zbMATH Keywords

numerical testsconjugate gradientslinear least squaresbidiagonalizationsparse and very large systemsestimates of errors

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Computer aspects of numerical algorithms (65Y99)

Related Items (only showing first 100 items - show all)

The joint bidiagonalization process with partial reorthogonalization ⋮ The stability of formulae of the Gohberg-Semencul-Trench type for Moore-Penrose and group inverses of Toeplitz matrices ⋮ A hybrid sensitivity function and Lanczos bidiagonalization-Tikhonov method for structural model updating: application to a full-scale bridge structure ⋮ Solving linearly constrained matrix least squares problem by LSQR ⋮ Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs ⋮ Extending the CGLS algorithm for least squares solutions of the generalized Sylvester-transpose matrix equations ⋮ Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy ⋮ Least squares solution of the linear operator equation ⋮ On the choice of solution subspace for nonstationary iterated Tikhonov regularization ⋮ 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 ⋮ Finite element method with optimal nodal velocity ⋮ Fast \(l_ p\) solution of large, sparse, linear systems: Application to seismic travel time tomography ⋮ A stable primal-dual approach for linear programming under nondegeneracy assumptions ⋮ Noise-reducing cascadic multilevel methods for linear discrete ill-posed problems ⋮ A survey of the advances in the exploitation of the sparsity in the solution of large problems ⋮ Least squares collocation solution of elliptic problems in general regions ⋮ Inheritance of the discrete Picard condition in Krylov subspace methods ⋮ Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value ⋮ Sylvester equations and the numerical solution of partial fractional differential equations ⋮ Lanczos tridiagonalization and core problems ⋮ Matrix iterative solutions to the least squares problem of \(BXA^{T} = F\) with some linear constraints ⋮ Solving Hankel matrix approximation problem using semidefinite programming ⋮ An augmented LSQR method ⋮ An approximate inverse preconditioner for Toeplitz systems with multiple right-hand sides ⋮ Simple backward error bounds for linear least-squares problems ⋮ Conditioning of multiple-point statistics facies simulations to tomographic images ⋮ Hermitian tridiagonal solution with the least norm to quaternionic least squares problem ⋮ Fitting multiple Bell curves stably and accurately to a time series as applied to Hubbert cycles or other phenomena ⋮ Two projection methods for regularized total least squares approximation ⋮ A Golub-Kahan-type reduction method for matrix pairs ⋮ A Krylov-Schur approach to the truncated SVD ⋮ Some properties of LSQR for large sparse linear least squares problems ⋮ 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 ⋮ Statistical ranking and combinatorial Hodge theory ⋮ Matrix-free interior point method ⋮ Stress trajectories element method for stress determination from discrete data on principal directions ⋮ Analysis of three-dimensional natural convection of nanofluids by BEM ⋮ Combined single domain and subdomain BEM for 3D laminar viscous flow ⋮ The multi-domain boundary contour method for interface and dissimilar material problems ⋮ SIRT- and CG-type methods for the iterative solution of sparse linear least-squares problems ⋮ A new method for solving linear ill-posed problems ⋮ The solution of large-scale least-squares problems on supercomputers ⋮ Adsorption in honeycomb adsorber by BEM ⋮ A gradient free integral equation for diffusion-convection equation with variable coefficient and velocity ⋮ Structured linear algebra problems in adaptive optics imaging ⋮ Efficient GOCE satellite gravity field recovery based on least-squares using QR decomposition ⋮ A collaborative neighbor representation based face recognition algorithm ⋮ Space-time discretization of the heat equation ⋮ Linear regression models, least-squares problems, normal equations, and stopping criteria for the conjugate gradient method ⋮ Inverse radiation problem of temperature field in three-dimensional rectangular enclosure containing inhomogeneous, anisotropically scattering media ⋮ The Fourier approximation of smooth but non-periodic functions from unevenly spaced data ⋮ A flexible condition number for weighted linear least squares problem and its statistical estimation ⋮ Projection methods for linear systems ⋮ Velocity-vorticity formulation for 3D natural convection in an inclined enclosure by BEM ⋮ Computing projections with LSQR ⋮ Block conjugate gradient algorithms for least squares problems ⋮ Iterative algorithms for least-squares solutions of a quaternion matrix equation ⋮ A new fictitious domain method in shape optimization ⋮ Semidefinite programming for the educational testing problem ⋮ Interval simulated annealing applied to electrical impedance tomography image reconstruction with fast objective function evaluation ⋮ Partial least-squares vs. Lanczos bidiagonalization. I: Analysis of a projection method for multiple regression ⋮ On the solution of the Neumann Poisson problem arising from a compact differencing scheme using the full multi-grid method ⋮ Vector extrapolation applied to truncated singular value decomposition and truncated iteration ⋮ LSQR iterative method for generalized coupled Sylvester matrix equations ⋮ A Kronecker approximation with a convex constrained optimization method for blind image restoration ⋮ Updating the regularization parameter in the adaptive cubic regularization algorithm ⋮ Generalized inverse problems for part symmetric matrices on a subspace in structural dynamic model updating ⋮ Algorithm Q-LSQR for the least squares problem in quaternionic quantum theory ⋮ Persistent cohomology and circular coordinates ⋮ Factorization strategies for third-order tensors ⋮ Cascadic multilevel methods for fast nonsymmetric blur- and noise-removal ⋮ Sparse QR factorization on a massively parallel computer ⋮ LSQR iterative common symmetric solutions to matrix equations \(AXB = E\) and \(CXD = F\) ⋮ Invertible smoothing preconditioners for linear discrete ill-posed problems ⋮ Inverse radiation analysis of simultaneous estimation of temperature field and radiative properties in a two-dimensional participating medium ⋮ An iterative algorithm for least squares problem in quaternionic quantum theory ⋮ Meshless thin plate spline methods for the modified Helmholtz equation ⋮ Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems ⋮ Automatic stopping rule for iterative methods in discrete ill-posed problems ⋮ Trust-region and other regularisations of linear least-squares problems ⋮ Vector processing in simplex and interior methods for linear programming ⋮ LSQR ⋮ Solving emission tomography problems on vector machines ⋮ On iterative algorithms for linear least squares problems with bound constraints ⋮ 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 ⋮ Efficient linear discriminant analysis with locality preserving for face recognition ⋮ Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit ⋮ Simple stopping criteria for the LSQR method applied to discrete ill-posed problems ⋮ Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications ⋮ A fast and accurate algorithm for spherical harmonic analysis on HEALPix grids with applications to the cosmic microwave background radiation ⋮ An interior-point method for large constrained discrete ill-posed problems ⋮ Report on test matrices for generalized inverses ⋮ On the real convergence rate of the conjugate gradient method ⋮ Modulated luminescence tomography ⋮ Rank and null space calculations using matrix decomposition without column interchanges ⋮ Solving or resolving inadequate and noisy tomographic systems

This page was built for publication: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares