NewtonRaphsonSolver Class

public sealed class NewtonRaphsonSolver : EquationSolver

Public NotInheritable Class NewtonRaphsonSolver
	Inherits EquationSolver

public ref class NewtonRaphsonSolver sealed : public EquationSolver

[<SealedAttribute>]
type NewtonRaphsonSolver = 
    class
        inherit EquationSolver
    end

Inheritance

Object  →  ManagedIterativeAlgorithm<Double, Double, SolutionReport<Double, Double>>  →  ManagedIterativeAlgorithm<Double>  →  IterativeAlgorithm  →  EquationSolver  →  NewtonRaphsonSolver

The Newton-Raphson algorithm starts from a single starting value. It then uses the derivative of the target function to find successive approximations of the root.

NewtonRaphsonSolver inherits from EquationSolver, which in turn inherits from IterativeAlgorithm. 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 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