Skyline matrix

From Wikipedia, the free encyclopedia

A skyline matrix, or a variable band matrix, is a form of a sparse matrix storage format for a square, banded (and typically symmetric) matrix that reduces the storage requirement of a matrix more than banded storage. In banded storage, all entries within a fixed distance from the diagonal (called half-bandwidth) are stored. In column oriented skyline storage, only the entries from the first nonzero entry to the last nonzero entry in each column are stored. There is also row oriented skyline storage, and, for symmetric matrices, only one triangle is usually stored.[1]

Skyline storage has become very popular in the finite element codes for structural mechanics, because the skyline is preserved by Cholesky decomposition (a method of solving systems of linear equations with a symmetric, positive-definite matrix; all fill-in falls within the skyline), and systems of equations from finite elements have a relatively small skyline. In addition, the effort of coding skyline Cholesky[2] is about same as for Cholesky for banded matrices (available for banded matrices, e.g. in LAPACK; for a prototype skyline code, see [2]).

Before storing a matrix in skyline format, the rows and columns are typically renumbered to reduce the size of the skyline (the number of nonzero entries stored) and to decrease the number of operations in the skyline Cholesky algorithm. The same heuristic renumbering algorithm that reduce the bandwidth are also used to reduce the skyline. The basic and one of the earliest algorithms to do that is RCM (Reverse Cuthill-McKee algorithm).

However, skyline storage is not as popular for very large systems (many millions of equations) because skyline Cholesky is not so easily adapted for massively parallel computing, and general sparse methods,[3] which store only the nonzero entries of the matrix, become more efficient for very large problems due to much less fill-in.

[edit] See also

[edit] References

  1. ^ Skyline Storage (SKS), in R. Barrett, M. Berry,T. F. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine and H. Van der Vorst, Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, 2nd Edition (online only), SIAM, 1994. 1st edition 1987/1993 hardcopy ISBN 978-0-898713-28-2 ISBN ISBN 0-89871-328-5
  2. ^ a b George, Alan and Liu, Joseph W. H., Computer solution of large sparse positive definite systems, Prentice-Hall Inc., 1981. ISBN 0131652745 This book contains also the description and source code of simple routines that are still useful even if they have been long superseded.
  3. ^ Iain S Duff, Albert M. Erisman, and John K. Reid, Direct methods for sparse matrices, Oxford University Press, 1986 ISBN 0-198-53408-6