Fast polynomial multiplication and convolutions related to the discrete cosine transform

DOI10.1016/0024-3795(95)00696-6MaRDI QIDQ676009zbMATH OpenOpenAlexFDO

Authors Günter Baszenski, Manfred Tasche

Publication date 1 October 1997

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(95)00696-6

zbMATH Keywords

Chebyshev polynomialsconvolutionsdiscrete cosine transformDCT-I algorithmfast polynomial multiplication

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
• On algebras related to the discrete cosine transform
• Fast algorithms for discrete polynomial transforms

Cites work

• scientific article; zbMATH DE number 3837245 (Why is no real title available?)
• scientific article; zbMATH DE number 3650737 (Why is no real title available?)
• scientific article; zbMATH DE number 3967873 (Why is no real title available?)
• scientific article; zbMATH DE number 3766397 (Why is no real title available?)
• scientific article; zbMATH DE number 53687 (Why is no real title available?)
• scientific article; zbMATH DE number 193036 (Why is no real title available?)
• scientific article; zbMATH DE number 3110365 (Why is no real title available?)
• A practical guide to splines
• Approximationsfehler der Ableitungen von Interpolationspolynomen
• Fast radix-\(p\) discrete cosine transform
• Numerical mathematics
• On Double Chebyshev Series Approximation
• On asymptotics and estimates for the uniform norms of the Lagrange interpolation polynomials corresponding to the Chebyshev nodal points

Cited in

(20)

• Onset of rotating and non-rotating convection in compressible and anelastic ideal gases
• A fast-convolution based space-time Chebyshev spectral method for peridynamic models
• A fast algorithm for nonequispaced Fourier transforms on the rotation group
• Fast scattered data approximation with Neumann and other boundary conditions
• A numerical method for a nonlocal form of Richards' equation based on peridynamic theory
• A rigorous implicit \(C^1\) Chebyshev integrator for delay equations
• Representations and evaluation strategies for feasibly approximable functions
• Fast spherical Fourier algorithms.
• Simultaneous confidence bands for all contrasts of three or more simple linear regression models over an interval
• Fast algorithms for discrete polynomial transforms
• Improved Stage 2 to P ± 1 Factoring Algorithms
• Fast discrete transforms by means of eigenpolynomials
• Derivation and analysis of fast bilinear algorithms for convolution
• Fast algorithms for discrete polynomial transforms on arbitrary grids
• Chebyshev model arithmetic for factorable functions
• Optimal trigonometric preconditioners for nonsymmetric Toeplitz systems
• scientific article; zbMATH DE number 4189089 (Why is no real title available?)
• Fast and stable algorithms for discrete spherical Fourier transforms
• A nonperiodic Chebyshev spectral method avoiding penalization techniques for a class of nonlinear peridynamic models
• Algebraic signal processing theory: Cooley-Tukey-type algorithms for polynomial transforms based on induction

This page was built for publication: Fast polynomial multiplication and convolutions related to the discrete cosine transform

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