enum GSL::Min::Type

Overview

Minimization algorithm

Defined in:

gsl/maths/optimization/min.cr

Enum Members

GoldenSection = 0

The golden section algorithm is the simplest method of bracketing the minimum of a function. It is the slowest algorithm provided by the library, with linear convergence.

Brent = 1

The Brent minimization algorithm combines a parabolic interpolation with the golden section algorithm. This produces a fast algorithm which is still robust.

QuadGolden = 2

This is a variant of Brent’s algorithm which uses the safeguarded step-length algorithm of Gill and Murray.

Instance Method Summary

Instance Method Detail

def brent? #

[View source]
def golden_section? #

[View source]
def quad_golden? #

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