On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
From MaRDI portal
Publication:5350438
DOI10.1137/16M1065380zbMath1372.65094WikidataQ114074331 ScholiaQ114074331MaRDI QIDQ5350438
Publication date: 1 September 2017
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
regularizationpreconditioningparallel computationiterative methodssparse matricesnumerical experimentnormal equationsleast squares problemsdirect methodsaugmented systemCholesky factorizations
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows ⋮ Preconditioners for Krylov subspace methods: An overview ⋮ Preconditioners for rank deficient least squares problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization
- On the augmented system approach to sparse least-squares problems
- Unsymmetric positive definite linear systems
- Experimental study of ILU preconditioners for indefinite matrices
- New parallel sparse direct solvers for multicore architectures
- Preconditioning techniques for large linear systems: A survey
- Solution of sparse rectangular systems using LSQR and Craig
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Crout versions of ILU factorization with pivoting for sparse symmetric matrices
- Condition numbers and equilibration of matrices
- A Sparse Symmetric Indefinite Direct Solver for GPU Architectures
- Fine-Grained Multithreading for the Multifrontal $QR$ Factorization of Sparse Matrices
- On Positive Semidefinite Modification Schemes for Incomplete Cholesky Factorization
- Preconditioned Iterative Methods for Solving Linear Least Squares Problems
- An out-of-core sparse Cholesky solver
- The university of Florida sparse matrix collection
- Algorithm 915, SuiteSparseQR
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
- SYM-ILDL
- Pivoting strategies for tough sparse indefinite systems
- MIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least‐Squares Problems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- An algorithm for profile and wavefront reduction of sparse matrices
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Preconditioners for Indefinite Systems Arising in Optimization
- Solution of Sparse Indefinite Systems of Linear Equations
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- Incomplete Cholesky Factorizations with Limited Memory
- The Factorization of Sparse Symmetric Indefinite Matrices
- Symmetric Quasidefinite Matrices
- On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
- On Signed Incomplete Cholesky Factorization Preconditioners for Saddle-Point Systems
- Design of a Multicore Sparse Cholesky Factorization Using DAGs
- Convergence of Inner-Iteration GMRES Methods for Rank-Deficient Least Squares Problems
- Fine-Grained Parallel Incomplete LU Factorization
- HSL_MI28
- Inner-Iteration Krylov Subspace Methods for Least Squares Problems
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
