Optimal Pivoting Algorithm in Gaussian Elimination for Sparse Matrices and its FORTRAN Program.

In the process of solving the linear epuation by the Gaussian Elimination or other comparable technigues, a computational interest is the pivotal ordering of the coefficient matix for the given set of epuations. This paper describes the algorithm fit for a large scale sparse matrices. The algorithm is essentially so called "minimum fill-in" but the method to obtain the minimum fill-in is unigue and some other criteria are added in oder to improve the optimality. Comparisions are made withe Ghausi method by actual program and results are given