New Pivot Selection for Sparse Symmetric Indefinite Factorization

2016/01/25 by Jetpipattanapong, Duangpen, Srijuntongsiri, Gun
#FOS: Mathematics #Numerical Analysis (math.NA)

paper · doi:10.48550/arxiv.1601.06812

Abstract

We propose a new pivot selection technique for symmetric indefinite factorization of sparse matrices. Such factorization should maintain both sparsity and numerical stability of the factors, both of which depend solely on the choices of the pivots. Our method is based on the minimum degree algorithm and also considers the stability of the factors at the same time. Our experiments show that our method produces factors that are sparser than the factors computed by MA57 and are stable.

Related

• Compressed threshold pivoting for sparse symmetric indefinite systems
• Wilkinson's Inertia-Revealing Factorization and Its Application to Sparse Matrices
• Matrix Factorizations with Uniformly Random Pivoting
• Enabling Pivoting in the Formal Derivation of LU factorization
• SYM-ILDL: Incomplete LDL^T Factorization of Symmetric Indefinite and Skew-Symmetric Matrices