Share Email Print

Proceedings Paper • Open Access

Approximations and fast algorithms
Author(s): Gregory Beylkin

Paper Abstract

The key element in the design of fast algorithms in numerical analysis and signal processing is the selection of an efficient approximation for the functions and operators involved. In this talk we will consider approximations using wavelet and multiwavelet bases as well as a new type of approximation for bandlimited functions using exponentials obtained via Generalized Gaussian quadratures. Analytically, the latter approximation corresponds to using the basis of the Prolate Spheroidal Wave functions. We will briefly comment on the future development of approximation techniques and the corresponding fast algorithms.

Paper Details

Date Published: 5 December 2001
PDF: 8 pages
Proc. SPIE 4478, Wavelets: Applications in Signal and Image Processing IX, (5 December 2001); doi: 10.1117/12.449697
Show Author Affiliations
Gregory Beylkin, Univ. of Colorado/Boulder (United States)

Published in SPIE Proceedings Vol. 4478:
Wavelets: Applications in Signal and Image Processing IX
Andrew F. Laine; Michael A. Unser; Akram Aldroubi, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?