GCD of p(x) and q(x) (Not in Base Package)

Computes the greatest common divisor for two polynomials P(x) and Q(x). You can use this polymorphic VI to determine the greatest common divisor for real polynomials or complex polynomials. The data types you wire to the P(x) and Q(x) inputs determine the polymorphic instance to use.

GCD of p(x) and q(x) (DBL)

	P(x) contains the real polynomial coefficients in ascending order of power.
	Q(x) contains the real polynomial coefficients in ascending order of power.
	tolerance specifies the numerical threshold for calculating Greatest Common Divisor.
	Greatest Common Divisor returns the greatest common divisor of P(x) and Q(x).
	error returns any error or warning from the VI. You can wire error to the Error Cluster From Error Code VI to convert the error code or warning into an error cluster.

GCD of p(x) and q(x) (CDB)

	P(x) contains the complex polynomial coefficients in ascending order of power.
	Q(x) contains the complex polynomial coefficients in ascending order of power.
	tolerance specifies the numerical threshold for calculating Greatest Common Divisor.
	Greatest Common Divisor returns the greatest common divisor of P(x) and Q(x).
	error returns any error or warning from the VI. You can wire error to the Error Cluster From Error Code VI to convert the error code or warning into an error cluster.