Computes the least common multiple of 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

  • c1dcdb.png P(x) —

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

  • c1dcdb.png Q(x) —

    Q(x) contains the complex 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 least common multiple.

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

    0Euclidean (default)
    1Approximate GCD
  • i1dcdb.png Least Common Multiple —

    Least Common Multiple returns the least common multiple 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.