LCM of P(x) and Q(x) VI

Owning Palette: Polynomial VIs

Requires: Full Development System

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.

Use the pull-down menu to select an instance of this VI.

 Add to the block diagram  Find on the palette

LCM 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 to use for the calculation.
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
Least Common Multiple returns the least common multiple 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.

LCM 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 to use for the calculation.
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
Least Common Multiple returns the least common multiple 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.