Partitioning, tearing and modification of sparse linear systems
- 1 November 1974
- journal article
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 48 (2) , 574-593
- https://doi.org/10.1016/0022-247x(74)90179-6
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On Block Elimination for Sparse Linear SystemsSIAM Journal on Numerical Analysis, 1974
- Toward Characterization of Perfect Elimination DigraphsSIAM Journal on Computing, 1973
- A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONSPublished by Elsevier ,1972
- Modification methods for inverting matrices and solving systems of linear algebraic equationsMathematics of Computation, 1972
- A transitive closure algorithmBIT Numerical Mathematics, 1970
- An algorithm for solving a special class of tridiagonal systems of linear equationsCommunications of the ACM, 1969
- Triangular factors of modified matricesNumerische Mathematik, 1965
- A graph theoretic approach to matrix inversion by partitioningNumerische Mathematik, 1962
- On an Approach to Techniques for the Analysis of the Structure of Large Systems of EquationsSIAM Review, 1962
- On the inversion of sparse matricesMathematics of Computation, 1962