计算幂级数的一种符号-数值方法:模部分
Towards a Symbolic-Numeric Method to Compute Puiseux Series: The Modular Part
摘要:
我们设计了一种新的符号-数值策略来高效而精确地计算由代数数域上的二元多项式定义的浮点Puietrix级数。本质上,计算模一个精心选择的素数$p$用于获得指导浮点计算所需的确切信息。本文详细介绍了算法的符号部分:首先,我们研究了Puixix级数的模约简,给出了一个很好的约简准则,保证了数值部分所需的信息得到保留。为了建立我们的结果,我们介绍了一个简单的修改经典牛顿多边形,我们称之为“通用牛顿多边形”,这是非常方便的。然后,我们估计了计算有限域上的Pu i i n x级数的算术复杂度,并改进了已知的界。最后,我们给出了符号部分的确定性和随机化版本的位复杂性界。数字部分的细节将在即将发表的论文中描述。
英文摘要:
We have designed a new symbolic-numeric strategy to compute efficiently and accurately floating point Puiseux series defined by a bivariate polynomial over an algebraic number field. In essence, computations modulo a well chosen prime $p$ are used to obtain the exact information required to guide floating point computations. In this paper, we detail the symbolic part of our algorithm: First of all, we study modular reduction of Puiseux series and give a good reduction criterion to ensure that the information required by the numerical part is preserved. To establish our results, we introduce a simple modification of classical Newton polygons, that we call "generic Newton polygons", which happen to be very convenient. Then, we estimate the arithmetic complexity of computing Puiseux series over finite fields and improve known bounds. Finally, we give bit-complexity bounds for deterministic and randomized versions of the symbolic part. The details of the numerical part will be described in a forthcoming paper.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。