RobustSolver Class

public sealed class RobustSolver : RootBracketingSolver

Public NotInheritable Class RobustSolver
	Inherits RootBracketingSolver

public ref class RobustSolver sealed : public RootBracketingSolver

[<SealedAttribute>]
type RobustSolver = 
    class
        inherit RootBracketingSolver
    end

Inheritance

Object  →  ManagedIterativeAlgorithm<Double, Double, SolutionReport<Double, Double>>  →  IterativeAlgorithm<Double>  →  EquationSolver  →  RootBracketingSolver  →  RobustSolver

Use the RobustSolver class to find a root of a function if you have an interval that includes a root with certainty. This is the most robust of the root bracketing solver algorithms.

RobustSolver inherits from EquationSolver, which in turn inherits from IterativeAlgorithm<T>. All properties of IterativeAlgorithm<T> are available. The AbsoluteTolerance and RelativeTolerance properties set the desired precision as specified by the ConvergenceCriterion property. The default value for both tolerances is SqrtEpsilon (roughly 10^-8). MaxIterations sets the maximum number of iterations.

The TargetFunction property is a function of one variable that specifies the function we want to find a root for. The LowerBound and UpperBound properties specify the bounds of the bracketing interval. The target function must have a different sign at each end of this interval.

The Solve() method performs the actual approximation of the root. This method returns the best approximation that was found. The Status property indicates whether the algorithm was successful. The EstimatedError property gives an upper bound for the difference between the approximated and the actual root.

This method is a refinement of the Dekker-Brent method which for decades was the most advanced of the root bracketing algorithms. It combines the robustness of the bisection method with the increased speed of the regula falsi method.

Reference