Fast summation based on fast trigonometric transforms at non‐equispaced nodes
From MaRDI portal
Publication:3599961
DOI10.1002/nla.407zbMath1164.65380MaRDI QIDQ3599961
Publication date: 9 February 2009
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.407
algorithm; fast Fourier transform; matrix-vector product; fast discrete summation; cosine and sine transforms at non-equispaced knots
65T50: Numerical methods for discrete and fast Fourier transforms
Related Items
Uses Software