enum GSL::Roots::TypeBracketing

Defined in:

gsl/maths/optimization/roots.cr

Enum Members

Bisection = 0

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

FalsePosition = 1

The false position algorithm is a method of finding roots based on linear interpolation. Its convergence is linear, but it is usually faster than bisection.

BrentDekker = 2

The Brent-Dekker method combines an interpolation strategy with the bisection algorithm. This produces a fast algorithm which is still robust.

Instance Method Summary

Instance Method Detail

def bisection? #

[View source]
def brent_dekker? #

[View source]
def false_position? #

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