AccelDerivBracketing Constructor | Initializes a new instance of the AccelDerivBracketing class. |
bracketBidir (inherited from BracketingAlgorithm) | The method for bidirectional bracketing. That is, given a starting point, it finds an interval containing an extermum which must be a minimum, but can be greater or less than x. * |
bracketUnidir (inherited from BracketingAlgorithm) | The method for unidirectional bracketing. That is, given a starting point, it finds an interval containing an extermum which may be of any kind (minimum or maximum), but must be greater than x. |
Equals (inherited from Object) | Determines whether the specified Object is equal to the current Object. |
GetHashCode (inherited from Object) | Serves as a hash function for a particular type, suitable for use in hashing algorithms and data structures like a hash table. |
GetType (inherited from Object) | Gets the Type of the current instance. |
ToString (inherited from Object) | Returns a String that represents the current Object. |
Finalize (inherited from Object) | Allows an Object to attempt to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection. |
MemberwiseClone (inherited from Object) | Creates a shallow copy of the current Object. |
extend | Expands the bracketing interval until it surely contains at least one extremum of the given type.
Obs.: the extreme type must be consistent with the bracket supplied i.e. if extreme_type is 1,
(we search for a minimum) `b' must be less than or equal to `a' (unlike in {@link AccelBracketing}
and in {@link ParabolicBracketing} equality is permitted).
If extreme_type is -1, a must be less than or equal to `b'. This is guaranteed if the bracket
is set by the corresponding find_initial method.
*
|
find_initial |
AccelDerivBracketing Class | WebCab.COM.Math.Optimization.UniDimensional Namespace | | |