Fast evaluation of trigonometric polynomials from hyperbolic crosses

DOI10.1007/s11075-006-9017-7zbMath1096.65135OpenAlexW2065154507MaRDI QIDQ2498993

Stefan Kunis, Markus Fenn, Daniel Potts

Publication date: 14 August 2006

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-006-9017-7

zbMATH Keywords

algorithmnumerical examplesfast Fourier transformdiscrete Fourier transformhyperbolic cross pointsnonequispaced spatial knots

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Numerical methods for trigonometric approximation and interpolation (65T40) Trigonometric polynomials, inequalities, extremal problems (42A05)

Related Items (3)

Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation ⋮ Superfast Fourier transform using QTT approximation ⋮ Multivariate modified Fourier series and application to boundary value problems

Uses Software

• FFTW
• NFFT
• NUFFT

Cites Work

• Fouriertransform on sparse grids with hierarchical bases
• A note on fast Fourier transforms for nonequispaced grids
• On the fast Fourier transform of functions with singularities
• Fast summation based on fast trigonometric transforms at non‐equispaced nodes
• Fast Approximate Fourier Transforms for Irregularly Spaced Data
• Fast Fourier Transforms for Nonequispaced Data
• A Class of Periodic Function Spaces and Interpolation on Sparse Grids
• Sparse grids
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast evaluation of trigonometric polynomials from hyperbolic crosses