Preordering saddle‐point systems for sparse LDLT factorization without pivoting
From MaRDI portal
Publication:4558715
Recommendations
- Approximate Factorization Constraint Preconditioners for Saddle-Point Matrices
- Threshold incomplete factorization constraint preconditioners for saddle-point matrices
- Factorization-based sparse solvers and preconditioners
- Preconditioning sparse grad-div/augmented Lagrangian stabilized saddle point systems
- A comparative study of null-space factorizations for sparse symmetric saddle point systems.
- Sparse block factorization of saddle point matrices
- Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices
- A relaxed dimensional factorization preconditioner for generalized saddle point problems
- Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems
- Factorized parallel preconditioner for the saddle point problem
Cited in
(7)- On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices.
- Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots
- On signed incomplete Cholesky factorization preconditioners for saddle-point systems
- Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers
- Numerically aware orderings for sparse symmetric indefinite linear systems
- Pivoting strategy for rank-one modification of \(LDM^ t\)-like factorization
- Numerically stable LDLT-factorization of F-type saddle point matrices
This page was built for publication: Preordering saddle‐point systems for sparse LDLT factorization without pivoting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558715)
