com.webcab.ejb.math.optimization.unidimensional
Class Bracket
java.lang.Object
|
+--com.webcab.ejb.math.optimization.unidimensional.Bracket
- public class Bracket
- extends Object
A simple structure containing all data necessary for a locate algorithm.
A bracket is an interval which certainly contains an extremum.
If you have a general continuous function you need three points for a braket.
These points are kept in fields a, b and c of
the class. The value of the function is kept in fields voldg, oldg
and g. If the function is differentiable and has a continuous derivative
then two points are enough to bracket. The bracketing algorithm must comply with
the following rules with regard to the bracket class it generates:
a <= b <= c
f(a) = voldg
f(b) = oldg
f(c) = g
The bracketing algorithm must also guarantee that at least one local extremum exists
between points a and c. If these conditions are met, a correct locate algoritm should
be able to find the extremum using the bracket class as input.
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Bracket
public Bracket()