Algorithms and Data Structures for Sparse Symmetric Gaussian Elimination

DOI10.1137/0902019zbMath0468.65016OpenAlexW2069857942MaRDI QIDQ3922077

Andrew H. Sherman, Stanley C. Eisenstat, Martin H. Schultz

Publication date: 1981

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0902019

zbMATH Keywords

sparse matricesdata structuressparse Gaussian eliminationYale sparse matrix packagesymmetric codes

Mathematics Subject Classification ID

Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (8)

Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations ⋮ A mathematical and numerical investigation of the hemodynamical origins of oscillations in microvascular networks ⋮ A two level solver for \(h{-}p\) adaptive finite element equations ⋮ Enumerating the edge-colourings and total colourings of a regular graph ⋮ Sparse matrices, and the estimation of variance components by likelihood methods ⋮ A survey of direct methods for sparse linear systems ⋮ On the Grundy Number of a Graph ⋮ An efficient simplex type algorithm for sparse and dense linear programs.

Uses Software

• YSMP

This page was built for publication: Algorithms and Data Structures for Sparse Symmetric Gaussian Elimination