arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1109.2688math.CO
收藏

组合系统的算法:良基系统与牛顿迭代

Algorithms for Combinatorial Systems: Well-Founded Systems and Newton Iterations

Carine Pivoteau, Bruno Salvy, Michele Soria

摘要:

我们考虑系统的递归定义的组合结构。我们给出算法检查这些系统是有根据的,计算生成系列和提供数值。我们的框架是一个关节的建设类Flajolet和Sedgewick与Joyal的物种理论。我们将隐物种定理推广到零大小的结构。一个二次迭代牛顿方法来解决良基系统组合。从那里,截断相应的生成系列获得准最佳的复杂性。这种迭代转移到一个数值方案,无条件地收敛到其收敛盘内的生成级数的值。这些结果为随机数产生提供了重要的子程序。最后,将该方法推广到组合微分系统。

英文摘要:

We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the constructible classes of Flajolet and Sedgewick with Joyal's species theory. We extend the implicit species theorem to structures of size zero. A quadratic iterative Newton method is shown to solve well-founded systems combinatorially. From there, truncations of the corresponding generating series are obtained in quasi-optimal complexity. This iteration transfers to a numerical scheme that converges unconditionally to the values of the generating series inside their disk of convergence. These results provide important subroutines in random generation. Finally, the approach is extended to combinatorial differential systems.

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

↑