1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52
| # 2a
def degre(L):
return len(L)-1
# 2b
def etape(L, M):
M = [0] + [2 * m for m in M]
len_M, len_L = len(M), len(L)
T = [
(M[i] if i < len_M else 0) + (L[i] if i < len_L else 0)
for i in range(max(len_M, len_L))
]
return T
# 2c
def tchebychev(n):
global T0
global T1
if n == 0:
return X0
elif n == 1:
return X1
else:
T_moins_2 = T0
T_moins_1 = T1
for _ in range(1, n):
T = etap(T_moins_1, T_moins_2)
T_moins_2 = T_moins_1
T_moins_1 = T
return T
# 2d
def evalue(P,x):
if P==[]:
return(0)
else:
b=P[len(P)-1]
P1=P[0:len(P)-1]
return(horner(P1,x)*x+b)
# 2e
def TraceTchebychev(n):
x = np.linspace (-10,10,100)
y = # Que mettre ici ?
plt.plot (x,y) |
Partager