Отправить статью по E-mail 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
Цитировать
Открытый доступ
Доступ предоставлен
Только для подписчиков
Аннотация
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
