enum GSL::MultiMin::AlgorithmFDF

Defined in:

gsl/maths/optimization/multimin.cr

Enum 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

Instance Method Detail

def bfgs2? #

Returns true if this enum value equals BFGS2


[View source]
def bfgs? #

Returns true if this enum value equals BFGS


[View source]
def conjugate_fr? #

Returns true if this enum value equals ConjugateFR


[View source]
def conjugate_pr? #

Returns true if this enum value equals ConjugatePR


[View source]
def steepest_descent? #

Returns true if this enum value equals SteepestDescent


[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]