[an error occurred while processing this directive] Program


Location: All presentations will be held in the William G. Davis Computer Research Centre (Davis Centre), Room 1304.

Lunch and coffee breaks: The lunch and coffee breaks will be held in the Davis Centre, Room 1301, right next to Room 1304.

Banquet: The banquet dinner will be held on Monday evening at the Wildcraft Restaurant (425 King Street North, Waterloo, tel 519-885-0117). It is located at one block south of the Waterloo Inn Hotel.

July 22, Monday
8:30am - 8:45am           Registration
8:45am - 9:00am Welcome and opening remarks
9:00am - 12:00pm Morning session (chair: Esmond Ng)
9:00am - 9:45am Shanghua Teng (Invited presentation)
Matrix, Geometry, and Network: Connecting Numerical Thinking and Combinatorial Thinking in Algorithm Design
9:45am - 10:15am Cleve Ashcraft and Roger Grimes
Level Set Methods to Find Separators
10:15am - 10:45am Coffee break
10:45am - 11:15am Andy Lucas, Robert Lucas, Sam Prager, Horst Simon, Federico Spedaliari, John Tran, and John Wu
Recursive Quantum Bisection
11:15am - 12:00pm Eric Darve (Invited presentation)
Building O(N) Linear Solvers Using Nested Dissection
12:00pm - 1:30pm Lunch
1:30pm - 4:45pm Afternoon session (chair: Mark Giesbrecht)
1:30pm - 2:00pm David S. Bindel and Jeffrey N. Chadwick
An Efficient Solver for Sparse Linear Systems Based on Rank-Structured Cholesky Factorization
2:00pm - 2:45pm Xiaoye Li (Invited presentation)
Towards an Optimal-Order Approximate Sparse Factorization Exploiting Data-Sparseness in Separators
2:45pm - 3:15pm Coffee break
3:15pm - 3:45pm Astrid Casadei, Luc Giraud, Pierre Ramet, and Jean Roman
Towards Domain Decomposition with Balanced Halo
3:45pm - 4:15pm Yu-Hong Yeung, Jessica Crouch, and Alex Pothen
An Augmented Matrix Approach for Updating Finite Element Meshes in Surgical Simulations
4:15pm - 4:45pm Jiri Kopal, Miroslav Rozloznik, and Miroslav Tuma
Safe Dropping in Incomplete Decompositions
July 23, Tuesday
9:00am - 12:00pm Morning session (chair: Arne Storjohann)
9:00am - 9:45am           Bruce Hendrickson (Invited presentation)
Graph Partitioning for Nested Dissection: An Historical Perspective
9:45am - 10:15am Erik G. Boman
Unsymmetric Nested Dissection
10:15am - 10:45am Coffee break
10:45am - 11:15am K. Gaertner
Approximation of Best Separators by Eigenfunctions of P-Laplacian
11:15am - 12:00pm Cevdat Aykanat (Invited presentation)
Combinatorial Relations and Transformations between "Graph Partitioning by Vertex Separator" and "Hypergraph Partitioning" Problems
12:00pm - 1:30pm Lunch
1:30pm - 4:45pm Afternoon session (chair: Justin Wan)
1:30pm - 2:00pm O. Kaya, E. Kayaaslan, B. Ucar, and I.S. Duff
On Hypergraph-Partitioning Based Fill Reducing Methods
2:00pm - 2:45pm Jean-Yves L'Excellent (Invited presentation)
Parallel Multifrontal Methods and Their Elimination Trees
2:45pm - 3:15pm Coffee break
3:15pm - 3:45pm Jean Roman and HiePACS team
From Hybrid Architectures to Hybrid Solvers
3:45pm - 4:15pm Ralf-Peter Mundani and Ernst Rank
Nested Dissection for Interactive CE Applications
4:15pm - 4:45pm Cleve Ashcraft and Roger Grimes
Graph Compression in a Distributed Memory Environment