Fast evaluation of trigonometric polynomials from hyperbolic crosses

DOI10.1007/S11075-006-9017-7MaRDI QIDQ2498993zbMATH OpenOpenAlexFDO

Authors Markus Fenn, Stefan Kunis, 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

algorithmdiscrete Fourier transformfast Fourier transformhyperbolic cross pointsnonequispaced spatial knotsnumerical examples

Mathematics Subject Classification ID

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

Recommendations

• Multivariate trigonometric polynomial approximations with frequencies from the hyperbolic cross
• Approximation of functions of several variables by trigonometric polynomials with harmonics from hyperbolic crosses
• Interpolation lattices for hyperbolic cross trigonometric polynomials
• Fast evaluation of polynomials by rational preparation
• scientific article; zbMATH DE number 4157891
• On rapid computation of expansions in ultraspherical polynomials
• Algorithms – ESA 2004
• Best multivariate approximations by trigonometric polynomials with frequencies from hyperbolic crosses
• Algorithms for trigonometric polynomials

Cites work

• A Class of Periodic Function Spaces and Interpolation on Sparse Grids
• A note on fast Fourier transforms for nonequispaced grids
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Fast Approximate Fourier Transforms for Irregularly Spaced Data
• Fast Fourier Transforms for Nonequispaced Data
• Fast summation based on fast trigonometric transforms at non‐equispaced nodes
• Fouriertransform on sparse grids with hierarchical bases
• scientific article; zbMATH DE number 66109 (Why is no real title available?)
• scientific article; zbMATH DE number 1284007 (Why is no real title available?)
• On the fast Fourier transform of functions with singularities
• Sparse grids

Cited in

(15)

• Fouriertransform on sparse grids with hierarchical bases
• INFFTM: fast evaluation of 3d Fourier series in MATLAB with an application to quantum vortex reconnections
• Superfast Fourier transform using QTT approximation
• A united approach to accelerating trigonometric expansions
• Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation
• Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
• A stable and accurate butterfly sparse Fourier transform
• Nonequispaced Hyperbolic Cross Fast Fourier Transform
• Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids
• Fast sparse nonlinear Fourier expansions of high dimensional functions
• Fast discrete Fourier transform on generalized sparse grids
• Computational methods for the Fourier analysis of sparse high-dimensional functions
• On the stability of the hyperbolic cross discrete Fourier transform
• Interpolation lattices for hyperbolic cross trigonometric polynomials
• Multivariate modified Fourier series and application to boundary value problems

Describes a project that uses

Uses Software

• NUFFT
• FFTW
• NFFT

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

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