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ácemaster thesis
Author
Zhumaniezov Alisher
Supervisor
Frajták Karel
Opponent
Kugurakov Vladimir Sergeevich
Field of study
Softwarové inženýrstvíStudy program
Otevřená informatikaInstitutions 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.htmlVysokoš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 recordAbstract
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.
Collections
- Diplomové práce - 13136 [892]
Related items
Showing items related by title, author, creator and subject.
-
Experimental MIMO 2.4 GHz transceiver and its utilization as a verification platform for digital communication processing algorithms
Author: Rázga Tomáš; Supervisor: Sýkora Jan; Opponent: Pánek Petr
(České vysoké učení technické v Praze. Vypočetní a informační centrum., 2012-07-24) -
Effective image restoration algorithms for mobile devices
Author: Kamenický Jan; Supervisor: Flusser Jan; Opponent: Saic Stanislav
(České vysoké učení technické v Praze. Vypočetní a informační centrum., 2011-12-15)Effective image restoration algorithms for mobile devices -
Algoritmus s kompromisem mezi kvalitou a časem běhu v útočném grafu pro bezpečnost sítě
Author: Babayeva Elnaz; Supervisor: Durkota Karel; Opponent: Schaefer Martin
(České vysoké učení technické v Praze. Vypočetní a informační centrum.Czech Technical University in Prague. Computing and Information Centre., 2016-05-26)Hledání optimální strategii v útočném grafu je považována za NP těžkou úlohu. Correlated Stackelberg Equilibrium (CSE) aproximuje Strong Stackelberg Equilibrium (SSE), který hledá optimální strategie pro dva hráče, obránce ...