E. Cuthill
ABSTRACT
The finite element displacement method of analyzing structures involves the solution of large systems of linear algebraic equations with sparse, structured, symmetric coefficient matrices. There is a direct correspondence between the structure of the coefficient matrix, called the stiffness matrix in this case, and the structure of the spatial network delineating the element layout. For the efficient solution of these systems of equations, it is desirable to have an automatic nodal numbering (or renumbering) scheme to ensure that the corresponding coefficient matrix will have a narrow bandwidth. This is the problem considered by R. Rosen1. A direct method of obtaining such a numbering scheme is presented. In addition several methods are reviewed and compared.
- 1.R. Rosen, "Matrix bandwidth minimization." Proceedings of 23rd National Conference, ACM, ACM Publication P-68, Brandon/Systems Press, Princeton, N. J. (1968), pp. 585-595. Google Scholar
Digital Library
- 2.R. S. Varga, "Matrix Iterative Analysis." Prentice-Hall, Inc., New York (1962).Google Scholar
- 3.B. A. Carré, "The partitioning of network problems for block iteration." Computer Journal 9, (1966), pp. 84-97.Google ScholarCross Ref
- 4.S. Parter, "The use of linear graphs in Gauss elimination." SIAM Review 3, (1961), pp. 119-130.Google ScholarDigital Library
- 5.N. Sato and W. F. Tinney, "Techniques for exploiting the sparsity of the network admittance matrix." IEEE Transactions on Power Apparatus and Systems, 82, (1963), pp. 944-950.Google ScholarCross Ref
- 6.R. P. Tewarson, "Solution of a system of simultaneous linear equations with a sparse coefficient matrix by elimination methods." BIT 7, (1967), pp. 226-239.Google ScholarDigital Library
- 7.A. Nathan and R. K. Even, "The inversion of sparse matrices by a strategy derived from their graphs." Computer Journal 9, (1966), pp. 190-194.Google Scholar
- 8.D. V. Steward, "On an approach to techniques for the analysis of the structure of large systems of equations." SIAM Review 4, (1962), pp. 321-342.Google ScholarDigital Library
- 9.R. P. Tewarson, "Row-Column permutation of sparse matrices." Computer Journal 10, (1967), pp. 300-305.Google ScholarCross Ref
- 10.F. A. Akyuz and S. Utku, "An automatic relabeling scheme for bandwidth minimization of stiffness matrices." AIAA Journal, 6, (1968), pp. 728-730.Google ScholarCross Ref
- 11.G. G. Alway and D. W. Martin, "An algorithm for reducing the bandwidth of a matrix of symmetrical configuration." Computer Journal 8, (1965), pp. 264-272.Google ScholarCross Ref
- 12.A. Jennings, "A compact storage scheme for the solution of symmetric linear simultaneous equations." Computer Journal 9, (1966), pp.281-285Google ScholarCross Ref
- 13.F. Harary, "A graph theoretic approach to matrix inversion by partitioning." Numerische Mathematik, 4, (1962), pp. 128-135.Google ScholarDigital Library
Index Terms
- Reducing the bandwidth of sparse symmetric matrices
Recommendations
Inverse problems for symmetric matrices with a submatrix constraint
This paper is concerned with the following problems: Problem I(a). Given a full column rank matrix X@?R^n^x^p and symmetric matrices B@?R^p^x^p and A"0@?R^r^x^r, find an nxn symmetric matrix A such thatX^TAX=B,A([1,r])=A"0, where A([1,r]) is the rxr ...
Constraint Preconditioners for Symmetric Indefinite Matrices
We study the eigenvalue bounds of block two-by-two nonsingular and symmetric indefinite matrices whose $(1,1)$ block is symmetric positive definite and Schur complement with respect to its $(2,2)$ block is symmetric indefinite. A constraint ...
Accurate Symmetric Rank Revealing and Eigendecompositions of Symmetric Structured Matrices
We present new $O(n^3)$ algorithms that compute eigenvalues and eigenvectors to high relative accuracy in floating point arithmetic for the following types of matrices: symmetric Cauchy, symmetric diagonally scaled Cauchy, symmetric Vandermonde, and ...
Comments