Pivoting strategies for tough sparse indefinite systems
From MaRDI portal
Publication:3189697
DOI10.1145/2513109.2513113zbMath1295.65054OpenAlexW2040082593WikidataQ113310323 ScholiaQ113310323MaRDI QIDQ3189697
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
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners, On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices, On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems, HSL_MI28, New parallel sparse direct solvers for multicore architectures, An algebraic multifrontal preconditioner that exploits the low‐rank property, A survey of direct methods for sparse linear systems, A Sparse Symmetric Indefinite Direct Solver for GPU Architectures, Approximation algorithms in combinatorial scientific computing, Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
Uses Software
