I'm looking for what the title says. Euclidean algorithm works and is fast for just a pair of numbers, but I don't see any obvious generalizations. A quick googling didn't turn up anything too ...

The GCD algorithm takes advantage of a majorization-minimization trick to make each coordinatewise update simple and efficient. Extensive numerical experiments show that the GCD algorithm is much ...