Python runs in your browser. Heavy or infinite loops may freeze your browser tab. Use "Stop" if needed; for heavy jobs, run locally.

Program 1

Simpson’s 1/3rd Rule

Integration by Simpson method

Output 1

Program 2

Simpson’s 1/3rd Rule

Integration by Simpson method

Output 2

Program 3

Simpson’s 1/3rd Rule

Integration by Simpson method

import numpy as np

def simpsons_1_3_rule(f, a, b, n):
    """
    Approximate the integral of a function using Simpson's 1/3 rule.

Parameters:
    f : function
        The function to integrate.
    a : float
        The lower bound of the integration interval.
    b : float
        The upper bound of the integration interval.
    n : int
        The number of subintervals to use (must be even).

Returns:
    float
        The approximate value of the integral.
    """
    # Ensure the number of subintervals is even
    if n % 2 != 0:
        raise ValueError("Number of subintervals must be even.")
    
    # Calculate the width of each subinterval
    h = (b - a) / n
    
    # Evaluate the function at the endpoints
    integral = f(a) + f(b)
    
    # Sum the function values at the odd and even indices
    for i in range(1, n, 2):
        integral += 4 * f(a + i * h)
    for i in range(2, n, 2):
        integral += 2 * f(a + i * h)
    
    # Multiply by the width of each subinterval and divide by 3
    integral *= h / 3.0
    
    return integral

def f(x):
    return np.sin(x)  # Example function: sine of x
    
    # Define the integration bounds and number of subintervals
a = 0          # Lower bound
b = np.pi      # Upper bound
n = 10         # Number of subintervals (must be even)
    
    # Calculate the integral
result = simpsons_1_3_rule(f, a, b, n)
print(f"Approximate integral: {result:.6f}")

Output 3

Numerical Integration

Simpson’s 1/3rd Rule

Simpson’s 1/3rd Rule

Simpson’s 1/3rd Rule