pyrival.numerical¶
pyrival.numerical.berlekamp_massey¶
-
pyrival.numerical.berlekamp_massey.
berlekamp_massey
(s)¶
-
pyrival.numerical.berlekamp_massey.
linear_rec
(S, tr, k)¶
pyrival.numerical.hill_climbing¶
-
pyrival.numerical.hill_climbing.
hill_climbing
(func, x_0, y_0, cmp=<built-in function min>)¶
pyrival.numerical.integrate¶
-
pyrival.numerical.integrate.
fast_quad
(func, a, b, eps=1e-06)¶
-
pyrival.numerical.integrate.
quad
(func, a, b, n=1000)¶
-
pyrival.numerical.integrate.
rec
(func, a, b, eps, S)¶
-
pyrival.numerical.integrate.
simpson
(func, a, b)¶
pyrival.numerical.polynomial¶
-
pyrival.numerical.polynomial.
diff
(a)¶
-
pyrival.numerical.polynomial.
divroot
(a, x0)¶
-
pyrival.numerical.polynomial.
poly
(a, x)¶
pyrival.numerical.search¶
-
pyrival.numerical.search.
binary_search
(func, lo, hi, abs_prec=1e-07)¶ Locate the first value x s.t. func(x) = True within [lo, hi]
-
pyrival.numerical.search.
discrete_binary_search
(func, lo, hi)¶ Locate the first value x s.t. func(x) = True within [lo, hi]
-
pyrival.numerical.search.
discrete_ternary_search
(func, lo, hi)¶ Find the first maximum of unimodal function func() within [lo, hi]
-
pyrival.numerical.search.
fractional_binary_search
(func, lo=(0, 1), hi=(1, 0), limit=1000000)¶
-
pyrival.numerical.search.
golden_section_search
(a, b, func, abs_prec=1e-07)¶
-
pyrival.numerical.search.
ternary_search
(func, lo, hi, abs_prec=1e-07)¶ Find maximum of unimodal function func() within [lo, hi]