Elimination Structures in Scientific Computing

@inproceedings{Pothen2004EliminationSI,
  title={Elimination Structures in Scientific Computing},
  author={Alex Pothen and Sivan Toledo},
  booktitle={Handbook of Data Structures and Applications},
  year={2004}
}
Tel-Aviv University 1.1 The elimination tree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1-2 The elimination game • The elimination tree data structure • An algorithm • A skeleton graph • Supernodes 1.2 Applications of etrees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1-8 Efficient symbolic factorization • Predicting row and column nonzero counts • Three classes of factorization algorithms • Scheduling parallel factorizations • Scheduling out-of… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-9 of 9 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 70 references

An efficient algorithm to compute row and column counts for sparse Cholesky factorization

  • John R. Gilbert, Esmond G. Ng, Barry W. Peyton
  • SIAM Journal on Matrix Analysis and Applications,
  • 1994
Highly Influential
12 Excerpts

An introduction to chordal graphs and clique trees

  • Jean R.S. Blair, Barry W. Peyton
  • 1993
Highly Influential
11 Excerpts

Similar Papers

Loading similar papers…