An Effective Programming of GCD Algorithms for Natural Numbers

dc.contributor.author	Al Halidi A.M.
dc.contributor.author	Ishmukhametov S.T.
dc.date.accessioned	2021-02-25T20:37:55Z
dc.date.available	2021-02-25T20:37:55Z
dc.date.issued	2020
dc.identifier.issn	1066-369X
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/162108
dc.description.abstract	© 2020, Allerton Press, Inc. We study the problem of acceleration of GCD algorithms for natural numbers based on the approximating k-ary algorithm. We suggest a new scheme of the approximating algorithm implementation ensuring the value of the reduction coefficient ρ = Ai/Bi equal or exceeding k where k is a regulated parameter of computation not exceeding the size of a computer word. This approach ensures a significant advantage of our algorithm against the classical Euclidean algorithm.
dc.relation.ispartofseries	Russian Mathematics
dc.subject	approximating k-ary Algorithm
dc.subject	Euclidian GCD Algorithm
dc.subject	greatest common divisor
dc.subject	k-ary Algorithm
dc.title	An Effective Programming of GCD Algorithms for Natural Numbers
dc.type	Article
dc.relation.ispartofseries-issue	6
dc.relation.ispartofseries-volume	64
dc.collection	Публикации сотрудников КФУ
dc.source.id	SCOPUS1066369X-2020-64-6-SID85089139551

Files in this item

Size: 99.04Kb

Format: PDF

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