Abstract:
An algorithm is proposed as a multidimensional generalization of the Euclid algorithm. It is similar to the Brun algorithm. For any dimention $d$, the algorithm allows to obtain 1) $d$-dimensional approximations; 2) approximations of linear forms of $d+1$ variables. A verification test of work efficiency was carried out.
Key words and phrases:Euclidian algorithm, multidimensional approximations, multidimensional continued fractions.