Answers are grounded in this paper and cite their sources.
Kron’s techniques of tearing and k -partitioning are discussed as they apply to large linear systems of an arbitrary nature and tearing is discarded as inefficient. It is shown that decreasing the size of the sub-units in k -partitioning increases its efficiency; carried to the limit, this reduction results in a Gaussian elimination scheme. Finally, the optimum application of k -partitioning is presented as a linear programming problem.
No takes yet. Share an insight, caveat, or question.
William R. Spillers (1965) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: