enum GSL::MultiMin::AlgorithmF

Defined in:

gsl/maths/optimization/multimin.cr

Enum 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

Instance Method Detail

def nm_simplex2? #

Returns true if this enum value equals NMSimplex2


[View source]
def nm_simplex2_rand? #

Returns true if this enum value equals NMSimplex2Rand


[View source]
def nm_simplex? #

Returns true if this enum value equals NMSimplex


[View source]
def to_s #
Description copied from struct Enum

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"

[View source]
def to_unsafe #

[View source]