Sha256: 39a7376fcc00cf17f2bfc9e4c119f0f43c95316d16e2737f814cf7db1e6ae914

Contents?: true

Size: 966 Bytes

Versions: 6

Compression:

Stored size: 966 Bytes

Contents

#!/usr/bin/env ruby
require("gsl")
include Math

#solver = GSL::Root::FSolver.alloc(GSL::Root::FSolver::BISECTION)
#solver = GSL::Root::FSolver.alloc("falsepos")
#solver = GSL::Root::FSolver.alloc("brent")
solver = GSL::Root::FSolver.alloc(GSL::Root::FSolver::BRENT)
puts "using #{solver.name} method"

f = GSL::Function.alloc { |x, params|
  a = params[0]
  b = params[1]
  c = params[2]
  (a*x + b)*x + c
}

f.set_params(1, 0, -5)
expected = sqrt(5.0)

printf("%5s [%9s, %9s] %9s %10s %9s\n",
          "iter", "lower", "upper", "root",
          "err", "err(est)")

solver.set(f, 0.0, 5.0)
iter = 0
status = nil
while status != GSL::SUCCESS
  iter += 1
  status = solver.iterate
  r = solver.root
  xl = solver.x_lower
  xu = solver.x_upper
  status = solver.test_interval(0, 0.001)

  if status == GSL::SUCCESS
    printf("Converged:\n")
  end
  printf("%5d [%.7f, %.7f] %.7f %+.7f %.7f\n",
         iter, xl, xu, r, r - expected, xu - xl)
end

p f.fsolve(0, 5)

Version data entries

6 entries across 6 versions & 2 rubygems

Version Path
gsl-2.1.0.3 examples/roots/brent.rb
gsl-2.1.0.2 examples/roots/brent.rb
gsl-2.1.0.1 examples/roots/brent.rb
gsl-2.1.0 examples/roots/brent.rb
gsl-1.16.0.6 examples/roots/brent.rb
rb-gsl-1.16.0.5 examples/roots/brent.rb