Euclidean Greatest Common Divisor Finder Algorithm

However, for polynomials, there are specific algorithms that use algebraic property for certifying that no root is missed, and locating the beginnings in separate intervals (or disks for complex beginnings) that are small enough to ensure the convergence of numerical methods (typically Newton's method) to the unique root so located. As, generally, the zeroes of a function can not be calculated precisely nor expressed in closed form, root-finding algorithms supply approximations to zeroes, expressed either as floating point numbers or as small isolating intervals, or disks for complex beginnings (an interval or disk output being equivalent to an approximate output together with an mistake bound).

Euclidean Greatest Common Divisor Finder source code, pseudocode and analysis

COMING SOON!