Root finding (root, brentq) in SciPy - Time & Space Complexity

Time Complexity: Root finding (root, brentq)

O(log(1/ε))

Understanding Time Complexity

When we use scipy's root finding methods like root or brentq, we want to know how long it takes to find the solution as the problem changes.

We ask: How does the time needed grow when the function or input changes?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

import numpy as np
from scipy.optimize import brentq

def f(x):
    return x**3 - x - 2

root = brentq(f, 1, 2, xtol=1e-6)
print(root)
    

This code finds a root of the function f between 1 and 2 using the brentq method.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Evaluating the function f multiple times to narrow down the root.
• How many times: The method repeats function evaluations until the answer is precise enough.

How Execution Grows With Input

The number of function checks grows as we ask for more precision, but not directly with input size.

Input Size (n)	Approx. Operations
10	About 20-30 function calls
100	About 20-30 function calls
1000	About 20-30 function calls

Pattern observation: The number of steps grows slowly and depends mostly on the precision, not the input size.

Final Time Complexity

Time Complexity: O(log(1/ε))

This means the time grows roughly with how many decimal places of accuracy we want, not the size of the input range.

Common Mistake

[X] Wrong: "The time to find the root grows directly with the size of the input interval."

[OK] Correct: The method focuses on precision, so it splits the interval repeatedly, making time depend on how close we want to get, not the interval length itself.

Interview Connect

Understanding how root finding methods scale helps you explain algorithm efficiency clearly and shows you can think about precision and input size separately.

Self-Check

What if we changed the precision parameter xtol to a much smaller value? How would the time complexity change?

Practice

1. What is the main purpose of the scipy.optimize.root function in root finding?

easy

A. To calculate the maximum value of a function

B. To integrate a function over an interval

C. To find where a function equals zero using an initial guess

D. To sort an array of numbers

Solution

1. Step 1: Understand the purpose of root finding

   Root finding means locating points where a function's value is zero.

2. Step 2: Identify what scipy.optimize.root does

   This function finds roots starting from an initial guess, aiming to solve f(x) = 0.

3. Final Answer:

   To find where a function equals zero using an initial guess -> Option C

4. Quick Check:

   Root finding = find zero points [OK]

Hint: Root means function value zero, root() finds it from guess [OK]

Common Mistakes:

• Confusing root finding with integration
• Thinking root finds maxima or minima
• Assuming root sorts data

2. Which of the following is the correct way to import the brentq function from scipy.optimize?

easy

A. from scipy.optimize import brentq

B. import brentq from scipy.optimize

C. from scipy import brentq

D. import scipy.optimize.brentq

Solution

1. Step 1: Recall Python import syntax for functions

   To import a function from a module, use: from module import function.

2. Step 2: Apply to brentq from scipy.optimize

   The correct syntax is: from scipy.optimize import brentq.

3. Final Answer:

   from scipy.optimize import brentq -> Option A

4. Quick Check:

   Correct import syntax = from module import function [OK]

Hint: Use 'from module import function' to import specific functions [OK]

Common Mistakes:

• Using 'import function from module' which is invalid
• Trying to import directly from scipy without optimize
• Using dot notation in import statement incorrectly

3. What will be the output of this code snippet?

from scipy.optimize import brentq

def f(x):
    return x**3 - 2*x - 5

root = brentq(f, 2, 3)
print(round(root, 3))

medium

A. 2.095

B. 2.0946

C. 2.0945

D. 2.0946 (rounded to 4 decimals)

Solution

1. Step 1: Understand the function and interval

   The function is f(x) = x³ - 2x - 5. We look for root between 2 and 3.

2. Step 2: Use brentq to find root and round output

   Using brentq finds root near 2.0945514815. Rounded to 3 decimals is 2.095.

3. Step 3: Check rounding precision in options

   Options B (2.0946), C (2.0945), D (notes 4 decimals) are near unrounded root, but print(round(root,3)) outputs 2.095.

4. Final Answer:

   2.095 -> Option A

5. Quick Check:

   Root near 2.095 rounded 3 decimals = 2.095 [OK]

Hint: brentq finds root in interval; round final answer carefully [OK]

Common Mistakes:

• Confusing rounding digits
• Using wrong interval causing error
• Misunderstanding brentq output as exact integer

4. Identify the error in this code snippet and choose the correct fix:

from scipy.optimize import brentq

def g(x):
    return x**2 - 4

root = brentq(g, 3, 5)
print(root)

medium

A. No error; code runs fine

B. Interval must include a sign change; use brentq(g, 1, 3)

C. Function g(x) is incorrect; change to g(x) = x**2 + 4

D. Import statement is wrong; use import brentq from scipy.optimize

Solution

1. Step 1: Check function values at interval ends

   g(3) = 9 - 4 = 5 (positive), g(5) = 25 - 4 = 21 (positive). No sign change.

2. Step 2: Understand brentq requires sign change

   brentq needs f(a) and f(b) to have opposite signs to find root.

3. Step 3: Fix interval to include root

   Use interval (1, 3) because g(1) = -3 (negative), g(3) = 5 (positive), sign change exists.

4. Final Answer:

   Interval must include a sign change; use brentq(g, 1, 3) -> Option B

5. Quick Check:

   brentq needs sign change in interval [OK]

Hint: Check function signs at interval ends before brentq [OK]

Common Mistakes:

• Ignoring sign change requirement
• Changing function unnecessarily
• Incorrect import syntax

5. You want to find the root of h(x) = cos(x) - x using scipy.optimize.root. Which initial guess is most appropriate and why?

from scipy.optimize import root
import numpy as np

def h(x):
    return np.cos(x) - x

sol = root(h, ?)
print(sol.x)

hard

A. -1, because negative guesses always work better

B. 2, because cos(2) is near zero

C. 5, because root is always positive and large

D. 0.5, because root is near where cos(x) crosses x close to 0.5

Solution

1. Step 1: Understand the function behavior

   h(x) = cos(x) - x crosses zero near 0.7 (between 0 and 1).

2. Step 2: Choose initial guess close to root

   Initial guess 0.5 is close to root, helping root() converge quickly.

3. Step 3: Evaluate other options

   2 and 5 are far from root; -1 is negative and root is positive, so less suitable.

4. Final Answer:

   0.5, because root is near where cos(x) crosses x close to 0.5 -> Option D

5. Quick Check:

   Good initial guess near root speeds root() convergence [OK]

Hint: Pick initial guess near expected root for root() [OK]

Common Mistakes:

• Choosing initial guess far from root
• Assuming root is always positive and large
• Believing negative guesses always work better