MS-Th-BC-24
Combinatorial Issues in Sparse Matrix Computation

Date: August 13
Time: 10:00--12:00
Room: 211

(Note: Click title to show the abstract.)

Organizer:
Ng, Esmond (Lawrence Berkeley National Laboratory)
Duff, Iain (STFC Rutherford Appleton Laboratory)

Abstract: Sparse matrix computation is rich in combinatorial problems. Reordering for sparsity preservation in matrix factorization is one such problem. Partitioning for parallel matrix factorization is another. In this minisymposium, we feature some recent work on the combinatorial aspect of sparse matrix computation. Some of the talks will focus on algorithmic development, while others will investigate more theoretical issues.


MS-Th-BC-24-1
10:00--10:30
Towards a recursive graph bipartitioning algorithm for well balanced domain decomposition
Casadei, Astrid (Inria)
Pierre, RAMET (Bordeaux Univ. & Inria)
Roman, Jean (Inria)


MS-Th-BC-24-2
10:30--11:00
Experiments with a nested dissection code
Ashcraft, Cleve (Livermore Software Tech. Corporation)
Duff, Iain (STFC Rutherford Appleton Laboratory)
Scott, Jennifer (STFC)
Thorne, Sue (STFC)


MS-Th-BC-24-3
11:00--11:30
Recent progress on the minimum local fill ordering heuristic
Ng, Esmond (Lawrence Berkeley National Laboratory)
Peyton, Barry (Dalton State College)


MS-Th-BC-24-4
11:30--12:00
Hypergraph models to reorder sparse matrices into special forms for efficient matrix computations
Aykanat, Cevdet (Bilkent Univ.)

Return


Footnote:
Code: Type-Date-Time-Room No.
Type : IL=Invited Lecture, SL=Special Lectures, MS=Minisymposia, IM=Industrial Minisymposia, CP=Contributed Papers, PP=Posters
Date: Mo=Monday, Tu=Tuesday, We=Wednesday, Th=Thursday, Fr=Friday
Time : A=8:30-9:30, B=10:00-11:00, C=11:10-12:10, BC=10:00-12:10, D=13:30-15:30, E=16:00-18:00, F=19:00-20:00, G=12:10-13:30, H=15:30-16:00
Room No.: TBA