RegulaFalsiSolver Class

public sealed class RegulaFalsiSolver : RootBracketingSolver

Public NotInheritable Class RegulaFalsiSolver
	Inherits RootBracketingSolver

public ref class RegulaFalsiSolver sealed : public RootBracketingSolver

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

Inheritance

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

The regula falsi method, also called the method of false position, is a root bracketing algorithm. It works by approximating the target function by a line. The bracketing interval is divided at the point where this line crosses the axis.

The regula falsi method is superior to the bisection method in that it will, in most cases, converge faster. However, in certain situations it can get 'stuck,' and convergence may actually be slower than the bisection method.

The Dekker-Brent method, and a further refinement implemented by the RobustSolver class, combine the best of both worlds.

RegulaFalsiSolver inherits from RootBracketingSolver, 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.

Reference