The paper presents a new numerical method for the computation of the greatest common divisor (gcd) of an m-set of polynomials of R[s], P(m, d), of maximal degree d. It is based on a recently proposed theoretical procedure [7] that characterizes the gcd of P(m, d) as the output decoupling zero polynomial of a linear system S(A, C) that may be associated with P(m, d). The computation of the gcd is thus reduced to finding the finite zeros of the pencil sW - AW, where W is the unobservable subspace of S(A, C). If k = dim W, the gcd is determined as any nonzero entry of the kth compound C(k)(sW - AW). The method defines the exact degree of ged, works satisfactorily with any number of polynomials and evaluates successfully approximate solutions.