电邮这篇文章 Polynomial Greatest Common Divisor as a Solution of System of Linear Equations
- 作者: Dolgov D.1
-
隶属关系:
- Department of System Analysis and Information Technologies, Institute of Computational Mathematics and Information Technologies
- 期: 卷 39, 编号 7 (2018)
- 页面: 985-991
- 栏目: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/202769
- DOI: https://doi.org/10.1134/S1995080218070090
- ID: 202769
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
In this article we present a new algebraic approach to the greatest common divisor (GCD) computation of two polynomials based on Bezout’s identity. This approach is based on the solution of system of linear equations. Also we introduce the dmod operation for polynomials. This operation on polynomials f, g is used to reduce the degree of the larger polynomial f in a finite field Fp. This operation saves GCD(f, g). Also we present some ideas how to reduce spurious factors that arise at the procedure.
作者简介
D. Dolgov
Department of System Analysis and Information Technologies, Institute of Computational Mathematics and Information Technologies
编辑信件的主要联系方式.
Email: Dolgov.kfu@gmail.com
俄罗斯联邦, ul. Kremlevskaya 18, Kazan, Tatarstan, 420008
