Enviar artigo por via de e-mail Polynomial Greatest Common Divisor as a Solution of System of Linear Equations
- Autores: Dolgov D.1
-
Afiliações:
- Department of System Analysis and Information Technologies, Institute of Computational Mathematics and Information Technologies
- Edição: Volume 39, Nº 7 (2018)
- Páginas: 985-991
- Seção: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/202769
- DOI: https://doi.org/10.1134/S1995080218070090
- ID: 202769
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
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.
Sobre autores
D. Dolgov
Department of System Analysis and Information Technologies, Institute of Computational Mathematics and Information Technologies
Autor responsável pela correspondência
Email: Dolgov.kfu@gmail.com
Rússia, ul. Kremlevskaya 18, Kazan, Tatarstan, 420008
