Represents a root finder that uses Dekker and Brent's
, Double Extreme.Mathematics.AlgorithmsManagedIterativeAlgorithmDouble Extreme.Mathematics.AlgorithmsIterativeAlgorithm Extreme.Mathematics.EquationSolversEquationSolver Extreme.Mathematics.EquationSolversRootBracketingSolver Extreme.Mathematics.EquationSolversDekkerBrentSolver
Extreme.Numerics.Net40 (in Extreme.Numerics.Net40.dll) Version: 6.0.16073.0 (6.0.16283.0)
public sealed class DekkerBrentSolver : RootBracketingSolver
Public NotInheritable Class DekkerBrentSolver
public ref class DekkerBrentSolver sealed : public RootBracketingSolver
type DekkerBrentSolver =
The DekkerBrentSolver type exposes the following members.
Use the DekkerBrentSolver 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.
DekkerBrentSolver inherits from
RootBracketingSolver, which in turn inherits
All properties of IterativeAlgorithm are available.
The AbsoluteTolerance and
RelativeTolerance properties set the desired
precision as specified by the
ConvergenceCriterion property. The default
value for both tolerances is
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
properties specify the bounds of the bracketing interval.
The target function must have a different sign at each
end of this interval.
The Solve(Double) 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.
The Dekker-Brent method is the most advanced of the
algorithms. It combines the robustness of the
bisection method with the
increased speed of the regula
At each iteration, either a bisection or a regula falsi
step is taken, depending on the behavior of the algorithm
up to that point. As a result, the Dekker-Brent method will
converge as fast as the best case regula falsi method at its
best, and as slow as the bisection method at its worst.
Supported in: 6.0, 5.x, 4.x