Workshop Celebrating 40 Years of Nested Dissection

Path	csiph.com!usenet.pasdenom.info!weretis.net!feeder4.news.weretis.net!eternal-september.org!feeder.eternal-september.org!mx04.eternal-september.org!.POSTED!not-for-mail
From	"Esmond G. Ng" <egng@lbl.gov>
Newsgroups	comp.parallel, news.announce.conferences
Subject	Workshop Celebrating 40 Years of Nested Dissection
Date	Tue, 30 Oct 2012 21:41:31 +0000 (UTC)
Organization	A noiseless patient Spider
Lines	47
Approved	Jason Riedy <ejr@qNaN.sparse.dyndns.org>
Message-ID	<508D1450.40209@lbl.gov> (permalink)
Mime-Version	1.0
Content-Type	text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding	7bit
Injection-Date	Tue, 30 Oct 2012 21:41:31 +0000 (UTC)
Injection-Info	mx04.eternal-september.org; posting-host="78b38456c22e63cbf11d3d364b4081f4"; logging-data="18254"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/9r1MEmyjhzyyJfF9Tx6W6AAVc0LtN4I8="
User-Agent	Postbox 3.0.5 (Macintosh/20120826)
Cancel-Lock	sha1:xovUV7K6+lLWyLtG4VC/3ydvcK4=
Xref	csiph.com comp.parallel:367

Cross-posted to 2 groups.

Show key headers only | View raw

Workshop Celebrating 40 Years of Nested Dissection -- First Announcement

Location:  University of Waterloo, Waterloo, Canada
Date:  July 22-23, 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 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.  A workshop will be organized at the 
University of Waterloo on July 22-23, 2013 (with the possibility of 
extending to July 24, 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

Program Committee:
Timothy Davis, University of Florida
Iain Duff, Rutherford Appleton Laboratory and CERFACS
John Gilbert, University of California-Santa Barbara
Esmond G. Ng, Lawrence Berkeley National Laboratory
Francois Pellegrini, INRIA Bordeaux
Sivan Toledo, Tel-Aviv University
Justin Wan, University of Waterloo
_______________________________________________
SIAM-SC mailing list
To post messages to the list please send them to: SIAM-SC@siam.org
http://lists.siam.org/mailman/listinfo/siam-sc

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

Thread

Workshop Celebrating 40 Years of Nested Dissection "Esmond G. Ng" <egng@lbl.gov> - 2012-10-30 21:41 +0000

csiph-web