Function example_solution_bisection

main.py:59–92

Run an example 'Solutions: Bisection'.

()

@print_docstring
def example_solution_bisection():
    """Run an example 'Solutions: Bisection'."""
    # Bisection method (find roots of an equation)
    #   Pros:
    #       It is a reliable method with guaranteed convergence;
    #       It is a simple method that searches for the root by employing a
    #           binary search;
    #       There is no need to calculate the derivative of the function.
    #   Cons:
    #       Slow convergence;
    #       It is necessary to enter a search interval [a, b];
    #       The interval reported must have a signal exchange, f (a) * f (b)<0.

    def f(x):
        return 2 * x ** 3 - math.cos(x + 1) - 3

    a = -1.0
    b = 2.0
    toler = 0.01
    iter_max = 100

    print("Inputs:")
    print(f"a = {a}")
    print(f"b = {b}")
    print(f"toler = {toler}")
    print(f"iter_max = {iter_max}")

    print("Execution:")
    root, i, converged = solutions.bisection(f, a, b, toler, iter_max)

    print("Output:")
    print(f"root = {root:.5f}")
    print(f"i = {i}")
    print(f"converged = {converged}")


@print_docstring