Algorithm for solving a large and scattered system of algebraic equations

Abstract

This algorithm solves a very large and sparse system of linear algebraic equations. The sparseness of the system allows for a pre-triangularization of the equations such that, using a partitioning method, they can be solved by a combination of:

1) The solution of a small dense system by maximum pivot elimination with residue iteration;
2) The solution of a large triungular system by prior substitution.