SIAM CSC09 Program
| Time |
Speaker |
Title |
| Thursday |
| 1:30 pm |
IP: Dan Spielman (Yale University) |
Using Combinatorics to Solve Systems in M-matrices in Nearly-linear Time (joint with LA09) |
| 2:15 pm |
Break |
| 2:40 pm |
Opening Remarks |
| 2:45 pm |
David Fritzsche, Andreas Frommer and Daniel B. Szyld |
Algorithms for Fast Graph Partitioning and Applications to Preconditioning |
| 3:15 pm |
Michael M. Wolf, Erik G. Boman and Cédric Chevalier |
Improved Data Partitioning by Nested Dissection with Applications to Information Retrieval |
| 3:45 pm |
Assefaw Gebremedhin, Arijit Tarafdar, Duc Nguyen and Alex Pothen |
Ordering for Coloring and More |
| 4:15 pm |
Florin Dobrian, Mahantesh Halappanavar and Alex Pothen |
The Role of the Dulmage-Mendelsohn Decomposition in Bipartite Maximum Vertex-Weight Matching |
| Break |
|
|
| 5:00 pm |
Grey Ballard, James Demmel, Olga Holtz and Oded Schwartz |
Minimizing Communication in Linear Algebra |
| 5:30 pm |
Patrick Amestoy, François-Henry Rouet and Bora Uçar |
On Computing Arbitrary Entries of the Inverse of a Matrix |
| 6:00 pm |
Haim Avron, Petar Maymounkov and Sivan Toledo |
Engineering a Random-Sampling Numerical Linear Algebra Algorithm |
| 6:30 pm |
Jennifer Scott, John Reid and Jonathan Hogg |
A DAG-based Sparse Cholesky Solver for Multicore Architectures |
| Friday |
| 8:30 am |
IP: Kevin McCurley (Google) |
Value from Data: A Case Study using Similarity |
| 9:15 pm |
Break |
| 9:45 am |
Fredrik Manne and Md. Mostofa Ali Patwary |
A Scalable Parallel Union-Find Algorithm for Distributed Memory Computers |
| 10:15 am |
Stephane Gaubert, Laura Grigori and Meisam Sharify |
A Parallel Optimal Assignment Algorithm Based on Diagonal Scaling |
| 10:45 am |
Mahantesh Halappanavar, Florin Dobrian and Alex Pothen |
Matchings in Massive Graphs on Terascale Computers |
| 11:15 am |
Jun-Ho Her and Francois Pellegrini |
Towards Efficient and Scalable Parallel Static Mapping |
| Lunch |
|
|
| 1:15 pm |
David Day, Erik G. Boman, Heidi Thornquist and Eric Keiter |
A Parallel Preconditioning Strategy for Efficient Transistor-Level Circuit Simulation |
| 1:45 pm |
Satoru Iwata, Mizuyo Takamatsu and Caren Tischendorf |
Structural Characterization on Index of DAEs in Hybrid Analysis for General Circuits |
| 2:15 pm |
Bryan Klingner and Jonathan Shewchuk |
Aggressive Tetrahedral Mesh Improvement |
| 2:45 pm |
Mary Beth Hribar, Laurent Visconti and Andrew Chapman |
Numerical Libraries at Microsoft |
| Break |
|
|
| 3:45 pm |
Ilya Safro |
Algebraic Distance and Its Applications to Combinatorial Scientific Computing Problems |
| 4:15 pm |
Mark Iwen |
Combinatorial Methods for Computationally Efficient Non-Linear Approximation |
| 4:45 pm |
CSC Business meeting |
| 5:30 - 7:30 pm |
Poster Session |
| Saturday |
| 8:30 am |
IP: Andreas Griewank (Humboldt-Universität, Berlin) |
Combinatorics and Algorithmic (Automatic) Differentiation |
| 9:15 pm |
Break |
| 9:45 am |
Viktor Mosenkis, Uwe Naumann and Elmar Peise |
Low-Memory Tour Reversal in Directed Graphs |
| 10:15 am |
Martin Buecker, Michael Luelfesmann and Andreas Wolf |
Bidirectional Partitioning is No Better Than Unidirectional Partitioning for Computing Diagonal Jacobian Entries |
| 10:45 am |
Ebadollah Varnik and Uwe Naumann |
What Color is the Non-Constant Part of Your Jacobian? |
| 11:15 am |
Shahadat Hossain, Mahmudul Hasan and Trond Steihaug |
DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices |