Pivoting strategies for tough sparse indefinite systems
From MaRDI portal
(Redirected from Publication:3189697)
Recommendations
- On fast factorization pivoting methods for sparse symmetric indefinite systems
- Compressed threshold pivoting for sparse symmetric indefinite systems
- On threshold pivoting in the multifrontal method for sparse indefinite systems
- Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners
- A new sparse LDL^T solver using a posteriori threshold pivoting
Cited in
(12)- 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 the use of suboptimal matchings for scaling and ordering sparse symmetric matrices.
- A survey of direct methods for sparse linear systems
- Sparse linear least-squares problems
- New parallel sparse direct solvers for multicore architectures
- A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners
- Approximation algorithms in combinatorial scientific computing
- Issues in the design of scalable out-of-core dense symmetric indefinite factorization algorithms
- An algebraic multifrontal preconditioner that exploits the low-rank property.
- A sparse symmetric indefinite direct solver for GPU architectures
- \texttt{HSL\_MI28}: an efficient and robust limited-memory incomplete Cholesky factorization code
Describes a project that uses
Uses Software
This page was built for publication: Pivoting strategies for tough sparse indefinite systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189697)
