首页> 外文期刊>Journal of complexity >Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form
【24h】

Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form

机译:基于Korobov形式的沿秩1格采样的三角多项式逼近多元周期函数。

获取原文
获取原文并翻译 | 示例
       

摘要

In this paper, we present error estimates for the approximation of multivariate periodic functions in periodic Hilbert spaces of isotropic and dominating mixed smoothness by trigonometric polynomials. The approximation is based on sampling of the multivariate functions on rank-1 lattices. We use reconstructing rank-1 lattices with generating vectors of Korobov form for the sampling and generalize the technique from Temlyakov (1986), in order to show that the aliasing error of that approximation is of the same order as the error of the approximation using the partial sum of the Fourier series. The main advantage of our method is that the computation of the Fourier coefficients of such a trigonometric polynomial, which we use as approximant, is based mainly on a one-dimensional fast Fourier transform, cf. Kammerer et al. (2013), Kammerer (2014). This means that the arithmetic complexity of the computation depends only on the cardinality of the support of the trigonometric polynomial in the frequency domain. Numerical results are presented up to dimension d = 10. (C) 2014 Elsevier Inc. All rights reserved.
机译:在本文中,我们通过三角多项式,给出了各向同性和支配混合光滑度的周期希尔伯特空间中多元周期函数逼近的误差估计。该近似基于秩1格上多元函数的采样。我们使用带有Korobov形式的生成向量的重构秩1晶格进行采样,并对Temlyakov(1986)的技术进行了概括,以表明该近似的混叠误差与使用E的近似误差的阶数相同。傅立叶级数的部分和。我们方法的主要优点是,我们近似使用的这种三角多项式的傅里叶系数的计算主要基于一维快速傅里叶变换,参见。 Kammerer等。 (2013),Kammerer(2014)。这意味着计算的算术复杂度仅取决于频域中三角多项式支持的基数。数值结果最大为d =10。(C)2014 Elsevier Inc.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号