Abstract

A class of first order factorization methods for the solution of large, symmetric, sparse systems of equations is introduced. Asymptotic results for the computational complexity are developed, results from numerical experiments are presented and comparisons with other iterative and direct methods are carried out.

Links and resources

Tags