open Gsl
open Fun

let _ = 
  Error.init ()

let f a b ~x ~f:y =
  let x0 = x.{0} in
  let x1 = x.{1} in
  y.{0} <- a *. (1. -. x0) ;
  y.{1} <- b *. (x1 -. x0 *. x0)

let df a b ~x ~j =
  let x0 = x.{0} in
  j.{0,0} <- ~-. a ;
  j.{0,1} <- 0. ;
  j.{1,0} <- -2. *. b *. x0 ;
  j.{1,1} <- b

let fdf a b ~x ~f:y ~j =
   f a b ~x ~f:y ;
  df a b ~x ~j

let print_state n = 
  let x = Vector.create n in
  let f = Vector.create n in
  fun iter solv ->
    Multiroot.NoDeriv.get_state solv ~x ~f () ;
    Printf.printf 
      "iter = %3u x = %+.3f %+.3f f(x) = %+.3e %+.3e\n"
      iter x.{0} x.{1} f.{0} f.{1} ;
    flush stdout

let epsabs = 1e-7
let maxiter = 1000

let solve kind n gf x_init =
  let solv = Multiroot.NoDeriv.make kind n gf 
      (Vector.of_array x_init) in
  Printf.printf "solver: %s\n" (Multiroot.NoDeriv.name solv) ;
  let print_state = print_state n in
  print_state 0 solv ;
  let rec proc iter = 
    Multiroot.NoDeriv.iterate solv ;
    print_state iter solv ;
    let status = Multiroot.NoDeriv.test_residual solv ~epsabs in
    match status with
    | true ->
	Printf.printf "status = converged\n"
    | false when iter >= maxiter ->
	Printf.printf "status = too many iterations\n"
    | false ->
	proc (succ iter)
  in
  proc 1

open Multiroot.NoDeriv

let _ = 
  List.iter 
    (fun kind ->
      solve kind 2 (f 1. 10.) [| -10.; -5. |] ;
      print_newline ())
    [ HYBRIDS ;
      HYBRID ;
      DNEWTON ;
      BROYDEN ; ]

let print_state_deriv n = 
  let x = Vector.create n in
  let f = Vector.create n in
  fun iter solv ->
    Multiroot.Deriv.get_state solv ~x ~f () ;
    Printf.printf 
      "iter = %3u x = %+.3f %+.3f f(x) = %+.3e %+.3e\n"
      iter x.{0} x.{1} f.{0} f.{1} ;
    flush stdout

let solve_deriv kind n gf x_init =
  let solv = Multiroot.Deriv.make kind n gf 
      (Vector.of_array x_init) in
  Printf.printf "solver: %s\n" (Multiroot.Deriv.name solv) ;
  let print_state = print_state_deriv n in
  print_state 0 solv ;
  let rec proc iter = 
    Multiroot.Deriv.iterate solv ;
    print_state iter solv ;
    let status = Multiroot.Deriv.test_residual solv ~epsabs in
    match status with
    | true ->
	Printf.printf "status = converged\n"
    | false when iter >= maxiter ->
	Printf.printf "status = too many iterations\n"
    | false ->
	proc (succ iter)
  in
  proc 1

open Multiroot.Deriv

let _ = 
  let gf = {
    multi_f = f 1. 10. ;
    multi_df = df 1. 10. ;
    multi_fdf = fdf 1. 10. ; } in
  List.iter 
    (fun kind ->
      solve_deriv kind 2 gf [| -10.; -5. |] ;
      print_newline ())
    [ HYBRIDSJ ;
      HYBRIDJ ;
      NEWTON ;
      GNEWTON ; ]



open Gsl
open Fun

let _ = 
  Error.init ()

let f a b ~x ~f:y =
  let x0 = x.{0} in
  let x1 = x.{1} in
  y.{0} <- a *. (1. -. x0) ;
  y.{1} <- b *. (x1 -. x0 *. x0)

let df a b ~x ~j =
  let x0 = x.{0} in
  j.{0,0} <- ~-. a ;
  j.{0,1} <- 0. ;
  j.{1,0} <- -2. *. b *. x0 ;
  j.{1,1} <- b

let fdf a b ~x ~f:y ~j =
   f a b ~x ~f:y ;
  df a b ~x ~j

let print_state n = 
  let x = Vector.create n in
  let f = Vector.create n in
  fun iter solv ->
    Multiroot.NoDeriv.get_state solv ~x ~f () ;
    Printf.printf 
      "iter = %3u x = %+.3f %+.3f f(x) = %+.3e %+.3e\n"
      iter x.{0} x.{1} f.{0} f.{1} ;
    flush stdout

let epsabs = 1e-7
let maxiter = 1000

let solve kind n gf x_init =
  let solv = Multiroot.NoDeriv.make kind n gf 
      (Vector.of_array x_init) in
  Printf.printf "solver: %s\n" (Multiroot.NoDeriv.name solv) ;
  let print_state = print_state n in
  print_state 0 solv ;
  let rec proc iter = 
    Multiroot.NoDeriv.iterate solv ;
    print_state iter solv ;
    let status = Multiroot.NoDeriv.test_residual solv ~epsabs in
    match status with
    | true ->
	Printf.printf "status = converged\n"
    | false when iter >= maxiter ->
	Printf.printf "status = too many iterations\n"
    | false ->
	proc (succ iter)
  in
  proc 1

open Multiroot.NoDeriv

let _ = 
  List.iter 
    (fun kind ->
      solve kind 2 (f 1. 10.) [| -10.; -5. |] ;
      print_newline ())
    [ HYBRIDS ;
      HYBRID ;
      DNEWTON ;
      BROYDEN ; ]

let print_state_deriv n = 
  let x = Vector.create n in
  let f = Vector.create n in
  fun iter solv ->
    Multiroot.Deriv.get_state solv ~x ~f () ;
    Printf.printf 
      "iter = %3u x = %+.3f %+.3f f(x) = %+.3e %+.3e\n"
      iter x.{0} x.{1} f.{0} f.{1} ;
    flush stdout

let solve_deriv kind n gf x_init =
  let solv = Multiroot.Deriv.make kind n gf 
      (Vector.of_array x_init) in
  Printf.printf "solver: %s\n" (Multiroot.Deriv.name solv) ;
  let print_state = print_state_deriv n in
  print_state 0 solv ;
  let rec proc iter = 
    Multiroot.Deriv.iterate solv ;
    print_state iter solv ;
    let status = Multiroot.Deriv.test_residual solv ~epsabs in
    match status with
    | true ->
	Printf.printf "status = converged\n"
    | false when iter >= maxiter ->
	Printf.printf "status = too many iterations\n"
    | false ->
	proc (succ iter)
  in
  proc 1

open Multiroot.Deriv

let _ = 
  let gf = {
    multi_f = f 1. 10. ;
    multi_df = df 1. 10. ;
    multi_fdf = fdf 1. 10. ; } in
  List.iter 
    (fun kind ->
      solve_deriv kind 2 gf [| -10.; -5. |] ;
      print_newline ())
    [ HYBRIDSJ ;
      HYBRIDJ ;
      NEWTON ;
      GNEWTON ; ]


