Fast sparse nonlinear Fourier expansions of high dimensional functions

DOI10.1016/J.JMAA.2014.04.027zbMATH Open1307.65183OpenAlexW2062104923MaRDI QIDQ488526FDOQ488526

Authors: Xu Liu, Haiye Yu, Rui Wang 

Publication date: 26 January 2015

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2014.04.027

Recommendations

• Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
• Fast evaluation of trigonometric polynomials from hyperbolic crosses
• Computational methods for the Fourier analysis of sparse high-dimensional functions
• Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables
• Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids

zbMATH Keywords

numerical experimentfast discrete algorithmmultidimensional nonlinear Fourier basisoptimal convergence ordersparse nonlinear Fourier expansions

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Fourier series and coefficients in several variables (42B05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the convergence of multiple Fourier series
• Fouriertransform on sparse grids with hierarchical bases
• Optimized tensor-product approximation spaces
• Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Strang Splitting for the Time-Dependent Schrödinger Equation on Sparse Grids
• Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
• A construction of interpolating wavelets on invariant sets
• Information complexity of multivariate Fredholm integral equations in Sobolev classes
• Hyperbolic cross and the complexity of the approximate solution of Fredholm integral equations of the second kind with differentiable kernels

Cited In (3)

• Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
• Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables
• Sparse Evaluation of Compositions of Functions Using Multiscale Expansions

This page was built for publication: Fast sparse nonlinear Fourier expansions of high dimensional functions

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