On diakoptics: Tearing an arbitrary system
- 1 January 1965
- journal article
- Published by American Mathematical Society (AMS) in Quarterly of Applied Mathematics
- Vol. 23 (2) , 188-190
- https://doi.org/10.1090/qam/99942
Abstract
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.Keywords
This publication has 3 references indexed in Scilit:
- Network Analogy for Linear StructuresJournal of the Engineering Mechanics Division, 1963
- An application of algebraic topology: Kron’s method of tearingQuarterly of Applied Mathematics, 1959
- A Survey of Some Closed Methods for Inverting MatricesJournal of the Society for Industrial and Applied Mathematics, 1957