Computes the greatest common divisor for two polynomials P(x) and Q(x) with the tolerance you specify. The data types you wire to the P(x) and Q(x) inputs determine the polymorphic instance to use.


icon

Inputs/Outputs

  • c1ddbl.png P(x) —

    P(x) contains the real polynomial coefficients in ascending order of power.

  • c1ddbl.png Q(x) —

    Q(x) contains the real polynomial coefficients in ascending order of power.

  • cdbl.png tolerance —

    tolerance specifies the numerical threshold to use for the calculation.

  • cu16.png algorithm —

    algorithm specifies the algorithm this VI uses to compute the polynomial greatest common divisor.

    Euclidean (0) is the classical method for polynomial GCD calculation. Approximate GCD (1) is more suitable in calculating the GCD of one polynomial and its derivative.

    0Euclidean (default)
    1Approximate GCD
  • i1ddbl.png Greatest Common Divisor —

    Greatest Common Divisor returns the greatest common divisor of P(x) and Q(x).

  • ii32.png error —

    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.