 | Bairstow |
The BairstowRootFinder type exposes the following members.
Fields| Name | Description | |
|---|---|---|
 | MaxIterations | The maximum number of iterations performed. |
| Small |
Number for determining if a value is approximately zero.
The algorithm will consider a number x to be zero if
the absolute value of x is less than C# Small |
| Tolerance | Iteration terminates with a converged status if the step length falls below this value. In moving from iterative step n to n + 1, the step length is defined as StepLength = sqrt((u(n) - u(n+1))^2 + (v(n) - v(n+1))^2) where un and vn are the coefficients in the quadratic x^2 + u(n)*x + v(n) at the nth step. |
See Also