Mathematical Algorithms & Computing Group
The Computational Mathematics Group conducts research and development of algorithms and software for solving linear and nonlinear systems, which are often obtained from approximations of partial differential equations and arise in numerous areas of science and engineering, including fluid dynamics, solid mechanics, combustion, elasticity, electromagnetics, large scale data mining, and cybersecurity. Our customers are primarily scientists and engineers working in these fields. The algorithms we investigate include scalable algorithms, such as multigrid and multilevel methods, adaptive mesh refinement, overlapping grid techniques, projection methods, higher-order upwind schemes, embedded boundary methods, interface tracking methods, and turbulence models. We also seek scalable spectral methods for extremely large graph matrices and rank-revealing decompositions of matrices in data mining applications. Our research includes the development of object-oriented code frameworks for the implementation of these algorithms on a wide range of serial and parallel architectures.
In summary, our goals are to develop both innovative grid based techniques for the computational modeling of physical problems and code infrastructures that facilitate the software implementation of such algorithms.
Ulrike Meier Yang: Iterative linear solvers, algebraic multigrid, parallel computing, scientific software, performance analysis
Alyson Fox: numerical linear algebra, graph Laplacian linear systems algebraic multigrid solvers, error analysis of ZFP compression
Rob Falgout: multilevel methods, parallel computing
Van Emden Henson: multigrid and algebraic multigrid, eigenvalues and eigenvectors, large-scale graphs, multilinear (tensor) algebra, Krylov methods
Christine Klymko: network analysis, numerical linear algebra, graph algorithms, data mining, scientific computing, numerical analysis, matrix analysis
Tim La Fond: network analysis, dynamic graph algorithms, data mining, anomaly detection
Ruipeng Li: sparse matrix computations, parallel computing, iterative methods for solving linear systems, preconditioning techniques, eigenvalue problems
Sarah Osborn: numerical linear algebra, numerical methods for partial differential equations, uncertainty quantification
Colin Ponce: numerical linear algebra, algebraic multigrid, numerical methods for powergrid analysis
Geoffrey Sanders: algebraic multigrid, eigenspectra, multilinear (tensor) algebra, large-scale graphs
Panayot Vassilevski: numerical linear algebra, finite elements