University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Concerning the stability of exponential systems and Fourier matrices

Concerning the stability of exponential systems and Fourier matrices

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

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

DREW01 - Multivariate approximation, discretization, and sampling recovery

Fourier matrices naturally appear in many applications and their stability is closely tied to performance guarantees of algorithms. The starting point of our investigation is a result that characterizes properties of an exponential system on a union of cubes in  R^d  in terms of a general class of Fourier matrices and their extreme singular values. This relationship is flexible in the sense that it holds for any dimension d, for many types of exponential systems (Riesz bases, Riesz sequences, or frames)  and for Fourier matrices with an arbitrary number of rows and columns. From there, we prove new stability results for Fourier matrices by exploiting this connection and using powerful stability theorems for exponential systems. This paper provides a systematic exploration of this connection and suggests some natural open questions. This is a joint work with W. Li (CUNY) and O. Asipchuk (FIU)

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity