Parallelizing Elimination Orders with Linear Fill


This paper presents an algorithm for nding parallel elimination orders for Gaussian elimination Viewing a system of equations as a graph the algorithm can be applied directly to interval graphs and chordal graphs For general graphs the algorithm can be used to paral lelize the order produced by some other heuristic such as minimum degree In this case the… (More)
DOI: 10.1109/SFCS.1997.646116


  • Presentations referencing similar topics