Approximation of high-dimensional periodic functions with Fourier-based methods
From MaRDI portal
Approximate quadratures (41A55) Multidimensional problems (41A63) Fourier series and coefficients in several variables (42B05) Analysis of variance and covariance (ANOVA) (62J10) Algorithms for approximation of functions (65D15) Numerical methods for trigonometric approximation and interpolation (65T40) Numerical methods for discrete and fast Fourier transforms (65T50)
Abstract: In this paper we propose an approximation method for high-dimensional -periodic functions based on the multivariate ANOVA decomposition. We provide an analysis on the classical ANOVA decomposition on the torus and prove some important properties such as the inheritance of smoothness for Sobolev type spaces and the weighted Wiener algebra. We exploit special kinds of sparsity in the ANOVA decomposition with the aim to approximate a function in a scattered data or black-box approximation scenario. This method allows us to simultaneously achieve an importance ranking on dimensions and dimension interactions which is referred to as attribute ranking in some applications. In scattered data approximation we rely on a special algorithm based on the non-equispaced fast Fourier transform (or NFFT) for fast multiplication with arising Fourier matrices. For black-box approximation we choose the well-known rank-1 lattices as sampling schemes and show properties of the appearing special lattices.
Recommendations
- Grouped transformations and regularization in high-dimensional explainable ANOVA approximation
- Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- Transformed rank-1 lattices for high-dimensional approximation
- Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices
Cites work
- Application of quasi-Monte Carlo methods to elliptic PDEs with random diffusion coefficients: a survey of analysis and implementation
- Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form
- Circulant embedding with QMC: analysis for elliptic PDE with lognormal coefficients
- Counting via entropy: new preasymptotics for the approximation numbers of Sobolev embeddings
- Dimension-wise integration of high-dimensional functions with applications to finance
- Effective dimension of some weighted pre-Sobolev spaces with dominating mixed partial derivatives
- Efficient implementations of the multivariate decomposition method for approximating infinite-variate integrals
- Embeddings of weighted Hilbert spaces and applications to multivariate and infinite-dimensional integration
- Estimating Mean Dimensionality of Analysis of Variance Decompositions
- Fast discrete Fourier transform on generalized sparse grids
- General foundations of high-dimensional model representations
- Global sensitivity indices for nonlinear mathematical models and their Monte Carlo estimates
- Good lattice rules in weighted Korobov spaces with general weights
- High-dimensional integration: The quasi-Monte Carlo way
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 2046351 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 2232688 (Why is no real title available?)
- Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016
- Infinite-dimensional integration and the multivariate decomposition method
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Nonequispaced Hyperbolic Cross Fast Fourier Transform
- Numerical Fourier analysis
- On decompositions of multivariate functions
- On sensitivity estimation for nonlinear mathematical models
- Optimal randomized multilevel algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition
- Quasi-Monte Carlo finite element methods for a class of elliptic partial differential equations with random coefficients
- Quasi-Monte Carlo finite element methods for elliptic PDEs with lognormal random coefficients
- Random Sampling of Multivariate Trigonometric Polynomials
- Reconstructing hyperbolic cross trigonometric polynomials by sampling along rank-1 lattices
- Reconstructing multivariate trigonometric polynomials from samples along rank-1 lattices
- Sparse grid quadrature in high dimensions with applications in finance and insurance
- Sparse grids
- Sparse grids and related approximation schemes for higher dimensional problems
- The ANOVA decomposition of a non-smooth function of infinitely many variables can have every term smooth
- The rate of convergence of sparse grid quadrature on the torus
- The smoothing effect of the ANOVA decomposition
- Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness
- Tractability of multivariate integration for weighted Korobov classes
- Using NFFT 3 -- a software library for various nonequispaced fast Fourier transforms
Cited in
(35)- Fourier embedded domain methods: Extending a function defined on an irregular region to a rectangle so that the extension is spatially periodic and \(C^{\infty}\)
- Sparse mixture models inspired by ANOVA decompositions
- Learning in high-dimensional feature spaces using ANOVA-based fast matrix-vector multiplication
- The uniform sparse FFT with application to PDEs with random coefficients
- Convergence of sparse grid Gaussian convolution approximation for multi-dimensional periodic functions
- A convergent iterated quasi-interpolation for periodic domain and its applications to surface PDEs
- A Windowed Fourier Method for Approximation of Non-periodic Functions on Equispaced Nodes
- Robust multiscale analytic sampling approximation to periodic function and fast algorithm
- Norm approximation of periodic functions from noisy Fourier coefficients
- Fourier methods for quasi-periodic oscillations
- The Fourier approximation of smooth but non-periodic functions from unevenly spaced data
- Interpretable approximation of high-dimensional data
- Grouped transformations and regularization in high-dimensional explainable ANOVA approximation
- A method for dimensionally adaptive sparse trigonometric interpolation of periodic functions
- Nonlinear approximation in bounded orthonormal product bases
- HARFE: hard-ridge random feature expansion
- Fast hyperbolic wavelet regression meets ANOVA
- An adaptive ANOVA stochastic Galerkin method for partial differential equations with high-dimensional random inputs
- On the approximability and curse of dimensionality of certain classes of high-dimensional functions
- Variable transformations in combination with wavelets and ANOVA for high-dimensional approximation
- ANOVA approximation with mixed tensor product basis on scattered points
- Unbalanced optimal transport and maximum mean discrepancies: interconnections and rapid evaluation
- Sparse additive function decompositions facing basis transforms
- Quasi-interpolation for high-dimensional function approximation
- Stochastic optimal transport in Banach spaces for regularized estimation of multivariate quantiles
- ANOVA-boosting for random Fourier features
- Efficient multivariate kernel based schemes for nonparametric functions approximations
- Fast and interpretable support vector classification based on the truncated ANOVA decomposition
- An efficient spatial discretization of spans of multivariate Chebyshev polynomials
- A multivariate Jacobi polynomials regression estimator associated with an ANOVA decomposition model
- Challenges in developing great quasi-Monte Carlo software
- Fast evaluation of additive kernels: feature arrangement, Fourier methods, and kernel derivatives
- Quasi-interpolation using generalized Gaussian kernels
- Learning and leveraging anisotropy parameters in ANOVA approximation
- Sensitivity analysis on the sphere and a spherical ANOVA decomposition
This page was built for publication: Approximation of high-dimensional periodic functions with Fourier-based methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5157402)