Polynomial Greatest Common Divisor as a Solution of System of Linear Equations

dc.contributor.author	Dolgov D.
dc.date.accessioned	2019-01-22T20:51:49Z
dc.date.available	2019-01-22T20:51:49Z
dc.date.issued	2018
dc.identifier.issn	1995-0802
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/149152
dc.description.abstract	© 2018, Pleiades Publishing, Ltd. 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.
dc.relation.ispartofseries	Lobachevskii Journal of Mathematics
dc.subject	Euclidean algorithm
dc.subject	generalized Schur algorithm
dc.subject	Polynomial GCD
dc.subject	system of linear equations
dc.title	Polynomial Greatest Common Divisor as a Solution of System of Linear Equations
dc.type	Article
dc.relation.ispartofseries-issue	7
dc.relation.ispartofseries-volume	39
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	985
dc.source.id	SCOPUS19950802-2018-39-7-SID85053519651

Files in this item

Size: 314.8Kb

Format: PDF

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.