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

p次多项式空间中的插值

Interpolation in Polynomial Spaces of p-Degree

Phil-Alexander Hofmann, Damar Wicaksono, Michael Hecht

AI总结:

研究提出快速牛顿变换(FNT)算法,针对特定向下闭多项式空间Π_{m,n,p}分析其时间复杂度,证明其相比张量积空间可大幅降低复杂度,并通过敏感性分析活动得分验证其效率。

摘要:

我们近期提出了快速牛顿变换(Fast Newton Transform,FNT),这是一种用于在空间维度为m的任意向下闭多项式空间中执行多元牛顿插值的分层算法。在此,我们在特定的向下闭集合族A_{m,n,p}的背景下分析FNT,该集合族被定义为所有ℓ^p范数小于n的多重指标,其中p∈[0,∞]。FNT在诱导的向下闭多项式空间Π_{m,n,p}上的时间复杂度为O(|A_{m,n,p}|mn)。我们表明,与张量积空间Π_{m,n,∞}相比,Π_{m,n,p}的选择将时间复杂度降低了ρ_{m,n,p}倍,当m≲n^p时,该倍数随空间维度呈超指数衰减。我们通过计算敏感性分析中的活动得分来展示FNT的效率。

英文摘要:

We recently introduced the Fast Newton Transform (FNT), an hierarchical algorithm for performing multivariate Newton interpolation in arbitrary downward closed polynomial spaces of spatial dimension $m$. Here, we analyze the FNT in the context of a specific family of downward closed sets $A_{m,n,p}$, defined as all multi-indices with $\ell^p$ norm less than $n$ with $p \in [0,\infty]$. The FNT performs with time complexity $\mathcal{O}(|A_{m,n,p}|mn)$ on the induced downward closed polynomial spaces $Π_{m,n,p}$. We show that the $Π_{m,n,p}$ choice compared to the tensor product spaces $Π_{m,n,\infty}$, reduces time complexity by a factor of $ρ_{m,n,p}$, decaying super exponentially with spatial dimension when $m \lesssim n^p$. We showcase the efficiency of the FNT by computing activity scores in sensitivity analysis.

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

↑