Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.parallel > #494

Workshop Celebrating 40 Years of Nested Dissection -- Third Announcement

Cross-posted to 2 groups.

Show all headers | View raw

Workshop Celebrating 40 Years of Nested Dissection -- Fourth 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 nd40@cs.uwaterloo.ca 
<mailto:nd40@cs.uwaterloo.ca>.

Abstract submission deadline: April 15, 2013 (extended deadline)
Notification of acceptance: May 15, 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

Back to comp.parallel | Previous | Next — Previous in thread | Find similar | Unroll thread

Thread

Workshop Celebrating 40 Years of Nested Dissection -- Third Announcement Esmond Ng <egng@lbl.gov> - 2013-02-22 10:14 -0800
  Workshop Celebrating 40 Years of Nested Dissection -- Third Announcement "Esmond G. Ng" <egng@lbl.gov> - 2013-03-22 20:19 -0700

csiph-web