Computational complexity of generalized KN-convolutions and the fast Vandermonde transform algorithm
From MaRDI portal
Publication:3970836
DOI10.1016/0041-5553(90)90104-ZzbMath0739.65042OpenAlexW1994700837MaRDI QIDQ3970836
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
Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)
This page was built for publication: Computational complexity of generalized KN-convolutions and the fast Vandermonde transform algorithm
