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)
- Statistical Methods in Imaging
- A variable projection method for large-scale inverse problems with \(\ell^1\) regularization
- A least squares approach for saddle point problems
- An improved multi-parametric programming algorithm for flux balance analysis of metabolic networks
- Approximation of high-dimensional periodic functions with Fourier-based methods
- An interior-point method for large constrained discrete ill-posed problems
- Generalized inverse problems for part symmetric matrices on a subspace in structural dynamic model updating
- Inverse radiation analysis of simultaneous estimation of temperature field and radiative properties in a two-dimensional participating medium
- On iterative algorithms for linear least squares problems with bound constraints
- Backward perturbation analysis for scaled total least-squares problems
- Computing non-negative tensor factorizations
- Inverse radiation problem of temperature field in three-dimensional rectangular enclosure containing inhomogeneous, anisotropically scattering media
- A Krylov-Schur approach to the truncated SVD
- Lanczos tridiagonalization and core problems
- A new fictitious domain method in shape optimization
- A primal-dual potential reduction method for problems involving matrix inequalities
- A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming
- Integral equation formulation of an unsteady diffusion-convection equation with variable coefficient and velocity
- Least squares collocation solution of elliptic problems in general regions
- Solving or resolving inadequate and noisy tomographic systems
- Analysis of three-dimensional natural convection of nanofluids by BEM
- Stress trajectories element method for stress determination from discrete data on principal directions
- The multi-domain boundary contour method for interface and dissimilar material problems
- Report on test matrices for generalized inverses
- A fast implementation for GMRES method
- A new method for solving linear ill-posed problems
- Iterative techniques for rough surface scattering problems
- Rank and null space calculations using matrix decomposition without column interchanges
- Adsorption in honeycomb adsorber by BEM
- A gradient free integral equation for diffusion-convection equation with variable coefficient and velocity
- A tridiagonalization method for symmetric saddle-point systems
- Meshless thin plate spline methods for the modified Helmholtz equation
- An implicit shift bidiagonalization algorithm for ill-posed systems
- Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy
- Partial least-squares vs. Lanczos bidiagonalization. I: Analysis of a projection method for multiple regression
- Updating the regularization parameter in the adaptive cubic regularization algorithm
- A stabilized GMRES method for singular and severely ill-conditioned systems of linear equations
- Proximal distance algorithms: theory and practice
- Weighted Golub-Kahan-Lanczos bidiagonalization algorithms
- Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches
- A collaborative neighbor representation based face recognition algorithm
- Efficient estimation of regularization parameters via downsampling and the singular value expansion, downsampling regularization parameter estimation
- Conjugate gradient type methods and preconditioning
- An Active-Set Method for Quadratic Programming Based On Sequential Hot-Starts
- An a posteriori error estimate for finite element approximations of a singularly perturbed advection-diffusion problem
- Linear regression models, least-squares problems, normal equations, and stopping criteria for the conjugate gradient method
- Pseudospectral Fourier reconstruction with the modified inverse polynomial reconstruction method
- 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
- Preconditioning techniques for nonsymmetric and indefinite linear systems
- The conjugate gradient regularization method in computed tomography problems
- Decomposition methods for large linear discrete ill-posed problems
- A weighted view on the partial least-squares algorithm
- Projection methods for linear systems
- Algorithm Q-LSQR for the least squares problem in quaternionic quantum theory
- A stable primal-dual approach for linear programming under nondegeneracy assumptions
- Structured linear algebra problems in adaptive optics imaging
- Preconditioner for estimation of multipole sources via full waveform inversion
- New insights in GMRES-like methods with variable preconditioners
- Block conjugate gradient algorithms for least squares problems
- Iterative algorithms for least-squares solutions of a quaternion matrix equation
- An algorithm for solving sparse nonlinear least squares problems
- Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations
- Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems
- Nonnegative surface fitting with Powell-Sabin splines
- Hermitian tridiagonal solution with the least norm to quaternionic least squares problem
- Inexact trust region method for large sparse systems of nonlinear equations
- Interval simulated annealing applied to electrical impedance tomography image reconstruction with fast objective function evaluation
- Arnoldi decomposition, GMRES, and preconditioning for linear discrete ill-posed problems
- A nonmonotone semismooth inexact Newton method
- 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
- 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.
- Multipreconditioned GMRES for shifted systems
- Accuracy of preconditioned CG-type methods for least squares problems.
- A mapped polynomial method for high-accuracy approximations on arbitrary grids
- Title not available (Why is that?)
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- Krylov Subspace Solvers and Preconditioners
- Analysis of approximate inverses in tomography. II: Iterative inverses
- An ALE particle method using upwind interpolation
- Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
- The Glowinski-Le Tallec splitting method revisited: a general convergence and convergence rate analysis
- A preconditioner for solving large-scale variational inequality problems by a semismooth inexact approach
- Bayes meets Krylov: statistically inspired preconditioners for CGLS
- A golden ratio primal-dual algorithm for structured convex optimization
- An isogeometric collocation method using superconvergent points
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)