A three‐dimensional symmetric linear equation solver

Abstract

AbstractFactorization procedures for the efficient solution of large sparse linear finite difference systems have been introduced recently. In these procedures the large sparse symmetric coefficient matrix of a certain structure is factorized exactly, yielding a direct solution method. Furthermore, approximate factorization procedures yeild implicit preconditioning iterative methods for the finite difference solution. The numerical implementation of these algorithms is presented and Fortran subroutines for the efficient solution of the resulting sparse symmetric linear system of algebraic equations are given.