Algorithms and Data Structures for Sparse Symmetric Gaussian Elimination

DOI10.1137/0902019MaRDI QIDQ3922077zbMATH OpenOpenAlexFDO

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

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

data structuressparse Gaussian eliminationsparse matricessymmetric codesYale sparse matrix package

Mathematics Subject Classification ID

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

Cited in

(8)

• An efficient simplex type algorithm for sparse and dense linear programs.
• Enumerating the edge-colourings and total colourings of a regular graph
• On the Grundy number of a graph
• A mathematical and numerical investigation of the hemodynamical origins of oscillations in microvascular networks
• Sparse matrices, and the estimation of variance components by likelihood methods
• Exactly solving sparse rational linear systems via roundoff-error-free Cholesky factorizations
• A survey of direct methods for sparse linear systems
• A two level solver for \(h{-}p\) adaptive finite element equations

Describes a project that uses

Uses Software

• YSMP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3922077)