Combinatorial Scientific Computing
Combinatorial scientific computing (CSC) has served as the foundation of several scientific simulations for the past three decades. Several of the problems in the field of deal with an interesting mix of combinatorial, numerical, and computer architecture issues.
The problems that I have been interested in the field of CSC include sparse linear solvers, sparse singular value decomposition, graph algorithms including algorithms and software for graph partitioning, and graph coloring. More recently, the CSC work I do has a heavy leaning towards performance portablity such as performance portable sparse linear solvers or performance portable graph or linear algebra algorithms.
Use the tags below to see all the work in this area.
- A study of combinatorial issues in a sparse hybrid solver
- Parallel, Portable Algorithms for Distance-2 Maximal Independent Set and Graph Coarsening
- FROSch Preconditioners for Land Ice Simulations of Greenland and Antarctica
- Parallel graph coloring algorithms for distributed GPU environments