-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain-3.py
More file actions
72 lines (64 loc) · 1.84 KB
/
main-3.py
File metadata and controls
72 lines (64 loc) · 1.84 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
import math
def fibonacci(n):
return int((((1 + math.sqrt(5)) / 2) ** n - ((1 - math.sqrt(5)) / 2) ** n) / math.sqrt(5))
def fibonacci_method(f, a, b, x, gradient, eps=1e-4, i = 0):
x1_temp = [0, 0]
x2_temp = [0, 0]
while (a + b) / eps >= fibonacci(i):
i += 1
i -= 1
fib0 = fibonacci(i - 2)
fib1 = fibonacci(i - 1)
fib2 = fibonacci(i - 3)
x1 = 0
x2 = 0
while (b - a) > eps:
x1 = a + fib0 / fib2 * (b - a)
x2 = a + fib1 / fib2 * (b - a)
for i in range(len(x)):
x1_temp[i] = x[i] - x1*gradient[i]
x2_temp[i] = x[i] - x2*gradient[i]
if (f(x1_temp) < f(x2_temp)):
b = x2
elif f(x1) > f(x2):
a = x1
else:
a = x1
b = x2
return (x1 + x2) / 2.0
def dichotomy_method(f, a, b, x, gradient, eps=1e-4):
x1_temp = x2_temp = x
sigma = eps / 2.0
mid = (b + a) / 2.0
while abs(b - a) > eps:
x1 = mid - sigma
x2 = mid + sigma
for i in range(len(x)):
x1_temp[i] = x[i] - x1 * gradient[i]
x2_temp[i] = x[i] - x2 * gradient[i]
if f(x1_temp) < f(x2_temp):
b = x1
elif f(x1_temp) > f(x2_temp):
a = x2
else:
a = x1
b = x2
mid = (b + a) / 2.0
return mid
def golden_section_method(f, a, b, x, gradient, eps=1e-4):
x1_temp = [0, 0]
x2_temp = [0, 0]
while abs(b - a) > eps:
x1 = a + 0.381966011 * (b - a)
x2 = a + 0.618003399 * (b - a)
for i in range(len(x)):
x1_temp[i] = x[i] - x1 * gradient[i]
x2_temp[i] = x[i] - x2 * gradient[i]
if f(x1_temp) < f(x2_temp):
b = x1
elif f(x1_temp) > f(x2_temp):
a = x2
else:
a = x1
b = x2
return (a + b) / 2.0