HSL_MI28

swMATH13376MaRDI QIDQ25290FDOQ25290

Author name not available (Why is that?)

Described by source

• \texttt{HSL\_MI28}: an efficient and robust limited-memory incomplete Cholesky factorization code

Cited In (14)

• 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
• RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems
• Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization
• Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners
• Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
• An inexact dual logarithmic barrier method for solving sparse semidefinite programs
• The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
• Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems

This page was built for software: HSL_MI28