Fast polynomial multiplication and convolutions related to the discrete cosine transform

DOI10.1016/0024-3795(95)00696-6zbMATH Open0871.65118OpenAlexW2064425328MaRDI QIDQ676009FDOQ676009

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

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

zbMATH Keywords

Chebyshev polynomialsconvolutionsdiscrete cosine transformDCT-I algorithmfast polynomial multiplication

Mathematics Subject Classification ID

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

Cites Work

• A practical guide to splines
• Title not available (Why is that?)
• Title not available (Why is that?)
• On asymptotics and estimates for the uniform norms of the Lagrange interpolation polynomials corresponding to the Chebyshev nodal points
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Double Chebyshev Series Approximation
• Title not available (Why is that?)
• Approximationsfehler der Ableitungen von Interpolationspolynomen
• Title not available (Why is that?)
• Fast radix-\(p\) discrete cosine transform
• Title not available (Why is that?)
• Numerical mathematics

Cited In (20)

• A fast-convolution based space-time Chebyshev spectral method for peridynamic models
• A fast algorithm for nonequispaced Fourier transforms on the rotation group
• A numerical method for a nonlocal form of Richards' equation based on peridynamic theory
• Fast scattered data approximation with Neumann and other boundary conditions
• A rigorous implicit \(C^1\) Chebyshev integrator for delay equations
• Representations and evaluation strategies for feasibly approximable functions
• Fast algorithms for discrete polynomial transforms
• Simultaneous confidence bands for all contrasts of three or more simple linear regression models over an interval
• Fast spherical Fourier algorithms.
• Improved Stage 2 to P ± 1 Factoring Algorithms
• Derivation and analysis of fast bilinear algorithms for convolution
• Fast discrete transforms by means of eigenpolynomials
• Fast algorithms for discrete polynomial transforms on arbitrary grids
• Chebyshev model arithmetic for factorable functions
• Optimal trigonometric preconditioners for nonsymmetric Toeplitz systems
• Title not available (Why is that?)
• 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
• Onset of rotating and non-rotating convection in compressible and anelastic ideal gases

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)