Public

<init>

Search for a zero inside the provided interval. This implementation is based on
the algorithm descri

brent

computeObjectiveValue

getAbsoluteAccuracy

getFunctionValueAccuracy

getMax

getMin

getRelativeAccuracy

getStartValue

verifySequence

solve

BrentSolver

Updating database using SQL prepared statement

An abstraction for a native pointer data type. A Pointer instance represents, on
the Java side, a na

com.sun.jna.Pointer

An exception that indicates a failed JDBC operation. It provides the following
information about pro

java.sql.SQLException

The BitSet class implements abit array [http://en.wikipedia.org/wiki/Bit_array].
Each element is eit

java.util.BitSet

A Map is a data structure consisting of a set of keys and values in which each
key is mapped to a si

java.util.Map

A map that has its keys ordered. The sorting is according to either the natural
ordering of its keys

java.util.SortedMap

 Stack is a Last-In/First-Out(LIFO) data structure which represents a stack of
objects. It enables u

java.util.Stack

scheduleAtFixedRate

findViewById

getSupportFragmentManager

// Return the initial guess if it is good enough.

// Return the first endpoint if it is good enough.

// Reduce interval if min and initial bracket the root.

// Return the second endpoint if it is good enough.

// Reduce interval if initial and max bracket the root.

/**
     * Search for a zero inside the provided interval.
     * This implementation is based on the algorithm described at page 58 of
     * the book
     * <blockquote>
     *  <b>Algorithms for Minimization Without Derivatives</b>,
     *  <it>Richard P. Brent</it>,
     *  Dover 0-486-41998-3
     * </blockquote>
     *
     * @param lo Lower bound of the search interval.
     * @param hi Higher bound of the search interval.
     * @param fLo Function value at the lower bound of the search interval.
     * @param fHi Function value at the higher bound of the search interval.
     * @return the value where the function is zero.
     */

// The equality test (a == c) is intentional,

// it is part of the original Brent's method and

// it should NOT be replaced by proximity test.

// Inverse quadratic interpolation gives a value

// in the wrong direction, or progress is slow.

/**
     * Search for a zero inside the provided interval.
     * This implementation is based on the algorithm described at page 58 of
     * the book
     * <blockquote>
     *  <b>Algorithms for Minimization Without Derivatives</b>,
     *  <it>Richard P. Brent</it>,
     *  Dover 0-486-41998-3
     * </blockquote>
     *
     * @param lo Lower bound of the search interval.
     * @param hi Higher bound of the search interval.
     * @param fLo Function value at the lower bound of the search interval.
     * @param fHi Function value at the higher bound of the search interval.
     * @return the value where the function is zero.
     */

How to use computeObjectiveValuemethodin org.apache.commons.math3.analysis.solvers.BrentSolver

Best Java code snippets using org.apache.commons.math3.analysis.solvers.BrentSolver.computeObjectiveValue (Showing top 6 results out of 315)

How to use
computeObjectiveValue
method
in
org.apache.commons.math3.analysis.solvers.BrentSolver