Direct Sparse Equation Solvers

A detailed explanation (including examples) of sparse storage schemes for storing large sparse (stiffness) matrix, sparse symbolic factorization, sparse numerical factorization, sparse forward and backward solvers, different reordering algorithms (to minimize nonzero fills-in terms occurred during the symbolic factorization phase), super-nodes and unrolling strategies to improve computational efficiencies of Cholesky (and unsymmetrical) solvers, and alternative approach for handling indefinite system of linear equations are all presented in this chapter.