Click or drag to resize

BairstowRootFinderFindUniqueRoots Method (Double, Int32, Double)

Finds the unique roots of a polynomial P(x) = a[0] + a[1]*x + a[2]*x^2 + ... + a[n]*x^n using repeated application of Bairstow's method.

Namespace:  CenterSpace.NMath.Core
Assembly:  NMath (in NMath.dll) Version: 7.4
public static ICollection<DoubleComplex> FindUniqueRoots(
	double[] a,
	int maxIterations = 100,
	double tolerance = 1E-12


Type: SystemDouble
The coefficients of the polynomial to solve. The constant term is at index 0 and the leading coefficient is at index
a.Length - 1
. The leading coefficient cannot be zero.
maxIterations (Optional)
Type: SystemInt32
Maximum number of iterations to perform during an application of Bairstow's method.
tolerance (Optional)
Type: SystemDouble
Iteration in Bairstow's method terminates if
falls below this value.

Return Value

Type: ICollectionDoubleComplex
The set of unique roots.
See Also