Quasi-interpolation using generalized Gaussian kernels
School of Big Data and Statistics, Anhui University(安徽大学大数据与统计学院);School of Mathematics and Statistics, Nanjing University of Science and Technology(南京理工大学数学与统计学院)
This paper focuses on developing a framework for constructing quasi-interpolation with the highest achievable approximation order from generalized Gaussian kernels with the help of kernel restriction trick and periodization technique. We first demonstrate that when we restrict generalized Gaussian kernels satisfying generalized Strang-Fix conditions of order s over a torus, the corresponding restricted kernels in tensor-product forms fulfill periodic Strang-Fix conditions of the same order s. Then, based on these restricted kernels, we construct a periodic quasi-interpolant in Schoenberg's form and derive its error estimates for periodic function approximation over a torus, which reveals that our quasiinterpolant attains the highest approximation order s. Finally, using the periodization technique, we extend the periodic quasi-interpolant to its nonperiodic counterpart with the highest approximation order s for approximating a general function defined over a cube via a torus-to-cube transformation. This result stands in stark contrast to classical quasi-interpolation counterparts, which often yield much lower approximation orders than those dictated by the generalized Strang-Fix conditions of generalized Gaussian kernels. Furthermore, we propose a sparse grid counterpart for high-dimensional function approximation to alleviate the curse of dimensionality. Numerical simulations confirm that our quasi-interpolation scheme is simple and computationally efficient.
Lappeenranta–Lahti University of Technology LUT(拉彭兰塔-拉赫蒂理工大学);Ca’ Foscari University of Venice(威尼斯卡福斯卡里大学);Ludwig Maximilian University of Munich(慕尼黑路德维希-马克西米利安大学)
Institut für Numerische Simulation, Universität Bonn(波恩大学数值模拟研究所);Fraunhofer Institute for Algorithms and Scientific Computing (SCAI)(弗劳恩霍夫算法与科学计算研究所);Departement Mathematik und Informatik, Universität Basel(巴塞尔大学数学与信息学系);Istituto Dalle Molle di studi sull’intelligenza artificiale, Università della Svizzera italiana(意大利瑞士大学达莱莫勒人工智能研究学院)
A Unified Framework for Efficient Kernel and Polynomial Interpolation
Kahlert School of Computing, University of Utah(犹他大学卡勒特计算学院);Department of Applied Mathematics and Statistics, Colorado School of Mines(科罗拉多矿业大学应用数学与统计系);Department of Mathematics, and Scientific Computing and Imaging (SCI) Institute, University of Utah(犹他大学数学系及科学计算与成像研究所);Stena Center for Financial Technology, University of Utah(犹他大学斯泰纳金融技术研究中心)
Refined rates of convergence for target-data dependent greedy generalized interpolation with Sobolev kernels
Institute of Applied Analysis and Numerical Simulation, University of Stuttgart(斯图加特大学应用分析与数值模拟研究所);Department of Environmental Sciences, Informatics and Statistics, Ca’ Foscari University of Venice(威尼斯卡福斯卡里大学环境科学、信息学与统计系);Department of Mathematics, Ludwig-Maximilians-Universität München(慕尼黑路德维希-马克西米利安大学数学系);Institute for Stochastics and Applications, University of Stuttgart(斯图加特大学随机过程与应用研究所)
Fast approximation by periodic kernel-based lattice-point interpolation with application in uncertainty quantification
本文讨论了在积分格点上插值的多元周期函数的基于核的逼近--正如Zeng,Leung,Hickernell(MCQMC 2004,2006)和Zeng,Kritzer,Hickernell(Constr.大约,2009),允许通过快速傅里叶变换进行快速评估,因此避免了对线性求解器的需要。本文的主要贡献是应用于椭圆型偏微分方程的不确定性量化的近似问题,扩散系数由一个随机场,这是周期性的随机变量,在最近提出的模型Kaarnioja,郭,斯隆(SIAM J. Numer.肛门,2020年)。本文给出了一个完整的误差分析,并充分的细节,以确保良好的(但不可避免地不是最佳的)收敛速率和误差界的尺寸无关的晶格建设。数值实验支持了这一理论。
School of Mathematics and Statistics, Nanjing University of Science and Technology(南京理工大学数学与统计学院);Department of Mathematics, Missouri State University(密苏里州立大学数学系)