  We propose a modification of the GPGCD algorithm, which has been presented in
our previous research, for calculating approximate greatest common divisor
(GCD) of more than 2 univariate polynomials with real coefficients and a given
degree. In transferring the approximate GCD problem to a constrained
minimization problem, different from the original GPGCD algorithm for multiple
polynomials which uses the Sylvester subresultant matrix, the proposed
algorithm uses the B\'ezout matrix. Experiments show that the proposed
algorithm is more efficient than the original GPGCD algorithm for multiple
polynomials with maintaining almost the same accuracy for most of the cases.
