2019-07-10 20:09:24 +00:00
|
|
|
"""
|
2018-10-19 12:48:28 +00:00
|
|
|
Numerical integration or quadrature for a smooth function f with known values at x_i
|
|
|
|
|
2020-01-18 12:24:33 +00:00
|
|
|
This method is the classical approach of suming 'Equally Spaced Abscissas'
|
2018-10-19 12:48:28 +00:00
|
|
|
|
2019-07-10 20:09:24 +00:00
|
|
|
method 1:
|
2018-10-19 12:48:28 +00:00
|
|
|
"extended trapezoidal rule"
|
2024-12-28 10:03:24 +00:00
|
|
|
int(f) = dx/2 * (f1 + 2f2 + ... + fn)
|
2018-10-19 12:48:28 +00:00
|
|
|
|
2019-07-10 20:09:24 +00:00
|
|
|
"""
|
2019-10-05 05:14:13 +00:00
|
|
|
|
|
|
|
|
2018-10-19 12:48:28 +00:00
|
|
|
def method_1(boundary, steps):
|
2024-12-28 10:03:24 +00:00
|
|
|
"""
|
|
|
|
Apply the extended trapezoidal rule to approximate the integral of function f(x)
|
|
|
|
over the interval defined by 'boundary' with the number of 'steps'.
|
|
|
|
|
|
|
|
Args:
|
|
|
|
boundary (list of floats): A list containing the start and end values [a, b].
|
|
|
|
steps (int): The number of steps or subintervals.
|
|
|
|
Returns:
|
|
|
|
float: Approximation of the integral of f(x) over [a, b].
|
|
|
|
Examples:
|
|
|
|
>>> method_1([0, 1], 10)
|
|
|
|
0.3349999999999999
|
|
|
|
"""
|
2019-10-05 05:14:13 +00:00
|
|
|
h = (boundary[1] - boundary[0]) / steps
|
|
|
|
a = boundary[0]
|
|
|
|
b = boundary[1]
|
|
|
|
x_i = make_points(a, b, h)
|
|
|
|
y = 0.0
|
|
|
|
y += (h / 2.0) * f(a)
|
|
|
|
for i in x_i:
|
|
|
|
# print(i)
|
|
|
|
y += h * f(i)
|
|
|
|
y += (h / 2.0) * f(b)
|
|
|
|
return y
|
|
|
|
|
|
|
|
|
|
|
|
def make_points(a, b, h):
|
2024-12-28 10:03:24 +00:00
|
|
|
"""
|
|
|
|
Generates points between 'a' and 'b' with step size 'h', excluding the end points.
|
|
|
|
Args:
|
|
|
|
a (float): Start value
|
|
|
|
b (float): End value
|
|
|
|
h (float): Step size
|
|
|
|
Examples:
|
|
|
|
>>> list(make_points(0, 10, 2.5))
|
|
|
|
[2.5, 5.0, 7.5]
|
|
|
|
|
|
|
|
>>> list(make_points(0, 10, 2))
|
|
|
|
[2, 4, 6, 8]
|
|
|
|
|
|
|
|
>>> list(make_points(1, 21, 5))
|
|
|
|
[6, 11, 16]
|
|
|
|
|
|
|
|
>>> list(make_points(1, 5, 2))
|
|
|
|
[3]
|
|
|
|
|
|
|
|
>>> list(make_points(1, 4, 3))
|
|
|
|
[]
|
|
|
|
"""
|
2019-10-05 05:14:13 +00:00
|
|
|
x = a + h
|
2024-12-28 10:03:24 +00:00
|
|
|
while x <= (b - h):
|
2019-10-05 05:14:13 +00:00
|
|
|
yield x
|
|
|
|
x = x + h
|
|
|
|
|
|
|
|
|
|
|
|
def f(x): # enter your function here
|
2024-12-28 10:03:24 +00:00
|
|
|
"""
|
|
|
|
Example:
|
|
|
|
>>> f(2)
|
|
|
|
4
|
|
|
|
"""
|
2019-10-05 05:14:13 +00:00
|
|
|
y = (x - 0) * (x - 0)
|
|
|
|
return y
|
|
|
|
|
2018-10-19 12:48:28 +00:00
|
|
|
|
|
|
|
def main():
|
2019-10-05 05:14:13 +00:00
|
|
|
a = 0.0 # Lower bound of integration
|
|
|
|
b = 1.0 # Upper bound of integration
|
|
|
|
steps = 10.0 # define number of steps or resolution
|
|
|
|
boundary = [a, b] # define boundary of integration
|
|
|
|
y = method_1(boundary, steps)
|
2019-12-07 05:39:59 +00:00
|
|
|
print(f"y = {y}")
|
2019-10-05 05:14:13 +00:00
|
|
|
|
|
|
|
|
|
|
|
if __name__ == "__main__":
|
2024-12-28 10:03:24 +00:00
|
|
|
import doctest
|
|
|
|
|
|
|
|
doctest.testmod()
|
2019-10-05 05:14:13 +00:00
|
|
|
main()
|