Optimal elimination for sparse symmetric systems as a graph problem.

DOI10.1090/QAM/233497zbMath0164.20102OpenAlexW2564856021MaRDI QIDQ5548723

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

Related Items (7)

Computational methods of linear algebra ⋮ Some Results on Sparse Matrices ⋮ On solving problems with sparse matrices ⋮ 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 ⋮ Elimination on sparse symmetric systems of a special structure

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