Fast summation based on fast trigonometric transforms at non‐equispaced nodes
From MaRDI portal
Publication:3599961
DOI10.1002/nla.407zbMath1164.65380OpenAlexW2053084411MaRDI 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
algorithmfast Fourier transformmatrix-vector productfast discrete summationcosine and sine transforms at non-equispaced knots
Related Items (4)
Fast evaluation of trigonometric polynomials from hyperbolic crosses ⋮ An alternative to Slepian functions on the unit sphere -- a space-frequency analysis based on localized spherical polynomials ⋮ Fast cross-validation in harmonic approximation ⋮ Preconditioned Legendre spectral Galerkin methods for the non-separable elliptic equation
Uses Software
This page was built for publication: Fast summation based on fast trigonometric transforms at non‐equispaced nodes
