On the Complexity of Interpolation by Polynomials with Non-negative Real Coefficients
Katsuyuki Bando, Eitetsu Ken, Hirotaka Onuki
备注:
28 pages, one figure and three algorithms, references to preceding works on sparse interpolating are added (reflecting the comment from reviewers of ISSAC2024), comparison of our algorithm and BHM's is added at the last part of section 5, which resolves the last question in the previous version of section 6: on the meaning of our order on sign sequences
In this paper, we consider interpolation by \textit{completely monotonous} polynomials (CMPs for short), that is, polynomials with non-negative real coefficients. In particular, given a finite set $S\subset \mathbb{R}_{>0} \times \mathbb{R}_{\geq 0}$, we consider \textit{the minimal polynomial} of $S$, introduced by Berg [1985], which is `minimal,' in the sense that it is eventually majorized by all the other CMPs interpolating $S$. We give an upper bound of the degree of the minimal polynomial of $S$ when it exists. Furthermore, we give another algorithm for computing the minimal polynomial of given $S$ which utilizes an order structure on sign sequences. Applying the upper bound above, we also analyze the computational complexity of algorithms for computing minimal polynomials including ours.
Some remarks on filtered polynomial interpolation at Chebyshev nodes
本文研究了四类Chebyshev节点上的滤波de la Vallée Poussin(VP)插值。这种近似模型是有趣的应用,因为它结合了经典的拉格朗日多项式逼近(插值和多项式保持)与过滤近似(一致有界的勒贝格常数和减少的吉布斯现象)的优点。在这里,我们重点介绍一些在滤波VP插值应用中有用的附加功能。特别地,我们分析了VP插值多项式的导数所提供的同时逼近。此外,我们还证明了VP逼近算子在Sobolev和Hölder-Zygmund空间中的一致有界性,其中几个积分-微分模型是唯一稳定可解的.
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(犹他大学斯泰纳金融技术研究中心)
On the filtered polynomial interpolation at Chebyshev nodes
本文讨论了一种特殊的滤波逼近方法,它利用de la Vallée Poussin滤波器在Chebyshev零点处产生插值多项式。这些多项式可以是一个有用的设备,许多理论和应用问题,因为它们结合了经典的拉格朗日插值的优点,在空间的局部连续函数配备适当的,Jacobi-加权,统一规范的一致收敛性收敛。相关的勒贝格常数的一致有界性,即Lagrange插值所缺少的一致收敛性,已经在文献中在不同的但仅仅是充分的假设下得到了证明.在这里,我们陈述了得到它的充要条件,这些条件很容易检验,因为它们是关于定义范数的Jacobi权的指数的简单不等式。此外,他们是必要的和足够的,以获得一个接近最佳逼近误差的过滤插值多项式,它趋于零的节点数$n$趋于无穷大。此外,收敛速度与$n$次最佳多项式逼近的误差相当,因此逼近阶随着所寻求函数的光滑性而提高。给出了几个数值实验,以检验理论结果,在相同的节点上与拉格朗日插值进行比较,并显示如何可以大大减少吉布斯现象。
Lagrange interpolation processes based on the zeros of anti-Gauss Jacobi polynomials
University of Cagliari(卡利亚里大学);Insubria University(因斯布鲁克大学);University of Basilicata(巴西利卡塔大学);Istituto per le Applicazioni del Calcolo “Mauro Picone”, Naples branch, C.N.R. National Research Council of Italy(意大利国家研究委员会计算应用研究所“毛罗·皮切内”那不勒斯分部)
Reconstructing sparse exponential polynomials from samples: Stirling numbers and Hermite interpolation
Lehrstuhl für Mathematik mit Schwerpunkt Digitale Bildverarbeitung & FORWISS, University of Passau(帕绍大学数字图像处理重点数学研究所与FORWISS);University of Passau(帕绍大学)
A mixed interpolation-regression method for numerical integration on the unit circle using zeros of para-orthogonal polynomials
La Laguna University, Spain(拉戈哈大学);IMAG and Departamento de Matemática Aplicada, Universidad de Granada, Spain(格拉纳达大学);Departamento de Matemáticas, Universidad Carlos III de Madrid, Spain(马德里卡洛斯三世大学)