Workshop Celebrating 40 Years of Nested Dissection -- Third Announcement
Esmond Ng <egng-/[email protected]> Fri, 22 Feb 2013 10:18:08 -0800
| Newsgroups | gmane.comp.mathematics.csc |
|---|---|
| Message-ID | <CAEeW81Upg6n6huMSgAf=-xAr-aSU5D2V1jeWYUxuiAuE6u3z_w@mail.gmail.com> |
Workshop Celebrating 40 Years of Nested Dissection -- Third Announcement Location: University of Waterloo, Waterloo, Canada Date: July 22-23, 2013 URL: https://cs.uwaterloo.ca/conferences/nd40/ Contributed presentations are invited in all areas consistent with the conference themes, which include but are not limited to sparse matrix computation, ordering algorithms, graph partitioning, and application of sparse matrix and graph partitioning algorithms. Those interested in giving a contributed talk must submit a title and a brief abstract not to exceed one page by email to [email protected] Abstract submission deadline: March 31, 2013 Notification of acceptance: April 30, 2013 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 asymptotic 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. A workshop will be organized at the University of Waterloo on July 22-23, 2013 to celebrate this occasion. This workshop 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. Further information will be available shortly. Organizers: Esmond G. Ng, Lawrence Berkeley National Laboratory Justin Wan, University of Waterloo _______________________________________________ Csc mailing list [email protected] https://lists.purdue.edu/mailman/listinfo/csc