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)
- 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
- Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
- 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
- Trajectory-based methods for modeling and characterization
- On regularizing effects of MINRES and MR-II for large scale symmetric discrete ill-posed problems
- Hybrid and iteratively reweighted regularization by unbiased predictive risk and weighted GCV for projected systems
- A penalty method for PDE-constrained optimization in inverse problems
- Edge-promoting reconstruction of absorption and diffusivity in optical tomography
- Matrix forms of iterative algorithms to solve large-scale discrete ill-posed problems with an application to image restoration
- 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
- A regularized factorization-free method for equality-constrained optimization
- Accuracy of the Lanczos process for the eigenproblem and solution of equations
- The AZ algorithm for least squares systems with a known incomplete generalized inverse
- 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
- Flexible Krylov methods for \(\ell_p\) regularization
- 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
- Interpretable approximation of high-dimensional data
- Fast computation of reconciled forecasts for hierarchical and grouped time series
- On the Lanczos and Golub-Kahan reduction methods applied to discrete ill-posed problems.
- Edge-enhancing reconstruction algorithm for three-dimensional electrical impedance tomography
- Modified truncated randomized singular value decomposition (MTRSVD) algorithms for large scale discrete ill-posed problems with general-form regularization
- Goal-oriented optimal approximations of Bayesian linear inverse problems
- 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
- Algorithms and application for special classes of nonlinear least squares problems
- 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
- Extension of GKB-FP algorithm to large-scale general-form Tikhonov regularization.
- A flexible uncertainty propagation framework for general multiphysics systems
- Some properties of the Arnoldi-based methods for linear ill-posed problems
- Implementing the alternating direction method of multipliers for big datasets: a case study of least absolute shrinkage and selection operator
- 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
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)