10:30 AM-12:30 PM
Pelican
Although scientific computing deals primarily with problems of continuous mathematics, discrete mathematics and combinatorial algorithms play an important role in finding efficient solutions to many scientific computing problems. Seymour Parter introduced a graph model for Gaussian elimination in 1961, and since then graph models have been used to design efficient algorithms for sparse linear algebra. Topics from graph theory such as matchings, colorings, and partitioning have found wide use in scientific computing. Conversely tools from continuous mathematics such as eigenvalue solvers have found use in graph partitioning and graph sequencing problems. The speakers in this minisymposium will describe recent applications of combinatorial techniques to preconditioning, sparse orthogonal factorizations, and mesh generation.
Organizers: Alex Pothen