Jacobi–Perron algorithm
From Wikipedia, the free encyclopedia
In mathematics, the Jacobi–Perron algorithm is a generalization of the Euclidean algorithm to n-tuples of real numbers, which addresses Hermite's problem.[1] It was defined by C. G. J. Jacobi for n = 2 and Oskar Perron for n ≥ 2.[2]
