enum
GSL::MultiMin::AlgorithmF
Defined in:
gsl/maths/optimization/multimin.crEnum Members
-
NMSimplex =
0 -
This method use the Simplex algorithm of Nelder and Mead.
-
NMSimplex2 =
1 -
This method the same underlying algorithm, but the simplex updates are computed more efficiently for high-dimensional problems.
-
NMSimplex2Rand =
2 -
This method is a variant of NMSimplex2 which initialises the simplex around the starting point x using a randomly-oriented set of basis vectors instead of the fixed coordinate axes
Instance Method Summary
-
#nm_simplex2?
Returns
trueif this enum value equalsNMSimplex2 -
#nm_simplex2_rand?
Returns
trueif this enum value equalsNMSimplex2Rand -
#nm_simplex?
Returns
trueif this enum value equalsNMSimplex -
#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"