Polynomial Nodes (G Dataflow)

Adds two polynomials or rational polynomials.
Creates orthogonal polynomial coefficients.
Uses partial fraction expansion (PFE) to reconstruct a rational polynomial.
Creates a polynomial from its roots.
Integrates a real polynomial over an interval.
Divides one polynomial or rational polynomial by another.
Calculates the feedback equation.
Calculates the indefinite integral of a polynomial.
Multiplies one polynomial or rational polynomial by another.
Normalizes the numerator and denominator of rational polynomials.
Calculates the nth order derivative of a polynomial or rational polynomial.
Finds the order or degree of a polynomial.
Determines the coefficients of a rational polynomial to best suit a given set of derivatives.
Calculates the partial fraction expansion of a rational polynomial using the Heaviside cover-up method.
Evaluates a polynomial with a single value, multiple values, or a matrix.
Plots the evaluations of a polynomial.
Calculates the number of zeros of a real polynomial in a real interval.
Finds the roots of a polynomial. This node removes leading coefficients of the polynomial that are equal to zero.
Computes the composition of two polynomials.
Computes the greatest common divisor (GCD) for two polynomials with the tolerance you specify.
Computes the least common multiple (LCM) of two polynomials with the tolerance you specify.
Removes the residue from the denominator of a rational polynomial if the numerator equals zero.
Removes from the coefficients of a real polynomial the trailing coefficients near zero whose absolute values are less than a specified level.
Classifies the roots of a polynomial into real, complex conjugate pair, and pure complex roots.
Sorts complex numbers in ascending or descending order with respect to real and imaginary parts or magnitude.
Evaluates special polynomials.
Subtracts one polynomial or rational polynomial from another.
Obtains all the unique numbers from the input array and determines the multiplicity of each unique number.