GCF extraction from multivariable polynomials using indirect Padé approximation
The greatest common factor (GCF) is extracted from multi-variable polynomials using an ‘indirect’ method for computing generalised Padé-type approximations of multivariable rational functions. The algorithm is computationally easy and conceptually very simple. An example is given to illustrate the method.