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

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.