Bunch, James R.; Rose, Donald J. Partitioning, tearing and modification of sparse linear systems. (English) Zbl 0294.15003 J. Math. Anal. Appl. 48, 574-593 (1974). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 12 Documents MSC: 15A06 Linear equations (linear algebraic aspects) 05A17 Combinatorial aspects of partitions of integers 65F05 Direct numerical methods for linear systems and matrix inversion 65F30 Other matrix algorithms (MSC2010) PDF BibTeX XML Cite \textit{J. R. Bunch} and \textit{D. J. Rose}, J. Math. Anal. Appl. 48, 574--593 (1974; Zbl 0294.15003) Full Text: DOI References: [3] Branin, F. H., The Relation between Kron’s Method and the Classical Methods of Network Analysis, (IRE WESCON Convention Record, Part 2 (1959)), 1-29 [4] Bunch, J. R.; Rose, D. J., (A summary appears in the “Proceedings of the Sixth Hawaii International Conference on System Sciences,” HICSS-6 (January, 1973)), 41-44, Second Supplement [8] Harary, F., Graph Theory (1969), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0797.05064 [10] Haskins, L.; Rose, D. J., Toward characterization of perfect elimination digraphs, SIAM J. Comput., 2, 217-224 (1973) · Zbl 0288.05115 [11] Householder, A. S., The Theory of Matrices in Numerical Analysis (1964), Blaisdell: Blaisdell New York · Zbl 0161.12101 [13] Read, R., Graph Theory and Computing (1972), Academic Press: Academic Press New York · Zbl 0243.00006 [16] Rose, D. J.; Bunch, J. R., The role of partitioning in the numerical solution of sparse systems, (Sparse Matrices and their Applications (1972), Plenum Press: Plenum Press New York) [17] (Rose, D. J.; Willoughby, R. A., Sparse Matrices and Their Applications (1972), Plenum Press: Plenum Press New York) [20] Tarjan, R. E., Depth-first search and linear graph algorithms, SIAM J. Comput., 1, No. 2, 146-160 (June, 1972) [22] Varga, R. S., Matrix Iterative Analysis (1962), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ · Zbl 0133.08602 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.