Polynomial Roots VI

Owning Palette: Polynomial VIs

Requires: Full Development System

Finds the roots of polynomial P(x). This VI removes leading coefficients of the polynomial that are equal to zero. Wire data to the P(x) input to determine the polymorphic instance to use or manually select the instance.

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

Select an instance Polynomial Roots (DBL)Polynomial Roots (CDB)

Add to the block diagram

Find on the palette

Polynomial Roots (DBL)

	P(x) contains the real polynomial coefficients in ascending order of power. P(x) cannot equal 0.
	option specifies the option for root finding. The default is Simple Classification. 0 General—Specifies that the real polynomial P(x) is regarded as a complex polynomial. Roots might not be exact real or complex conjugate. 1 Simple Classification—Based on the results of the General option, the roots are divided into two kinds: real (remove the imaginary part) or complex conjugate (average the real parts and imaginary parts respectively). 2 Refinement—Based on the results of the Simple Classification option, the roots are refined again by the Newton method for real roots and the Bairstow method for complex conjugate roots. With this option the Roots can be more accurate, but the computation might be numerically unstable. 3 Advanced Refinement—Finds the roots more accurately and stably, especially when the polynomial has repeated roots. The resulting roots are exact real or complex conjugate. Due to the computation complexity, this method is time-consuming.
	Roots returns the real and complex conjugate roots of P(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.

Polynomial Roots (CDB)

	P(x) contains the complex polynomial coefficients in ascending order of power.
	option specifies the option for root finding. The default is General. 0 General—Performs the Newton-based method to find the roots. This root-finding method is fast but has low precision. 3 Advanced Refinement—Finds the roots more accurately and stably, especially when the polynomial has repeated roots. Due to the computation complexity, this method is time-consuming.
	Roots returns the complex roots of P(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.