CodeCogs
HomeForumsCart
Login



Forgotten Password?

Or login with:

  • Facebookhttp://facebook.com/
  • Googlehttps://www.google.com/accounts/o8/id
  • Yahoohttps://me.yahoo.com
Maths

Rootfinding

Bernoulli

Calculates the zeros of a polynomial using Bernoulli's algorithm.
std::vector<double> bernoulli (const std::vector<double> &polynomial)

Aitken

Calculates the zeros of a function using Aitken acceleration.
double aitken (double (*f)(double), double x0 = 0, double eps = 1E-10, int maxit = 1000, double c = -1)

Bisection

Calculates the zeros of a function using the bisection method.
double bisection (double (*f)(double), double x0 = -1E+7, double x1 = 1E+7, double eps = 1E-10)
Icon

Brent

Calculates the zeros of a function using Brent's method.
double brent (double (*f)(double), double x1 = -1E+7, double x2 = 1E+7, double eps = 1E-10, int maxit = 1000)

Falseposition

Calculates the zeros of a function using the Regula-Falsi method.
double falseposition (double (*f)(double), double x0 = -1E+7, double x1 = 1E+7, double eps = 1E-10, double maxit = 1000)
Icon

Muller

Calculates the zeros of a function using Muller's method.
double muller (double (*f)(double), double x0 = 0, double d = 3, double eps = 1E-10, int maxit = 1000)

Newton

Calculates the zeros of a function using Newton's method.
double newton (double (*f)(double), double (*df)(double), double x = 0, double eps = 1E-10, int maxit = 1000)
Icon

Secant

Calculates the zeros of a function using the secant method.
double secant (double (*f)(double), double x0 = -1E+7, double x1 = 1E+7, double eps = 1E-10, int maxit = 1000)
Icon