Workshop Celebrating 40 Years of Nested Dissection

July 22-23, 2013

William G. Davis Computer Research Centre (Davis Centre)
Main Hall, Room 1302
University of Waterloo
Waterloo, Canada

Nested dissection was first described by Alan George in a 1973 paper in the SIAM Journal on Numerical Analysis. The original algorithm aimed at reducing fill in the Cholesky factorization of a sparse symmetric positive definite matrix associated with a discretization of a square domain, and was shown to be optimal in terms of nonzero and operation counts, in the asymptotical sense. Many researchers have generalized the nested dissection algorithm to more general sparse matrices, both symmetric and nonsymmetric. Generalized nested dissection uses a graph that represents the sparsity structure of the matrix; this connection has motivated an enormous body of work in the theory and practice of graph partitioning. Nested dissection and its generalizations have been important in sparse matrix computation, from theory to algorithms to software, implemented on serial and parallel computers, from desktops to today's largest HPC machines. Furthermore, nested dissection and its generalizations have also found their way into other scientific applications, such as analysis of social networks and data mining.

The year 2013 marks the 40th year since the publication of the original nested dissection algorithm. This workshop is to celebrate this occasion. It will review the successes of the past, as well as looking forward to the future. The workshop will feature both invited talks and contributed talks.

Call for abstracts

There will be contributed talks. Those interested in giving a short presentation are welcome to submit an abstract.
Graduate students are encouraged to participate and present their work.

Deadline: March 31, 2013.

Extended deadline: April 15, 2013.



David R. Cheriton School of Computer Science
200 University Avenue West
University of Waterloo
Waterloo, Ontario N2L 3G1