Homepage for the University of Oxford finite element methods reading group!
Meetings this academic year will be hosted on Fridays from 15:00–16:00 GMT in S2.37. You can join on Teams by clicking here, or using the details:
2025–2026
Michaelmas term
| Week | Date | Topic | Presenter |
|---|---|---|---|
| 1 | 17.OCT | Long steps in gradient descent methods (Grimmer, 2024; Zhigljavsky, Pronzato & Bukina, 2013) | Me (Boris Andrews) |
| 2 | 24.OCT | Sparse direct solvers (Duff, Erisman & Reid, 2017) | Kars Knook |
| 3 | 31.OCT | Group meeting | Everyone |
| 4 | 07.NOV | Preconditioners for PDE timesteppers (Southworth et al., 2022) | Charlie Parker |
| 5 | 14.NOV | TBA… | Jakub Cach |
| 6 | 21.NOV | TBA… | Mingdong He |
| 7 | 28.NOV | TBA… | TBA… |
| 8 | 05.DEC | TBA… | TBA… |
Click here to hide references for upcoming presentations.
2025–2026
Michaelmas term
I. S. Duff, A. M. Erisman and J. K. Reid, Direct Methods for Sparse Matrices. Oxford University Press, 2017
B. Grimmer, Provably faster gradient descent via long steps, SIAM Journal on Optimization, 34 (2024), doi:10.1137/23M1588408
B. S. Southworth, O. Krzysik, W. Pazner and H. De Sterck, Fast solution of fully implicit Runge–Kutta and discontinuous Galerkin in time for numerical PDEs, part I: The linear setting, SIAM Journal on Scientific Computing, 44 (2022), doi:10.1137/21M1389742
A. Zhigljavsky, L. Pronzato and E. Bukina, An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost, Optimization Letters, 7 (2013), doi:10.1007/s11590-012-0491-7
Click here to view the records of past presentations.
Click here to view the list of suggested papers.