The Computational Mathematics research program actively studies theoretical aspects of computational algorithms, both in the continuous and discrete settings, as well addressing implementation issues to ensure efficient and reliable solution techniques.
The program runs a regular seminar (usually 4pm on a Monday afternoon). If you would like to be notified of these seminars and associated notifications consider joining our mailing list.
The specific areas addressed by the program include:
- high-dimensional approximation and sparse grid methods
- efficient solution of large scale problems
- numerical linear algebra
- numerical solution of partial differential equations
- parallel numerical methods
- inverse problems
- optimisation techniques
- parameter estimation
- uncertainty quantification
- regularisation methods
- thin plate spline smoothing
- tsunami and flood modelling
| Project | Status |
|---|---|
| Adaptive sparse grids | Potential |
| Advanced computational techniques | Potential |
| Clustering techniques | Potential |
| Domain decomposition/Multiscale physics | Potential |
| Fault tolerant algorithms | Potential |
| High dimensional approximation | Potential |
| Navier Stokes equation with free boundaries | Potential |
| Numerical simulations of plasma flow | Potential |
| ODE estimation | Potential |
| Parallel high-dimensional density estimation | Potential |
| Polyhedral optimization | Potential |
| Scalable Fault-tolerant PDE Solvers | Current |
| Sensitivity Analysis of environmental models | Potential |
| Smoothing & rendering | Potential |
| Thin plate splines | Current |
| Topics in Algebraic Complexity Theory | Potential |
| Tsunami and flood modelling | Current |
| Using methods from algebraic geometry to develop numerical approximations | Potential |
