Open Access Paper
5 December 2001 Approximations and fast algorithms
Gregory Beylkin
Author Affiliations +
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.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Gregory Beylkin "Approximations and fast algorithms", Proc. SPIE 4478, Wavelets: Applications in Signal and Image Processing IX, (5 December 2001); https://doi.org/10.1117/12.449697
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Wavelets

Signal processing

Numerical analysis

Algorithm development

Printed circuit board testing

Condition numbers

Image processing

Back to Top