arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1008.3596math.AGcs.NAcs.SCmath.NA
收藏

通过根近似实现有理数域上双变量多项式的精确因式分解

Exact Bivariate Polynomial Factorization in Q by Approximation of Roots

University of Electronic Sciences and Technology(电子科技大学)

Yong Feng, Wenyuan Wu, Jingzhong Zhang

AI总结:

提出一种利用数值方法获得有理系数双变量多项式精确因子的算法,可高效实现于C++等语言并易于并行化。

摘要:

多项式因式分解是符号计算的基础之一,其应用出现在数学和其他科学的众多分支中。然而,当前的高级编程语言如C++和J++并不直接支持符号计算,这导致因式分解在工程领域的应用存在困难。本文提出了一种算法,利用数值方法获得有理系数双变量多项式的精确因子。我们的方法可以直接在高效编程语言如C++中结合GNU多精度库实现。此外,数值计算部分通常仅需双精度,且易于并行化。

英文摘要:

Factorization of polynomials is one of the foundations of symbolic computation. Its applications arise in numerous branches of mathematics and other sciences. However, the present advanced programming languages such as C++ and J++, do not support symbolic computation directly. Hence, it leads to difficulties in applying factorization in engineering fields. In this paper, we present an algorithm which use numerical method to obtain exact factors of a bivariate polynomial with rational coefficients. Our method can be directly implemented in efficient programming language such C++ together with the GNU Multiple-Precision Library. In addition, the numerical computation part often only requires double precision and is easily parallelizable.

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

↑