﻿BairstowRootFinder.SolveResult Class   Class encapsulating information about the result of applying Bairstows method to a polynomial. Inheritance Hierarchy
SystemObject
CenterSpace.NMath.CoreBairstowRootFinderSolveResult

Namespace:  CenterSpace.NMath.Core
Assembly:  NMath (in NMath.dll) Version: 7.4 Syntax
`public class SolveResult`

The BairstowRootFinderSolveResult type exposes the following members. Constructors
NameDescription BairstowRootFinderSolveResult
Default constructor.
Top Properties
NameDescription Converged
Property for determining convergence.
`true`
if the step size fell below the specified tolerance before the number of iterations exceeded the specified maximum value.
Top Methods
NameDescription ToString
Formats all solve status information to a string.
(Overrides ObjectToString.)
Top Fields
NameDescription ComplexRoots
Boolean value indicating the presence of complex roots in the solution. DividendPolynomial
The polynomial, P(x), being solved by Bairstows method which seeks coefficients u and v such that P(x) = (x^2 + u*x + v)b(x). DivisorPolynomial
The final quadratic polynomial (x^2 + u*x + v) found that approximately divides the polynomial P(x) being solved. P(x) = (x^2 + u*x + v)b(x). Iterations
Number of iterations performed during solve. QuotientPolynomial
The final quotient polynomial b(x) when solving a polynomial P(x). P(x) = (x^2 + u*x + v)b(x). Root1
Estimated root of the polynomial being solved. Root2
Estimated root of the polynomial being solved. SolveStatus
Value indicating the status of the solve. StepLength
The final step length after iteration. 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 u(n) and v(n) are the coefficients in the quadratic x^2 + u(n)*x + v(n) at the nth iterative step.
Top See Also