Analysis and investigation of the convergence of the Bezout coefficients search algorithm
Analysis and investigation of the convergence of the Bezout coefficients search algorithm
| dc.contributor.advisor | Frajták Karel | |
| dc.contributor.author | Zhumaniezov Alisher | |
| dc.date.accessioned | 2018-06-19T22:08:01Z | |
| dc.date.available | 2018-06-19T22:08:01Z | |
| dc.date.issued | 2018-06-13 | |
| dc.identifier | KOS-862954013805 | |
| dc.identifier.uri | http://hdl.handle.net/10467/77227 | |
| dc.description.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. | cze |
| dc.description.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. | eng |
| dc.language.iso | ENG | |
| dc.publisher | České vysoké učení technické v Praze. Vypočetní a informační centrum. | cze |
| dc.publisher | Czech Technical University in Prague. Computing and Information Centre. | eng |
| dc.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 | eng |
| dc.rights | 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 | cze |
| dc.subject | Euclidean algorithm,extended Euclidean algorithm,k-ary algorithm for computing GCD,calculation of inverse elements modulo | cze |
| dc.subject | Euclidean algorithm,extended Euclidean algorithm,k-ary algorithm for computing GCD,calculation of inverse elements modulo | eng |
| dc.title | Analysis and investigation of the convergence of the Bezout coefficients search algorithm | cze |
| dc.title | Analysis and investigation of the convergence of the Bezout coefficients search algorithm | eng |
| dc.type | diplomová práce | cze |
| dc.type | master thesis | eng |
| dc.date.accepted | ||
| dc.contributor.referee | Kugurakov Vladimir Sergeevich | |
| theses.degree.discipline | Softwarové inženýrství | cze |
| theses.degree.grantor | katedra počítačů | cze |
| theses.degree.programme | Otevřená informatika | cze |
Soubory tohoto záznamu
Tento záznam se objevuje v následujících kolekcích
-
Diplomové práce - 13136 [833]