Optimal elimination for sparse symmetric systems as a graph problem.

DOI10.1090/QAM/233497MaRDI QIDQ5548723zbMATH OpenOpenAlexFDO

Authors W. R. Spillers, N. Hickerson

Publication date 1968

Published in Quarterly of Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/qam/233497

zbMATH Keywords

operations research

Cited in

(7)

• Some Results on Sparse Matrices
• On solving problems with sparse matrices
• Computational methods of linear algebra
• Elimination on sparse symmetric systems of a special structure
• Nonserial dynamic programming: On the optimal strategy of variable elimination for the rectangular lattice
• Examples concerning efficient strategies for Gaussian elimination
• On the theory of the elimination process

This page was built for publication: Optimal elimination for sparse symmetric systems as a graph problem.

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