Namularbre/tp_ana_num
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix: Correct dichotimie

Browse Source
This commit is contained in:
Namu
2025-10-19 21:56:29 +02:00
parent c0efe005b9
commit 0c537f6667
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
ex5.py
View File

@@ -4,22 +4,22 @@ import numpy as np
new_raph_steps = [] new_raph_steps = []
dich_steps = [] dich_steps = []
def f(x) -> float: def f(x) -> float:
return np.exp(x) - 2 * np.cos(x) return np.exp(x) - 2 * np.cos(x)
def dichotomie(a, b, epsilon=1e-6, n=0) -> float: def dichotomie(a, b, epsilon=1e-6, n=0) -> float:
x = (a + b) / 2 x = (a + b) / 2
alpha = f(a) * f(x)
delta = f(a) * f(x)
dich_steps.append(x) # si on veut afficher les étapes dich_steps.append(x) # si on veut afficher les étapes
if np.abs(b - a) <= epsilon: if np.abs(b - a) <= epsilon:
return x return x
if delta < 0: if alpha < 0:
return dichotomie(a, x, epsilon, n+1) return dichotomie(a, x, epsilon, n+1)
elif delta == 0: elif alpha == 0:
return x return x
else: else:
return dichotomie(x, b, epsilon, n+1) return dichotomie(x, b, epsilon, n+1)
@@ -46,13 +46,13 @@ def newton_raphson(x_0, epsilon, max_iter=1_000) -> float | None:
if np.abs(fx) < epsilon: if np.abs(fx) < epsilon:
return x return x
elif fpx == 0: elif fpx == 0:
return None raise RuntimeError("Dérivée nulle : échec de Newton-Raphson.")
x = x - (fx / fpx) x = x - (fx / fpx)
new_raph_steps.append(x) new_raph_steps.append(x)
if np.abs(x - x_prev) < epsilon: if np.abs(x - x_prev) < epsilon:
return x return x
return None raise RuntimeError(f"Newton-Raphson n'a pas convergé en {max_iter} itérations.")
def ex1() -> None: def ex1() -> None: