arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.00409math.NAcs.NA
收藏

具有非负实系数的多项式插值的复杂度研究

On the Complexity of Interpolation by Polynomials with Non-negative Real Coefficients

Katsuyuki Bando, Eitetsu Ken, Hirotaka Onuki

AI总结:

本文研究非负实系数的完全单调多项式插值问题,给出有限点集极小多项式的次数上界,提出基于符号序列序结构的计算算法,并分析了相关算法的计算复杂度。

摘要:

本文研究完全单调多项式(completely monotonous polynomials,简称CMPs)的插值问题,这类多项式即系数为非负实数的多项式。具体而言,给定有限集合$S\subset \mathbb{R}_{>0} \times \mathbb{R}_{\geq 0}$,我们研究由Berg[1985]提出的$S$的极小多项式:其“极小性”体现为,它最终会被所有其他插值$S$的CMP所支配。我们给出了存在极小多项式时,$S$的极小多项式的次数上界。此外,我们提出另一种利用符号序列序结构计算给定集合$S$的极小多项式的算法。结合上述次数上界,我们还分析了包括本文算法在内的各类极小多项式计算算法的计算复杂度。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑