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)

The joint bidiagonalization process with partial reorthogonalization
A hybrid sensitivity function and Lanczos bidiagonalization-Tikhonov method for structural model updating: application to a full-scale bridge structure
Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs
A robust algorithm for semidefinite programming
On the convergence of the Bl-LSQR algorithm for solving matrix equations
A survey of direct methods for sparse linear systems
Approximating the extreme Ritz values and upper bounds for the \(A\)-norm of the error in CG
Coordinate difference matrices
Solving semidefinite programs using preconditioned conjugate gradients
Restrictively preconditioned conjugate gradient method for a series of constantly augmented least squares problems
A generalized projection iterative methods for solving non-singular linear systems
Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
Some results on the regularization of LSQR for large-scale discrete ill-posed problems
A hybrid LSMR algorithm for large-scale Tikhonov regularization
Random walks on simplicial complexes and the normalized Hodge 1-Laplacian
A multi-iterate method to solve systems of nonlinear equations
A joint bidiagonalization based iterative algorithm for large scale general-form Tikhonov regularization
A new iterative model updating technique based on least squares minimal residual method using measured modal data
Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems
Preconditioners for symmetrized Toeplitz and multilevel Toeplitz matrices
Solving Hankel matrix approximation problem using semidefinite programming
Noise representation in residuals of LSQR, LSMR, and CRAIG regularization
The block Lanczos algorithm for linear ill-posed problems
Peaks, plateaus, numerical instabilities in a Galerkin minimal residual pair of methods for solving \(Ax=b\)
Large scale least squares scattered data fitting
Conditioning of multiple-point statistics facies simulations to tomographic images
Fitting multiple Bell curves stably and accurately to a time series as applied to Hubbert cycles or other phenomena
Greedy Tikhonov regularization for large linear ill-posed problems
Automatic stopping rule for iterative methods in discrete ill-posed problems
Preconditioning and Iterative Solution of All-at-Once Systems for Evolutionary Partial Differential Equations
Partial condition number for the equality constrained linear least squares problem
Fast \(l_ p\) solution of large, sparse, linear systems: Application to seismic travel time tomography
The solution of large-scale least-squares problems on supercomputers
Iterative methods for solving consistent or inconsistent matrix inequality \({AXB} \geqslant C\) with linear constraints
High resolution inverse scattering in two dimensions using recursive linearization
Vector processing in simplex and interior methods for linear programming
Solving emission tomography problems on vector machines
A new taxonomy of conjugate gradient methods
Efficient linear discriminant analysis with locality preserving for face recognition
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
Conjugate gradient based acceleration for inverse problems
Computational experience with numerical methods for nonnegative least-squares problems.
Solution methods for linear discrete ill-posed problems for color image restoration
Simple and efficient determination of the Tikhonov regularization parameter chosen by the generalized discrepancy principle for discrete ill-posed problems
Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications
Simple stopping criteria for the LSQR method applied to discrete ill-posed problems
Variable projection for nonlinear least squares problems
FGMRES for linear discrete ill-posed problems
An iterative algorithm for a least squares solution of a matrix equation
Approximate Toeplitz matrix problem using semidefinite programming
A fast and accurate algorithm for spherical harmonic analysis on HEALPix grids with applications to the cosmic microwave background radiation
On the solution of a two ball trust region subproblem
Efficient GOCE satellite gravity field recovery based on least-squares using QR decomposition
Discrete vector calculus and Helmholtz Hodge decomposition for classical finite difference summation by parts operators
Relax-and-split method for nonconvex inverse problems
Tensor Equivalents for Solution of Linear Systems: A Parallel Algorithm
Fast boundary-domain integral method for heat transfer simulations
A preconditioned MINRES method for nonsymmetric Toeplitz matrices
Parallel tensor methods for high-dimensional linear PDEs
An efficient method for solving a matrix least squares problem over a matrix inequality constraint
Testing matrix function algorithms using identities
Regularization parameter estimation for large-scale Tikhonov regularization using a priori information
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

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)