scientific article; zbMATH DE number 733445

MaRDI QIDQ4325835zbMATH OpenFDO

Authors Günter Baszenski, Manfred Tasche

Publication date 13 March 1995

zbMATH Keywords

Chebyshev interpolationcosine interpolationdiscrete cosine transformserror estimatesfast DCT-algorithmshierarchical basesreconstruction algorithmsstabilitywavelets

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Numerical interpolation (65D05) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• scientific article; zbMATH DE number 878857
• Interpolating polynomial wavelets on \([-1,1]\)
• scientific article; zbMATH DE number 1329156
• Fast algorithms for the discrete cosine transform
• Fast algorithms for discrete Chebyshev-Vandermonde transforms and applications

Cited in

(7)

• On the construction of wavelets on a bounded interval
• A new method for Chebyshev polynomial interpolation based on cosine transforms
• Chebyshev nonuniform sampling cascaded with the discrete cosine transform for optimum interpolation
• Interpolating wavelets and difference wavelets
• Hardware Efficient Fast DCT Based on Novel Cyclic Convolution Structures
• Integer DCTs and fast algorithms
• Worst-case error analysis of lifting-based fast DCT-algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4325835)