Analysis and investigation of the convergence of the Bezout coefficients search algorithm

Analysis and investigation of the convergence of the Bezout coefficients search algorithm

Type of document
diplomová práce
master thesis
Author
Zhumaniezov Alisher
Supervisor
Frajták Karel
Opponent
Kugurakov Vladimir Sergeevich
Field of study
Softwarové inženýrství
Study program
Otevřená informatika
Institutions assigning rank
katedra počítačů


Rights
A university thesis is a work protected by the Copyright Act. Extracts, copies and transcripts of the thesis are allowed for personal use only and at one?s own expense. The use of thesis should be in compliance with the Copyright Act http://www.mkcr.cz/assets/autorske-pravo/01-3982006.pdf and the citation ethics http://knihovny.cvut.cz/vychova/vskp.html
Vysokoškolská závěrečná práce je dílo chráněné autorským zákonem. Je možné pořizovat z něj na své náklady a pro svoji osobní potřebu výpisy, opisy a rozmnoženiny. Jeho využití musí být v souladu s autorským zákonem http://www.mkcr.cz/assets/autorske-pravo/01-3982006.pdf a citační etikou http://knihovny.cvut.cz/vychova/vskp.html
Metadata
Show full item record
Abstract
In the age of modern technology, time is a very valuable resource. Therefore, an important indicator of the program's work is its computational speed. This essay will describe the optimization of Bezout coefficients search algorithm by introduction different optimization schemes. Bezout's equation is a representation of the greatest common divisor d of two integers A and B as a linear combination Ax + By = d, where x, y are integers called Bezout's coefficients. Usually Bezout's coefficients are counted using the extended version of the classical Euclidian Algorithm.
 
In the age of modern technology, time is a very valuable resource. Therefore, an important indicator of the program's work is its computational speed. This essay will describe the optimization of Bezout coefficients search algorithm by introduction different optimization schemes. Bezout's equation is a representation of the greatest common divisor d of two integers A and B as a linear combination Ax + By = d, where x, y are integers called Bezout's coefficients. Usually Bezout's coefficients are counted using the extended version of the classical Euclidian Algorithm.
 
URI
http://hdl.handle.net/10467/77227
View/Open
Collections