timdietereberhardt / numerical_mathematics

Bisection method, fixed point iterations, Euler and Runge-Kutta

numerical_mathematics

Bisection method, fixed point iterations, Euler and Runge-Kutta

Tests

Bisection Method

Solve: x + ln(x+5) - 1 = 0 with termination condition: b_k - a_k < 10⁻3

Fixed Point Iteration

Solve: x + ln(x+5) - 1 = 0 with accuracy = |x_k-x_(k-1)| < 10⁻8

Euler and Runge_kutta

Initial Value Problem with: P'(t) = P(t) - 0.1 * (P(t))², P(0)=1 Interval t = [0, 10] Increment h = 0.2