Fast algorithms for discrete Chebyshev-Vandermonde transforms and applications

DOI10.1007/BF02109186MaRDI QIDQ1315227zbMATH OpenFDO

Authors Manfred Tasche

Publication date 24 February 1994

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02109186

zbMATH Keywords

airfoil equationscollocationd'Alembert functional equationdiscrete Chebyshev-Vandermonde transformdiscrete cosine transformdivide-and-conquer techniquefast algorithmspolynomial approximation

Mathematics Subject Classification ID

PDEs in connection with fluid mechanics (35Q35) Numerical methods for discrete and fast Fourier transforms (65T50) Applications to the sciences (65Z05) Jets and cavities, cavitation, free-streamline theory, water-entry problems, airfoil and hydrofoil theory, sloshing (76B10)

Review text

The discrete cosine transform (DCT) is introduced as an application of the discrete Chebyshev-Vandermonde transform (DCVT). With the divide-and- conquer technique and the d'Alembert functional equation, fast DCT algorithms are described. By the help of DCVT and DCT, numerically stable fast algorithms for simultaneous polynomial approximation and for a collocation method for the airfoil equations are derived.

Recommendations

• Fast algorithms for discrete polynomial transforms
• Fast algorithms for discrete polynomial transforms on arbitrary grids
• Fast radix-\(p\) discrete cosine transform

Cites work

• A fast algorithm for solving the generalized airfoil equation
• Fast radix-\(p\) discrete cosine transform
• scientific article; zbMATH DE number 53687 (Why is no real title available?)
• On the L₂ convergence of collocation for the generalized airfoil equation
• ON THE CONVERGENCE OF THE DERIVATIVES OF PROJECTION OPERATORS
• On the Order of Convergence of Simultaneous Approximation by Lagrange-Hermite Interpolation
• On the simultaneous approximation of derivatives by Lagrange and Hermite interpolation

Cited in

(12)

• Representations of Toeplitz-plus-Hankel martrices using trigonometric transformations with application to fast matrix-vector multiplication
• Uniform convergence of a fast algorithm for Cauchy singular integral equations
• Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
• Fast discrete transforms by means of eigenpolynomials
• Fast algorithms for discrete polynomial transforms on arbitrary grids
• On the construction of wavelets on a bounded interval
• scientific article; zbMATH DE number 733445 (Why is no real title available?)
• Wavelets based on orthogonal polynomials
• scientific article; zbMATH DE number 4189089 (Why is no real title available?)
• Chebyshev-Hankel matrices and the splitting approach for centrosymmetric Toeplitz-plus-Hankel matrices
• A fast algorithm for Prandtl's integro-differential equation
• Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations

This page was built for publication: Fast algorithms for discrete Chebyshev-Vandermonde transforms and applications

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