Computational complexity of generalized KN-convolutions and the fast Vandermonde transform algorithm

DOI10.1016/0041-5553(90)90104-ZMaRDI QIDQ3970836zbMATH OpenOpenAlexFDO

Authors Alexander M. Krot

Publication date 25 June 1992

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(90)90104-z

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)

Cited in

(1)

• scientific article; zbMATH DE number 4189089 (Why is no real title available?)

This page was built for publication: Computational complexity of generalized KN-convolutions and the fast Vandermonde transform algorithm

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