Sparse Matrix Technology - electronic editionAcademic Press, 1984 - 321 pages |
Contents
| 1 | |
| 5 | |
Linear Algebraic Equations | 35 |
Numerical Errors in Gauss Elimination | 63 |
Symmetric Matrices | 85 |
General Matrices | 143 |
Sparse Eigenanalysis | 177 |
Sparse Matrix Algebra | 211 |
Connectivity and Nodal Assembly | 249 |
General Purpose Algorithms | 267 |
Bibliography and Index | 281 |
Common terms and phrases
active submatrix adjacent array augmenting path band matrix bandwidth belong block calculated Chapter column indices computed connected consider convenient convergence corresponding defined depth-first search diagonal elements digraph discussed in Section Duff edges eigenproblem eigenvectors EISPACK example fill-in finite element Fortran Gauss elimination given matrix graph of Fig graph theory integers inverse inverse iteration iteration labelling Lanczos algorithm level structure linear equations lower triangular Math method minimal multiple switch nested dissection nonzeros of row number of nonzeros obtained off-diagonal nonzeros orthogonal partitioning performed permuted matrix pointers procedure representation resulting matrix Ritz rooted row-wise format rows and columns shown in Fig solution solved sparse matrix sparse matrix technology sparsity stack starting vertex storage scheme stored strong component submatrix symbolic symmetric matrix symmetric positive definite tree arcs triangular factorization tridiagonal undirected graph unit diagonal unsymmetric upper triangular vertex vertices zeros