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

一元多项式矩阵算法的实现及其在二元结式中的应用

Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants

Seung Gyu Hyun, Vincent Neiger, Éric Schost

摘要:

在过去的几年里,许多关于一元多项式矩阵的问题的复杂性界已经得到了改进。然而,对于大多数相关算法,有效的实现是不可用的,这留下了这些算法的实际影响的问题,例如,在诸如解码一些纠错码和求解多项式系统或结构化线性系统的应用上。在本文中,我们讨论了最基本的操作:乘法,截断反演,逼近,插值,内核,线性系统求解,行列式和基础减少的实施方面。我们专注于素数字段的字长模,依靠Shoup的C++库NTL。结合这些新工具来实现Villard算法的变体,用于通用二元多项式的结果(ISSAC 2018),我们在大参数方面获得了比现有技术更好的性能。

英文摘要:

Complexity bounds for many problems on matrices with univariate polynomial entries have been improved in the last few years. Still, for most related algorithms, efficient implementations are not available, which leaves open the question of the practical impact of these algorithms, e.g. on applications such as decoding some error-correcting codes and solving polynomial systems or structured linear systems. In this paper, we discuss implementation aspects for most fundamental operations: multiplication, truncated inversion, approximants, interpolants, kernels, linear system solving, determinant, and basis reduction. We focus on prime fields with a word-size modulus, relying on Shoup's C++ library NTL. Combining these new tools to implement variants of Villard's algorithm for the resultant of generic bivariate polynomials (ISSAC 2018), we get better performance than the state of the art for large parameters.

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

↑