The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Sparse approximation of functions using sums of exponentials and AAK theory

På svenska

Author

Summary, in English

We consider the problem of approximating functions by sums of few exponentials functions, either on an interval or on the positive half-axis. We study both continuous and discrete cases, i.e. when the function is replaced by a number of equidistant samples. Recently, an algorithm has been constructed by Beylkin and Monzón for the discrete case. We provide a theoretical framework for understanding how this algorithm relates to the continuous case.

Publishing year

2011

Language

English

Pages

213-248

Publication/Series

Journal of Approximation Theory

Volume

163

Issue

2

Document type

Journal article

Publisher

Elsevier

Topic

  • Computer Vision and Robotics (Autonomous Systems)
  • Mathematics

Status

Published

Research group

  • Harmonic Analysis and Applications

ISBN/ISSN/Other

  • ISSN: 0021-9045