arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2304.01191cs.DMcs.DS
收藏

快速数值多元多点求值

Fast Numerical Multivariate Multipoint Evaluation

Sumanta Ghosh, Prahladh Harsha, Simão Herdade, Mrinal Kumar, Ramprasad Saptharishi

AI总结:

本文提出有理数、实数和复数域上多元多点求值的近线性时间数值算法,包含精确和近似版本,将一元结果推广至多元,并依赖有限域算法与数论技巧。

摘要:

我们针对有理数、实数和复数域上的多元多点求值问题,设计了近线性时间的数值算法。我们同时考虑了算法的精确版本和近似版本。算法的输入为:(1) 一个 $m$ 元多项式 $f$ 的系数,该多项式在每个变量上的次数为 $d$;(2) $N$ 个点 $a_1,\ldots, a_N$,每个点的每个坐标绝对值不超过 1,且位复杂度为 $s$。\n\n* 近似版本:额外给定精度参数 $t$,算法计算有理数 $\beta_1,\ldots, \beta_N$,使得对所有 $i$,有 $|f(a_i) - \beta_i| \leq \frac{1}{2^t}$,其运行时间为 $((Nm + d^m)(s + t))^{1 + o(1)}$,适用于所有 $m$ 和所有足够大的 $d$。\n\n* 精确版本(当在有理数域上时):额外给定所有求值位复杂度的上界 $c$,算法计算有理数 $f(a_1), \ldots, f(a_N)$,其运行时间为 $((Nm + d^m)(s + c))^{1 + o(1)}$,适用于所有 $m$ 和所有足够大的 $d$。\n\n在此工作之前,对于任何无限域上的多元多点求值(精确或近似),近线性时间算法似乎仅在一元多项式情形下已知,该结果由 Moroz 在近期的工作(FOCS 2021)中发现。在本工作中,我们将此结果从一元情形推广到多元情形。然而,我们的算法基于的概念似乎与 Moroz(FOCS 2021)的方法在本质上不同,并且关键依赖于 Bhargava、Ghosh、Guo、Kumar 和 Umans(FOCS 2022)关于有限域上多元多点求值的近期算法,以及计算数论中已知的高效有理数重构和快速中国剩余定理算法。

英文摘要:

We design nearly-linear time numerical algorithms for the problem of multivariate multipoint evaluation over the fields of rational, real and complex numbers. We consider both \emph{exact} and \emph{approximate} versions of the algorithm. The input to the algorithms are (1) coefficients of an $m$-variate polynomial $f$ with degree $d$ in each variable, and (2) points $a_1,..., a_N$ each of whose coordinate has value bounded by one and bit-complexity $s$. * Approximate version: Given additionally an accuracy parameter $t$, the algorithm computes rational numbers $β_1,\ldots, β_N$ such that $|f(a_i) - β_i| \leq \frac{1}{2^t}$ for all $i$, and has a running time of $((Nm + d^m)(s + t))^{1 + o(1)}$ for all $m$ and all sufficiently large $d$. * Exact version (when over rationals): Given additionally a bound $c$ on the bit-complexity of all evaluations, the algorithm computes the rational numbers $f(a_1), ... , f(a_N)$, in time $((Nm + d^m)(s + c))^{1 + o(1)}$ for all $m$ and all sufficiently large $d$. . Prior to this work, a nearly-linear time algorithm for multivariate multipoint evaluation (exact or approximate) over any infinite field appears to be known only for the case of univariate polynomials, and was discovered in a recent work of Moroz (FOCS 2021). In this work, we extend this result from the univariate to the multivariate setting. However, our algorithm is based on ideas that seem to be conceptually different from those of Moroz (FOCS 2021) and crucially relies on a recent algorithm of Bhargava, Ghosh, Guo, Kumar & Umans (FOCS 2022) for multivariate multipoint evaluation over finite fields, and known efficient algorithms for the problems of rational number reconstruction and fast Chinese remaindering in computational number theory.

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

↑