We present a method based on Dickson's lemma to compute the "approximate radical" of a zero dimensional ideal I in ℂ[x 1 , . . . , x m] which has zero clusters: the approximate radical ideal has exactly one root in each cluster for sufficiently small clusters. Our method is "global" in the sense that it does not require any local approximation of the zero clusters: it reduces the problem to the computation of the numerical nullspace of the so called "matrix of traces", a matrix computable from the generating polynomials of Ĩ. To compute the numerical nullspace of the matrix of traces we propose to use Gauss elimination with pivoting, and we prove that if Ĩ has k distinct zero clusters each of radius at most s in the ∞-norm, then k steps of Gauss elimination on the matrix of traces yields a submatrix with all entries asymptotically equal to ε 2. We also prove that the computed approximate radical has one root in each cluster with coordinates which are the arithmetic mean of the cluster, up to an error term asymptotically equal to 2. In the univariate case our method gives an alternative to known approximate square-free factorization algorithms which is simpler and its accuracy is better understood.