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)
- Accuracy of the Lanczos Process for the Eigenproblem and Solution of Equations
- 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
- Flexible Krylov Methods for $\ell_p$ Regularization
- Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
- Interpretable Approximation of High-Dimensional Data
- 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
- On regularizing effects of MINRES and MR-II for large scale symmetric discrete ill-posed problems
- A penalty method for PDE-constrained optimization in inverse problems
- Edge-promoting reconstruction of absorption and diffusivity in optical tomography
- Edge-Enhancing Reconstruction Algorithm for Three-Dimensional Electrical Impedance Tomography
- Goal-Oriented Optimal Approximations of Bayesian Linear Inverse Problems
- Matrix forms of iterative algorithms to solve large-scale discrete ill-posed problems with an application to image restoration
- On the Lanczos and Golub–Kahan reduction methods applied to discrete ill‐posed problems
- 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
- 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
- Hybrid and Iteratively Reweighted Regularization by Unbiased Predictive Risk and Weighted GCV for Projected Systems
- 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
- Fast computation of reconciled forecasts for hierarchical and grouped time series
- Implementing the Alternating Direction Method of Multipliers for Big Datasets: A Case Study of Least Absolute Shrinkage and Selection Operator
- Trajectory-Based Methods for Modeling and Characterization
- Modified truncated randomized singular value decomposition (MTRSVD) algorithms for large scale discrete ill-posed problems with general-form regularization
- 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
- Some Properties of the Arnoldi-Based Methods for Linear Ill-Posed Problems
- Extension of GKB‐FP algorithm to large‐scale general‐form Tikhonov regularization
- Algorithms and application for special classes of nonlinear least squares problems
- A Flexible Uncertainty Propagation Framework for General Multiphysics Systems
- 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
- A Regularized Factorization-Free Method for Equality-Constrained Optimization
- The AZ Algorithm for Least Squares Systems with a Known Incomplete Generalized Inverse
- 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
- 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
- Projection Method for Eigenvalue Problems of Linear Nonsquare Matrix Pencils
- Hybrid methods for large sparse nonlinear least squares
- Sparse QR factorization on a massively parallel computer
- 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.
- Accuracy of preconditioned CG-type methods for least squares problems.
- Title not available (Why is that?)
- A Note on Sampling Recovery of Multivariate Functions in the Uniform Norm
- 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
- Modulus Methods for Nonnegatively Constrained Image Restoration
- 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
- A golden ratio primal-dual algorithm for structured convex optimization
- An isogeometric collocation method using superconvergent points
- Improvement of the minimal residual method for solving nonsymmetric linear systems
- A Framework for Regularization via Operator Approximation
- Using program package NSPCG to analyze the trunk reservation service protection method
- Preconditioners for Krylov subspace methods: An overview
- The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
- A new consistent splitting scheme for incompressible Navier-Stokes flows: a least-squares spectral element implementation
- On Iterative Solution of the Extended Normal Equations
- Preconditioned iterative methods for sparse linear algebra problems arising in circuit simulation
- A minimization method for the solution of large symmetriric eigenproblems
- Preconditioners for rank deficient least squares problems
- A breakdown of the block CG method
- An overview of NSPCG: A nonsymmetric preconditioned conjugate gradient package
- Application of fractional derivatives for obtaining new Tikhonov regularization matrices
- Sharp 2-Norm Error Bounds for LSQR and the Conjugate Gradient Method
- A class of incomplete orthogonal factorization methods. II: Implemetation and results
- A flow perspective on nonlinear least-squares problems
- On an iterative method for solving the least squares problem of rank-deficient systems
- Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods
- Macroscopically consistent non-local modeling of heterogeneous media
- Multipreconditioned Gmres for Shifted Systems
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
- A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems
- A stopping criterion for the iterative solution of partial differential equations
- Bayes Meets Krylov: Statistically Inspired Preconditioners for CGLS
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)