Last Modified: February 27, 2020

Computes the composition of two polynomials.

Error conditions that occur before this node runs.

The node responds to this input according to standard error behavior.

Standard Error Behavior

Many nodes provide an **error in** input and an **error out** output so that the node can respond to and communicate errors that occur while code is running. The value of **error in** specifies whether an error occurred before the node runs. Most nodes respond to values of **error in** in a standard, predictable way.

**Default: **No error

Level at which the node removes the trailing elements from the composition of two polynomials.

The node removes the trailing elements whose absolute values or relative values are less than or equal to **threshold**. If all the elements in the composition of two polynomials are less than or equal to **threshold**, **p(q(x))** returns a one-element array.

**Default: **0

Method to this node uses to remove the trailing elements from the composition of two polynomials.

Name | Value | Description |
---|---|---|

Absolute Value | 0 | Removes the trailing elements whose absolute values are less than or equal to threshold. |

Relative Value | 1 | Removes the trailing elements whose absolute values are less than or equal to threshold * |a|, where a is the coefficient which has the maximum absolute value in the composition of two polynomials. |

**Default: **Absolute Value

Coefficients, in ascending order of power, for the polynomial that results from composing two polynomials.

Error information.

The node produces this output according to standard error behavior.

Standard Error Behavior

**error in** input and an **error out** output so that the node can respond to and communicate errors that occur while code is running. The value of **error in** specifies whether an error occurred before the node runs. Most nodes respond to values of **error in** in a standard, predictable way.

The following polynomial defines the *n*^{th} order polynomial described by the (*n* + 1) element array *P*[0...*n*]:

$\underset{i-0}{\overset{n}{\sum}}P\left[i\right]{x}^{i}$

The following polynomial defines the *n*^{th} order polynomial described by the (*m* + 1) element array *Q*[0...*m*]:

$\underset{j-0}{\overset{m}{\sum}}P\left[j\right]{x}^{j}$

This node uses the following equation to compose *P*(*x*) and *Q*(*x*):

$P\left(Q\left(x\right)\right)=P\left[n\right]{\left(Q\left[m\right]{x}^{m}+Q[m-1]{x}^{m-1}+\dots +Q\left[1\right]x+Q\left[0\right]\right)}^{n}+P[n-1]{\left(Q\left[m\right]{x}^{m}+Q[m-1]{x}^{m-1}+\dots +Q\left[1\right]x+Q\left[0\right]\right)}^{n-1}+\dots +P\left[1\right]\left(Q\left[m\right]{x}^{m}+Q[m-1]{x}^{m-1}+\dots +Q\left[1\right]+Q\left[0\right]\right)+P\left[0\right]$

**Where This Node Can Run: **

Desktop OS: Windows

FPGA: Not supported

Web Server: Not supported in VIs that run in a web application