The Partitioning of Network Equations for Block Iteration
Bernard Carré · The Computer Journal · 1966
This paper presents a graph-theoretic approach to the problem of finding best orderings and partitionings of systems of equations to be solved by block iterative methods, and describes a method for obtaining convenient partitionings of sparse disorderly systems such as commonly arise in network problems.