Solution of sparse rectangular systems using LSQR and Craig
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4211379
- Solution of sparse quasi-square rectangular systems by Gaussian elimination
- Solution of Sparse Underdetermined Systems of Linear Equations
- Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class
- The calculation of linear least squares problems
- Stability analysis of the method of seminormal equations for linear least squares problems
- Sparse QR factorization in MATLAB
Cites work
- scientific article; zbMATH DE number 3843065 (Why is no real title available?)
- scientific article; zbMATH DE number 3181418 (Why is no real title available?)
- scientific article; zbMATH DE number 556478 (Why is no real title available?)
- A Storage-Efficient Algorithm for Finding the Regularized Solution of a Large, Inconsistent System of Equations
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems
- Iterative refinement of linear least squares solutions I
- Krylov subspace processes, Krylov subspace methods, and iteration polynomials
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- On Row Relaxation Methods for Large Constrained Least Squares Problems
- On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
- On the augmented system approach to sparse least-squares problems
- Solution of Sparse Indefinite Systems of Linear Equations
- Sparse QR factorization in MATLAB
- Symmetric Quasidefinite Matrices
- Test Matrices for Regularization Methods
- The N‐Step Iteration Procedures
- Unsymmetric positive definite linear systems
Cited in
(24)- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- Sharp 2-norm error bounds for LSQR and the conjugate gradient method
- Computing projections with LSQR
- Euclidean-norm error bounds for SYMMLQ and CG
- Estimating error norms in CG-like algorithms for least-squares and least-norm problems
- Analysis of approximate inverses in tomography. II: Iterative inverses
- Preconditioning linear least-squares problems by identifying a basis matrix
- Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems
- Minimum residual methods for augmented systems
- Noise representation in residuals of LSQR, LSMR, and CRAIG regularization
- A fast implementation for GMRES method
- Deflation for the Off-Diagonal Block in Symmetric Saddle Point Systems
- LSLQ: an iterative method for linear least-squares with an error minimization property
- Modifying the inertia of matrices arising in optimization
- Implicit iterative schemes based on augmented linear systems
- A primal-dual regularized interior-point method for convex quadratic programs
- CVXGEN: a code generator for embedded convex optimization
- A class of approximate inverse preconditioners based on Krylov-subspace methods for large-scale nonconvex optimization
- Simple stopping criteria for the LSQR method applied to discrete ill-posed problems
- Solving large linear least squares problems with linear equality constraints
- Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations
- Analyzing vector orthogonalization algorithms
- LNLQ: an iterative method for least-norm problems with an error minimization property
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
This page was built for publication: Solution of sparse rectangular systems using LSQR and Craig
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1907877)
