论文信息 - BLOCK METHODS FOR SOLVING SPARSE LINEAR SYSTEMS - 字舞流文

BLOCK METHODS FOR SOLVING SPARSE LINEAR SYSTEMS

Abstract Graph-theoretic techniques for analyzing the solution of large sparse systems of linear equations by partitioning and using block methods are developed. Questions concerning stability of block methods are discussed.

James R. Bunch | J. Bunch

[1] A. George. On Block Elimination for Sparse Linear Systems , 1974 .

[2] J. Varah,et al. On the Solution of Block-Tridiagonal Systems Arising from Certain Finite-Difference Equations* , 1972 .

[3] James Hardy Wilkinson,et al. Error Analysis of Direct Methods of Matrix Inversion , 1961, JACM.

[4] J. Bunch,et al. Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations , 1971 .

[5] Fred G. Gustavson,et al. Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations , 1970, JACM.

[6] I. Duff,et al. A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations , 1976 .

[7] D. Rose. A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS , 1972 .

[8] J. Bunch. Partial Pivoting Strategies for Symmetric Matrices , 1972 .

[9] D. Rose,et al. Partitioning, tearing and modification of sparse linear systems , 1974 .

[10] R. Varga,et al. Block diagonally dominant matrices and generalizations of the Gerschgorin circle theorem , 1962 .

[11] J. O. Aasen. On the reduction of a symmetric matrix to tridiagonal form , 1971 .