-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLista2.py
More file actions
224 lines (179 loc) · 5.64 KB
/
Lista2.py
File metadata and controls
224 lines (179 loc) · 5.64 KB
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
import math
import matplotlib.pyplot as plt
from prettytable import PrettyTable
from sympy import *
import numpy as np
x = symbols('x')
#Raízes de Equações
##Método da Bissecção
def plot2d(f, inicio, fim):
z = np.arange(inicio,fim,0.1)
y = []
for i in range(len(z)):
y.append(f.subs(x,z[i]))
fig, ax = plt.subplots()
ax.set(title='Gráfico função f(x)='+str(f))
ax.plot(z,y)
ax.grid()
plt.show()
def bisseccao(f, e, a, b):
fa = f.subs(x,a)
fb = f.subs(x,b)
if fa * fb >= 0:
print("Não atende ao critério f(a) * f(b) < 0")
return
k = 0
ak = []
bk = []
xk = []
fak = []
fbk = []
xk = []
fxk = []
xk_x = []
ak.append(a)
bk.append(b)
kf = math.log((b-a)/e,2)-1
times = math.ceil(kf) + 1
for k in range(times):
if k == 0:
y = ak[len(ak)-1]
fak.append(round(f.subs(x,y),9))
y = bk[len(bk)-1]
fbk.append(round(f.subs(x,y),9))
xk.append((ak[len(ak)-1] + bk[len(bk)-1])/2)
y = xk[len(xk)-1]
fxk.append(round(f.subs(x,y),9))
xk_x.append('-')
else:
if (fak[len(fak)-1] < 0 and fxk[len(fxk)-1] < 0) or (fak[len(fak)-1] > 0 and fxk[len(fxk)-1] > 0):
ak.append(xk[len(xk)-1])
bk.append(bk[len(bk)-1])
else:
ak.append(ak[len(ak)-1])
bk.append(xk[len(xk)-1])
y = ak[len(ak)-1]
fak.append(round(f.subs(x,y),9))
y = bk[len(bk)-1]
fbk.append(round(f.subs(x,y),9))
xk.append((ak[len(ak)-1] + bk[len(bk)-1])/2)
y = xk[len(xk)-1]
fxk.append(round(f.subs(x,y),9))
temp = xk[len(xk)-1] - xk[len(xk)-2]
if temp < 0:
temp = temp * -1
xk_x.append(temp)
Table = PrettyTable(["k", "a", "b", "f(a)", "f(b)", "x", "f(x)", "|x(k) - x(k-1)|"])
for k in range(times):
Table.add_row([k, ak[k], bk[k], fak[k], fbk[k], xk[k], fxk[k], xk_x[k]])
print(Table)
print("Donde \u03B5 é aproximadamente " + str(xk[len(xk)-1]))
# def f(x): return pow(x,2)-3
# plot2d(f(x), 0, 2)
# bisseccao(f(x), 0.01, 1, 2)
## Método do Ponto Fixo
def pontoFixo(f,e,xi):
xk = []
xk.append(xi)
xk_x = []
xk_x.append("-")
end_condition = 0
while not end_condition:
xk.append(f.subs(x,xk[len(xk)-1]))
xk_x.append(abs(xk[len(xk)-1]-xk[len(xk)-2]))
if xk_x[len(xk_x)-1] < e:
end_condition = 1
Table = PrettyTable(["k", "xk", "|x(k) - x(k-1)|"])
for k in range(0, len(xk)):
Table.add_row([k, xk[k], xk_x[k]])
print(Table)
print("Donde \u03B5 é aproximadamente " + str(xk[len(xk)-1]))
# def f(x): return cos(x)
# pontoFixo(f(x),10**(-2), math.pi/4)
## Método de Newton
def newton(f, e, a, b):
xk = []
xk.append(b)
xk_x = []
xk_x.append(0)
end_condition = 0
if f.subs(x,xk[len(xk)-1]) * diff(diff(f,x),x).subs(x,xk[len(xk)-1]) > 0:
while not end_condition:
func = f.subs(x,xk[len(xk)-1])
derivate = diff(f,x).subs(x,xk[len(xk)-1])
temp = xk[len(xk)-1] - func/derivate
xk.append(N(temp))
temp2 = xk[len(xk)-2] - xk[len(xk)-1]
if temp2 < 0:
temp2 = temp2 * -1
xk_x.append(N(temp2))
if xk_x[len(xk_x)-1] < e:
end_condition = 1
Table = PrettyTable(["k", "xk", "|x(k) - x(k-1)|"])
for k in range(1, len(xk)):
Table.add_row([k, xk[k], xk_x[k]])
print(Table)
print("Donde \u03B5 é aproximadamente " + str(xk[len(xk)-1]))
# def f(x): return x**2-2
# newton(f(x), 0.00005, 1, 2)
## Método da Secante
def secante(f, e, a, b):
xk = []
xk.append(a)
xk.append(b)
xk_x = []
xk_x.append(0)
xk_x.append(0)
end_condition = 0
while not end_condition:
temp = f.subs(x, xk[len(xk)-1]) * (xk[len(xk)-1] - xk[len(xk)-2])
temp2 = f.subs(x, xk[len(xk)-1]) - f.subs(x,xk[len(xk)-2])
temp3 = xk[len(xk)-1] - (temp/temp2)
xk.append(temp3)
temp4 = xk[len(xk)-1] - xk[len(xk)-2]
if temp4 < 0:
temp4 = temp4 * -1
xk_x.append(temp4)
if xk_x[len(xk_x)-1] < e:
end_condition = 1
Table = PrettyTable(["k", "xk", "|x(k+1) - x(k)|"])
for k in range(2, len(xk)):
Table.add_row([k, xk[k], xk_x[k]])
print(Table)
print("Donde \u03B5 é aproximadamente " + str(xk[len(xk)-1]))
print("Secante\n")
def f(x): return 2*x**3-5*x**2-10*x+20
secante(f(x), 10**(-5), 1.2, 1.7)
## Método Regula Falsi
def regulaFalsi(f, e, a, b):
xk = []
xk_x = []
x0 = a
x1 = b
print(f.subs(x,a))
print(f.subs(x,b))
end_condition = 0
while not end_condition:
temp = x1 - f.subs(x, x1) * (x1 - x0) / (f.subs(x, x1) - f.subs(x, x0))
temp2 = temp - x1
if temp2 < 0:
temp2 = temp2 * -1
if temp2 < e:
xk.append(temp)
xk_x.append(temp2)
end_condition = 1
continue
k = f.subs(x, temp)
if k*f.subs(x, x1) < 0:
x0 = x1
x1 = temp
xk.append(temp)
xk_x.append(temp2)
Table = PrettyTable(["k", "xk", "|x(k) - x(k-1)|"])
for k in range(len(xk)):
Table.add_row([k+2, xk[k], xk_x[k]])
print(Table)
print("Donde \u03B5 é aproximadamente " + str(xk[len(xk)-1]))
print("\nRegula Falsi\n")
def f(x): return 2*x**3-5*x**2-10*x+20
regulaFalsi(f(x), 0.0001, 1.2, 1.7)