scientific article; zbMATH DE number 4189089

MaRDI QIDQ5753440zbMATH OpenFDO

Authors Alexander M. Krot

Publication date 1990

zbMATH Keywords

computational complexitydiscrete convolutionFrobenius matrixVandermonde transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Computational complexity of generalized KN-convolutions and the fast Vandermonde transform algorithm
• On the computational complexity of the general discrete Fourier transform
• scientific article; zbMATH DE number 4037044
• Generalization of the algebraic discrete Fourier transform with application to fast convolutions
• On vector generalizations of Vandermonde's convolution
• Fast algorithms for discrete Chebyshev-Vandermonde transforms and applications
• Fast algorithms of multidimensional discrete nonseparable /spl Kscr/-wave transforms
• Fast polynomial multiplication and convolutions related to the discrete cosine transform
• Time-space efficient algorithms for computing convolutions and related problems
• Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses

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 Q5753440)