enum GSL::MultiRoot::AlgorithmF

Defined in:

gsl/maths/optimization/multiroot.cr

Enum Members

HybridScaled = 0

This is a version of the Hybrid algorithm which replaces calls to the Jacobian function by its finite difference approximation.

Hybrid = 1

This is a finite difference version of the Hybrid algorithm without internal scaling.

DiscreteNewton = 2

The discrete Newton algorithm is the simplest method of solving a multidimensional system. The algorithm may become unstable if the finite differences are not a good approximation to the true derivatives.

Broyden = 3

The Broyden algorithm is a version of the discrete Newton algorithm which attempts to avoids the expensive update of the Jacobian matrix on each iteration. This algorithm is included only for demonstration purposes, and is not recommended for serious use.

Instance Method Summary

Instance Method Detail

def broyden? #

Returns true if this enum value equals Broyden


[View source]
def discrete_newton? #

Returns true if this enum value equals DiscreteNewton


[View source]
def hybrid? #

Returns true if this enum value equals Hybrid


[View source]
def hybrid_scaled? #

Returns true if this enum value equals HybridScaled


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