CSC05 Program Schedule

All abstracts download -
All slides download -


Programme of Tuesday, June 21st

9.00 – 9.30 Registration
9.30 – 9.45 Welcome
Invited talk
9.45 – 10.45 S. C. Eisenstat (Yale University, U.S.A.) The elimination tree of a nonsymmetric matrix: theory and applications
11.45 – 11.15 Coffee break
Session on Sparse Matrix Orderings
11.15 – 11.45 S. Li Unsymmetric greedy orderings for stable sparse factorization
11.45 – 12.15 J. Scott Reducing the total bandwidth of a sparse unsymmetric matrix
12.15 – 12.45 S. Pralet Scalable pivoting strategies and ordering for sparse symmetric indefinite problems
12.45 – 14.30 Lunch
Industrial track
14.30 – 15.15 V. D. Cung (INPG, France) Combinatorial Optimization in Industrial Applications: from Serial Code Optimization to Grid Computing
Session on Combinatorial Matrix Theory
15.15 – 15.45 I. Safro Multilevel Algorithms for Linear Ordering Problems
15.45 – 16.15 Coffee break
16.15 – 16.45 S. H. Teng Lower-Stretch Spanning Trees
16.45 – 17.15 S. Toledo Algebraic Connectivity of Finite-Element Hypergraphs
17.15 – 19.00 Poster session
E. Agullo An out-of-core extension of a parallel sparse multifrontal solver
R. Bisseling Partitioning a call graph
V. Boyer A new heuristic for the multidimensional knapsack problem
D. Fritzsche Extensions of certain graph-based algorithms for preconditioning
C. Hamerling and C. Puglisi Test for Large Systems of Equations: a Grid project
T. Iwashita New evaluation index of orderings in incomplete factorization preconditioning
F. Jézéquel Dynamical control of approximation methods
D. Kincaid Notes on GMRES algorithm organization
Ph. Langlois and N. Louvet Fast and Extra Precise Substitution
A. Pinar Vulnerability analysis of electric power networks
A. Pothen New algorithms for acyclic and star coloring
S. Toledo Locality of reference in sparse Cholesky factorization methods
J. Utke On face elimination in computational graphs


Programme of Wednesday, June 22nd

Invited talk
9.00 – 10.00 D. Halperin (Tel Aviv University, Israel) Controlled perturbation for certified geometric computing with fixed precision arithmetic
Session on Numerical Algorithms
10.00 – 10.30 D. Ruiz A scaling algorithm to equilibrate both row and column norms in matrices
10.30 – 11.00 M. Tuma Preconditioning of iterative methods for solving sequences of linear systems
11.00 – 11.30 Coffee break
Session on Automatic Differentiation and sparse Jacobian estimation
11.30 – 12.00 M. Goyal Optimal bi-directional determination of sparse Jacobian matrices abstract
12.00 – 12.30 J. Utke Minimizing operation counts and maximizing data locality for efficient derivative codes in automatic differentiation
12.30 – 13.00 S. Bhowmick A Backtracking Correction heuristic for improving performance of graph coloring algorithms
13.00 – 14.30 Lunch
Industrial track
14.30 – 15.15 G. Alléon (EADS-CCR, France) A high performance 3D simulation framework for acoustics: from mesh generation to visualization
Session on Emerging Applications
15.15 – 15.45 A. Pinar Reorganizing bitmap tables for improved compression
15.45 – 16.15 Coffee break
16.15 – 16.45 R. Preis Integrating multilevel graph partitioning with hierarchical set oriented methods for the analysis of dynamical systems
16.45 – 17.15 S. Oliveira Matrix-based algorithms for document clustering
Session on Parallel Optimization
17.15 – 17.45 C. Phillips Randomized rounding for sensor placement problems
Cocktail at the Town-Hall


Programme of Thursday, June 23rd

Invited talk
9.15 – 10.15 D. Trystram (IMAG, France) Efficient algorithms for scheduling the tasks of parallel programs
Session on Linear and Integer Programming
10.15 – 10.45 J. Hall SYNPLEX, a task-parallel scheme for the revised simplex method
10.45 – 11.15 Coffee break
Session on Sparse Direct Methods
11.15 – 11.45 L. Grigori Parallel symbolic sparse LU factorization with static pivoting
11.45 – 12.15 A. Guermouche Flexible task allocation for the memory minimization of the multifrontal approach
Industrial track
12.15 – 13.00 D. Goudin / M. Mandallena (CEA-CESTA, France) CEA s Parallel industrial codes in electromagnetics
13.00 – 14.30 Lunch
Session on Graph Algorithms
14.30 – 15.00 C. Aykanat Hypergraph-partitioning-based sparse matrix ordering
15.00 – 15.30 E. Boman Parallel hypergraph partitioning for scientific computing
15.30 – 16.00 M. Halappanavar Vertex-weighted matching algorithms for computing column-space basis
16.00 – 16.15 Closure

Donate · Contact Us · Site Map · Join SIAM · My Account
Facebook Twitter Youtube linkedin google+