Minimal Orderings Revisited

From MaRDI portal

Publication:2784346

Jump to:navigation, search

DOI10.1137/S089547989936443XzbMath1044.65035MaRDI QIDQ2784346

Barry W. Peyton

Publication date: 23 April 2002

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

numerical examples minimum degree nested dissection minimal fill supernodes elimination trees sparse matrix computations LEX M algorithm minimal orderings sparse Choleski factorization

Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).

Related Items (6)

Minimal triangulations of graphs: a survey ⋮ Lex M versus MCS-M ⋮ Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree ⋮ Efficiently enumerating minimal triangulations ⋮ Treewidth computations. I: Upper bounds ⋮ A survey of direct methods for sparse linear systems

This page was built for publication: Minimal Orderings Revisited

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2784346&oldid=15672250"

Pages with script errors