arXiv:1805.09106 [math.NA]AbstractReferencesReviewsResources
Transformed Rank-1 Lattices for high-dimensional approximation
Published 2018-05-23Version 1
This paper describes an extension of Fourier approximation methods for multivariate functions defined on bounded domains to unbounded ones via a multivariate change of coordinate mapping. In this approach we adapt algorithms for the evaluation and reconstruction of multivariate trigonometric polynomials based on single and multiple reconstructing rank-1 lattices and make use of dimension incremental construction methods for sparse frequency sets. Various numerical tests confirm obtained theoretical results for the transformed methods.
Related articles: Most relevant | Search more
arXiv:2207.12826 [math.NA] (Published 2022-07-26)
Variable Transformations in combination with Wavelets and ANOVA for high-dimensional approximation
arXiv:1511.01554 [math.NA] (Published 2015-11-04)
Low-rank methods for high-dimensional approximation and model order reduction
arXiv:2103.00815 [math.NA] (Published 2021-03-01)
Computation complexity of deep ReLU neural networks in high-dimensional approximation