enum
GSL::MultiMin::AlgorithmFDF
Defined in:
gsl/maths/optimization/multimin.crEnum Members
-
ConjugateFR =
0 -
This is the Fletcher-Reeves conjugate gradient algorithm.
-
ConjugatePR =
1 -
This is the Polak-Ribiere conjugate gradient algorithm.
-
BFGS =
2 -
This method use the vector Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm.
-
BFGS2 =
3 -
This method is the most efficient version available
-
SteepestDescent =
4 -
The steepest descent method is inefficient and is included only for demonstration purposes.
Instance Method Summary
-
#bfgs2?
Returns
trueif this enum value equalsBFGS2 -
#bfgs?
Returns
trueif this enum value equalsBFGS -
#conjugate_fr?
Returns
trueif this enum value equalsConjugateFR -
#conjugate_pr?
Returns
trueif this enum value equalsConjugatePR -
#steepest_descent?
Returns
trueif this enum value equalsSteepestDescent -
#to_s
Returns a
Stringrepresentation of this enum member. - #to_unsafe
Instance Method Detail
Returns a String representation of this enum member.
In the case of regular enums, this is just the name of the member.
In the case of flag enums, it's the names joined by vertical bars, or "None",
if the value is zero.
If an enum's value doesn't match a member's value, the raw value is returned as a string.
Color::Red.to_s # => "Red"
IOMode::None.to_s # => "None"
(IOMode::Read | IOMode::Write).to_s # => "Read | Write"
Color.new(10).to_s # => "10"