The Partitioning of Network Equations for Block Iteration
Open Access
- 1 May 1966
- journal article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 9 (1) , 84-97
- https://doi.org/10.1093/comjnl/9.1.84
Abstract
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.Keywords
This publication has 0 references indexed in Scilit: