A partitioning algorithm for solving systems of linear equations
Theodore J. Sheskin · International Journal of Mathematical Education in Science and Technology · 1996
An interesting new partitioning algorithm for solving simultaneous linear equations is presented. The partitioning algorithm consists of a procedure called matrix reduction which is followed by back substitution. During the matrix reduction procedure the algorithm generates a sequence of partitioned augmented matrices which are successively reduced in size by computing their Schur complements. A numerical example problem for a linear system of equations for an electrical network is solved.