Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Bernard Carré (1966) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: