Applied and computational Analysis Seminars
Low-rank approximation of analytic kernels
With Marcus Webb (University of Manchester)
Low-rank approximation of analytic kernels
Many algorithms in scientific computing and data science take advantage of low-rank approximation of matrices and kernels, and understanding why nearly-low-rank structure occurs is essential for their analysis and further development. In this talk I will discuss a new framework for bounding the best low-rank approximation error of matrices arising from samples of a kernel that is analytically continuable in one of its variables to an open region of the complex plane. Elegantly, the low-rank approximations used in the proof are computable by rational interpolation using the roots and poles of Zolotarev rational functions, leading to a fast algorithm for their construction. A preprint can be found at https://arxiv.org/abs/2509.14017.
- Speaker: Marcus Webb (University of Manchester)
- Thursday 12 March 2026, 15:00–16:00
- Venue: Centre for Mathematical Sciences, MR14.
- Series: Applied and Computational Analysis; organiser: Georg Maierhofer.