Cited in
(36)- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- On positive semidefinite modification schemes for incomplete Cholesky factorization
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners
- On signed incomplete Cholesky factorization preconditioners for saddle-point systems
- Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
- Two-level Nyström-Schur preconditioner for sparse symmetric positive definite matrices
- HSL
- SPARSPAK
- Algorithm 740
- MIQR
- SuiteSparseQR
- Algorithm 695
- LSRN
- HSL_MA97
- LSMR
- HSL_MP42
- SYM-ILDL
- HSL_MA77
- CIMGS
- MA28
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization
- YSMP
- profile wavefront
- Algorithm 980
- HSL MC68
- HSL MC80
- HSL_MI30
- ParILUT
- RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems
- Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
- Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners
- Laplacians.jl
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
This page was built for software: HSL_MI28
