Pivoting strategies for tough sparse indefinite systems
From MaRDI portal
Publication:3189697
DOI10.1145/2513109.2513113zbMATH Open1295.65054OpenAlexW2040082593WikidataQ113310323 ScholiaQ113310323MaRDI QIDQ3189697FDOQ3189697
Authors: J. D. Hogg, J. A. Scott 
Publication date: 12 September 2014
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2513109.2513113
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
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)
Cited In (11)
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- A survey of direct methods for sparse linear systems
- New parallel sparse direct solvers for multicore architectures
- An algebraic multifrontal preconditioner that exploits the low‐rank property
- 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
- On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices
- HSL_MI28
- A sparse symmetric indefinite direct solver for GPU architectures
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
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)
