public class NewtonRaphsonSolver extends AbstractUnivariateDifferentiableSolver
| Constructor and Description | 
|---|
| NewtonRaphsonSolver()Construct a solver. | 
| NewtonRaphsonSolver(double absoluteAccuracy)Construct a solver. | 
| Modifier and Type | Method and Description | 
|---|---|
| protected double | doSolve()Method for implementing actual optimization algorithms in derived
 classes. | 
| double | solve(int maxEval,
     UnivariateDifferentiableFunction f,
     double min,
     double max)Find a zero near the midpoint of  minandmax. | 
computeObjectiveValueAndDerivative, setupcomputeObjectiveValue, getAbsoluteAccuracy, getEvaluations, getFunctionValueAccuracy, getMax, getMaxEvaluations, getMin, getRelativeAccuracy, getStartValue, incrementEvaluationCount, isBracketing, isSequence, solve, solve, verifyBracketing, verifyInterval, verifySequenceclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitgetAbsoluteAccuracy, getEvaluations, getFunctionValueAccuracy, getMaxEvaluations, getRelativeAccuracy, solve, solvepublic NewtonRaphsonSolver()
public NewtonRaphsonSolver(double absoluteAccuracy)
absoluteAccuracy - Absolute accuracy.public double solve(int maxEval,
                    UnivariateDifferentiableFunction f,
                    double min,
                    double max)
             throws MathIllegalStateException
min and max.solve in interface BaseUnivariateSolver<UnivariateDifferentiableFunction>solve in class BaseAbstractUnivariateSolver<UnivariateDifferentiableFunction>f - Function to solve.min - Lower bound for the interval.max - Upper bound for the interval.maxEval - Maximum number of evaluations.MathIllegalStateException - if the maximum evaluation count is exceeded.MathIllegalArgumentException - if min >= max.protected double doSolve()
                  throws MathIllegalStateException
doSolve in class BaseAbstractUnivariateSolver<UnivariateDifferentiableFunction>MathIllegalStateException - if the maximal number of evaluations
 is exceeded.Copyright © 2016–2020 Hipparchus.org. All rights reserved.