-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathintegration.py
More file actions
258 lines (190 loc) · 5.77 KB
/
integration.py
File metadata and controls
258 lines (190 loc) · 5.77 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
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
# -*- coding: utf-8 -*-
"""
Created on Wed May 22 14:29:31 2019
@author: Ben
"""
# ToC:
# mc_dots(lower_left, x_length, y_length, function, n)
# mc_rectangle(x_start, x_end, n ,y_func)
# riemann_left(x_start, x_end, n, y_func)
# riemann_right(x_start, x_end, n, y_func)
# riemann_middle(x_start, x_end, n, y_func)
# simpson(x_start, x_end, n, y_func)
# trapezoid(x_start, x_end, n, y_func)
# polar_wedges(theta_start, theta_end, n, r_func)
# box_muller(n, mu, sigma_sq)
# lcg(n, m, a, c)
# sig_figs(num, n)
# dec_figs(num, n)
import numpy as np
import random as rand
# integration methods - maybe I can combine these into one function?
def mc_dots(lower_left, x_length, y_length, function,n):
"""
lower_left: tuple - lower left point of box
x_length: float - x dimension of box, > 0
y_length: float - y dimension of box, > 0
function: function(x,y) - the value is < 0 when (x,y) is in the graph
n: int - number of poitns to generate
returns approx area
"""
area = 0
for i in range(n):
# gen random points
x_point = lower_left[0] + rand.random()*x_length
y_point = lower_left[1] + rand.random()*y_length
# check if points in graph
if function(x_point, y_point) <= 0:
area += 1
# divide in counts by total counts
area = area*(x_length*y_length)/n
return area
def mc_rectangles(x_start, x_end, n, y_func):
"""
x_start: float
x_end: float
n: int
y_func: function(x)
returns approx area
"""
area = 0
for i in range(n):
x_point = x_start + rand.random()*(x_end-x_start)
area += y_func(x_point)
area = (area/n)*abs(x_end-x_start)
return area
# non random integration approximations
def riemann_left(x_start, x_end, n, y_func):
"""
x_start: float
x_end: float
n: int
y_func: function(x)
returns approx area
"""
interval = (x_end - x_start)
sum = 0
for i in range(n):
sum += y_func(x_start + i*interval) * interval
return sum
def riemann_right(x_start, x_end, n, y_func):
"""
x_start: float
x_end: float
n: int
y_func: function(x)
returns approx area
"""
interval = (x_end-x_start)/n
sum = 0
for i in range(n):
sum += y_func(x_start + (i+1)*interval) * interval
return sum
def riemann_middle(x_start, x_end, n, y_func):
"""
x_start: float
x_end: float
n: int
y_func: function(x)
returns approx area
"""
interval = (x_end-x_start)/n
sum = 0
for i in range(n):
sum += y_func(x_start + (i+0.5)*interval) * interval
return sum
# newton-cotes integration methods
def simpson(x_start, x_end, n, y_func):
"""
x_start: float
x_end: float
n: int
y_func: function(x)
returns approx area
"""
interval = (x_end-x_start)/n
sum = 0
for i in range(n):
sum += (y_func(x_start + i*interval) + 4*y_func(x_start + (i+0.5)*interval) + y_func(x_start + (i+1)*interval )) * interval / 6
return sum
def trapezoid(x_start, x_end, n, y_func):
"""
x_start: float
x_end: float
n: int
y_func: function(x)
returns approx area
"""
interval = (x_end-x_start)/n
sum = 0
for i in range(n):
sum += ( y_func(x_start + i*interval) + y_func(x_start + (i+1)*interval)) / 2
return sum
def polar_wedges(theta_start, theta_end, n, r_func):
"""
theta_start: float
theta_end: float
n: int
r_func: function(theta)
"""
sum = 0
interval = (theta_end-theta_start)/n
for i in range(n):
sum += 1/2 * interval * r_func(theta_start + interval*(i+0.5))**2
return sum
# random number generation
def box_muller(n, mu, sigma_sq):
"""
n: int
mu: float - mean
sigma_sq: float - variance
returns list of n points distributed in ~N(mu, sigma_sq)
"""
lst = []
for i in range(int(n/2)):
x_1 = rand.random()
x_2 = rand.random()
z_1 = mu + sigma_sq**0.5 * (-2*np.log(x_1))**0.5 * np.sin(2*np.pi*x_2)
z_2 = mu + sigma_sq**0.5 * (-2*np.log(x_1))**0.5 * np.cos(2*np.pi*x_2)
lst.append(z_1)
lst.append(z_2)
if(n%2==1):
x_1 = rand.random()
x_2 = rand.random()
z_1 = mu + sigma_sq**0.5 * (-2*np.log(x_1))**0.5 * np.sin(2*np.pi*x_2)
# z_2 = mu + sigma_sq**0.5 * (-2*np.log(x_1))**0.5 * np.cos(2*np.pi*x_2)
lst.append(z_1)
# lst.append(z_2)
return lst
def lcg(n, m, a, c):
"""
n: int - number of values
m: int - the modulus
a: int - the multiplier
c: int - the increment
# values from Numerical Recipes:
# (100, 2**32, 1664525, 1013904223)
returns a list of n iteratively generated pseudorandom numbers
"""
# pseudorandomly generated seed
seed = rand.random()
rand_list = [seed] # initiate list
for i in range(n-1):
rand_list.append((a*rand_list[i] + c)%m)
# adjust values to be in range [0, 1)
for i in range(n-1):
rand_list[i] /= m
return rand_list
# rounding functions
def sig_figs(num, n):
"""
num: float
n: int
returns num with n sig figs
"""
def dec_figs(num, n):
"""
num: float
n: int
returns num with n decimals after point
"""