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

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)

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
Improvement of the minimal residual method for solving nonsymmetric linear systems
A note on sampling recovery of multivariate functions in the uniform norm
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
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
A class of incomplete orthogonal factorization methods. II: Implemetation and results
A flow perspective on nonlinear least-squares problems
Projection method for eigenvalue problems of linear nonsquare matrix pencils
On an iterative method for solving the least squares problem of rank-deficient systems
A framework for regularization via operator approximation
Macroscopically consistent non-local modeling of heterogeneous media
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
On iterative solution of the extended normal equations
A stopping criterion for the iterative solution of partial differential equations
Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
The non-uniqueness of the atomistic stress tensor and its relationship to the generalized Beltrami representation
Hierarchical orthogonal factorization: sparse least squares problems
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
A Golub-Kahan-type reduction method for matrix pairs
Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction
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
Tikhonov regularization and the L-curve for large discrete ill-posed problems
On the real convergence rate of the conjugate gradient method
Old and new parameter choice rules for discrete ill-posed problems
A generalized LSQR algorithm
Inheritance of the discrete Picard condition in Krylov subspace methods
LSQR

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)