29.01.2015 Views

SuperLU: Sparse Direct Solver

SuperLU: Sparse Direct Solver

SuperLU: Sparse Direct Solver

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Ordering for <strong>Sparse</strong> Cholesky (2/2, cont.)<br />

Generalized nested dissection [Lipton/Rose/Tarjan ’79]<br />

Global graph partitioning: top-down, divide-and-conqure<br />

First level<br />

Recurse on A and B<br />

Goal: find the smallest possible separator S at each level<br />

Multilevel schemes:<br />

A S B<br />

⎡ A 0 x ⎤<br />

⎢<br />

⎥<br />

⎢<br />

0 B x<br />

⎥<br />

⎢⎣<br />

x x S ⎥⎦<br />

Chaco [Hendrickson/Leland `94], Metis [Karypis/Kumar `95]<br />

Spectral bisection [Simon et al. `90-`95]<br />

Geometric and spectral bisection [Chan/Gilbert/Teng `94]<br />

X. Li<br />

14

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!