Root finding algorithms

Implementation of main numerical methods for solving non-linear equations f(x)=0. In English and French with examples.

1. Bisection method
2. Secant method
3. Newton's method
4. Fixed point method

Try launching the notebooks directly in your browser using Github's Codespaces!

References

• G.E. Karniadakis and R.M. Kirby, “Parallel Scientific Computing in C++ and MPI”, Cambridge University Press, March 2003.

• https://en.wikipedia.org/wiki/Root-finding_algorithm