Sparse Direct Methods
Sparse Elimination much more complicated than dense
- Only store and compute with nonzero entries in A
- More nonzero “fill-in” as elimination proceeds
- Hard to organize the algorithm so that most time not spent in traversing data structures, rather than floating point.
- Fill-in, parallelizability, cost depends strongly on order of equations.
- Many parallelization strategies, depending on structure.