Low-rank approximation of analytic kernels

Add to your list(s) Download to your calendar using vCal

• Marcus Webb (University of Manchester)
• Thursday 12 March 2026, 15:00-16:00
• Centre for Mathematical Sciences, MR14.

If you have a question about this talk, please contact Georg Maierhofer.

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.

This talk is part of the Applied and Computational Analysis series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• Applied and Computational Analysis
• CMS Events
• Centre for Mathematical Sciences, MR14
• DAMTP info aggregator
• Featured lists
• Interested Talks
• My seminars
• Type the title of a new list here
• bld31

Note that ex-directory lists are not shown.