CSC 2007: The SIAM Workshop on Combinatorial Scientific Computing

Combinatorial algorithms play a crucial enabling role in computational science and engineering (CSE), and as problems and data sets increase in size and complexity, this role continues to grow. To  provide a forum for researchers interested  in the  interaction of combinatorial mathematics and algorithms with CSE, the SIAM  Workshop on Combinatorial Scientific Computing (CSC07) will be organized in Costa Mesa,  CA, on Feb 17-19, 2007.The CSC07 workshop will  precede the 2007 SIAM Conference on Computational Science and Engineering, and  is  organized in co-operation with  the SIAM Activity Groups on  Computational Science and Engineering, and Supercomputing.

CSC07  follows two earlier  CSC workshops held in 2004 and 2005. The First SIAM Workshop on Combinatorial Scientific Computing (CSC04) was held at San Francisco in February  2004, and the Second International Workshop on CSC (CSC05) was held at Toulouse, France in June 2005. Each of these workshops was  attended by close to a hundred participants, and featured  about twenty-five  plenary and selected talks on the themes of parallel computing, high-performance algorithms, sparse matrix computations, combinatorial problems in optimization,  automatic differentiation, mesh generation, computational biology, and combinatorial matrix theory. The CSC07 Workshop aims to bring together researchers interested in these themes as well as other aspects of combinatorial mathematics and algorithms in scientific computing, broadly interpreted.

Program

The list that follows include invited talks and contributed talks that were accepted for presentation. The list of poster presentation will be uploaded later (the poster deadline is January 22nd; submit abstracts, at most 100 words long, to stoledo@tau.ac.il).

All the talks will be at the Laguna Beach I/II/II-B1 room of the Hilton Orange County/Costa Mesa.

SATURDAY


February 17, 2007



8:00-8:45
Registration

8:45-9:00
Welcome

9:00-10:00
Recent developments in multifrontal codes (Invited Talk)
Iain Duff (Rutherford Appleton Lab and CERFACS)
10:00-10:30
Inertia revealing preconditioner for optimization
Olaf Schenk (University of Basel)
10:30-11:00
Coffee Break

11:00-11:30
The PT-Scotch project
Cedric Chevalier (LaBRI and INRIA Futurs)
11:30-12:00
Fine-grain parallel sparse matrix distribution
Erik Boman (Sandia National Lab)
12:00-1:30
Lunch

1:30-2:15
TOPS: Towards optimal petascale simulations (SciDAC Talk)
Esmond Ng (Lawrence Berkeley Lab)
2:15-2:45
Remapping models via hypergraph partitioning
Cevdet Aykanat (Bilkent University)
2:45-3:15
Hypergraphs for run-time reordering
Michelle Strout (Colorado State)
3:15-3:45
Minimal fill elimination ordering
Barry Peyton (Dalton State College)
3:45-4:00
Coffee Break

4:00-5:30
Poster Session

7:00 P.M.
CSC07 Dinner

SUNDAY


February 18, 2007



9:00-10:00
Combinatorial algorithms and statistical physics (Invited Talk)
Phil Duxbury (Michigan State)
10:00-10:30
Sparse Hessians using AD
Assefaw Gebremedhin (Old Dominion)
10:30-11:00
Coffee Break

11:00-11:30
Jacobian accumulation is NP-complete
Uwe Naumann (RWTH Aachen University)
11:30-12:00
Local Jacobian pre-accumulation
Jean Utke (Argonne)
12:00-1:30
Lunch

1:30-2:15
ITAPS: Interoperable technologies for advanced petascale simulations (SciDAC Talk)
Lori Diachin (Livermore National Lab)
2:15-2:45
Pattern graphs for sparse matrices
Shahdat Hossain (University of Lethbridge)
2:45-3:15
Exploiting symmetry for Hessian computation
Sanjukta Bhowmick (Columbia and Argonne)
3:15-4:00
Algorithmic challenges in solving density functional theories for fluids at interfaces (SciDAC Talk)
Laura Frink (Sandia National Lab)
4:00-4:30
Coffee Break

4:30-5:30
Business Meeting

6:00-8:00
CSE Welcome Reception

MONDAY


February 19, 2007



8:30-9:15
CSE Invited Talk
9:15-9:45
Coffee Break

9:45-10:15
Support graph preconditioners for 2-D trusses
Samuel Daitch (Yale)
10:15-10:45
Linear work parallel algorithm for planar Laplacians
Ioannis Koutis (Carnegie Mellon)
10:45-11:15
Combinatorial structure in finite element operators
Robert Kirby (Texas Tech)
11:15-11:45
Multilevel approaches for proteomic networks
S-C Seok (Iowa)
11:45-12:00
CSC07 Closing


Posters

Title Authors
Combinatorial Optimization of Matrix-Vector Multiplication Wolf
Using Perturbed QR Factorizations to Solve Linear Least-Squares Problems Avron, Ng, Toledo
Combinatorial Preconditioners for Scalar Finite Elements Avron, Shklarski, Toledo
Evolution of a Coarse Grid Selection Algorithm Alber & Olson
Hierarchical Coloring Hovland
Exploiting Algebraic Dependences Between Local Partial
Derivatives in Jacobian Accumulation
Lyons
A Discrete Optimization Problem Arising in Finite Element Computation Knepley, Leyffer, & Kirby
Combinatorial Preconditioners for Scalar Finite-Elements Problems Avron, Shklarski, Toledo
Large-scale Polytope Diameter Experiments using the CBE Processor: Towards a Resolution to Hirsch's Conjecture Kulkarni
CSCAPES project Pothen
Derivative Accumulation on Compressed Row Storage of Extended Jacobians  Varnik & Naumann
An Algorithm to Find Overlapping Subgraphs of a Graph and Applications to Preconditioning Fritzsche, Frommer, Szyld
Parallel Iterative Solvers for Ill-Conditioned Problems with Reordering Nakajima
Fast Approximation Algorithms for Bipartite Vertex-Weighted Matching Dobrian, Halappanavar, Pothen
Analysis of Seismic Event Confusion via Trees Bording & Padina
Multi-Level Approach to Numerical Solution of Inverse Problems Kourosh & Golub
Using Multiple Generalized Cross-Validation as a Method for Varying Smoothing Effects Kourosh & Golub
Searching by transpositions Popescu

See you all in Costa Mesa!