Sparse approximation of functions using sums of exponentials and AAK theory

• 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.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datorseende och robotik (hsv//swe)

NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Vision and Robotics (hsv//eng)

NATURVETENSKAP  -- Matematik (hsv//swe)

NATURAL SCIENCES  -- Mathematics (hsv//eng)

Publikations- och innehållstyp

art (ämneskategori)

ref (ämneskategori)