Scribd
Upload
99 views3 pages

Bracketing and Open Methods Lecture Notes

The document discusses root-finding methods, categorizing them into bracketing and open methods. Bracketing methods, such as the Bisection and Regula Falsi methods, require two initial guesses and guarantee convergence, while open methods, including Fixed-Point Iteration, Newton-Raphson, and Secant methods, do not require bracketing but may lack guaranteed convergence. Each method has its own advantages and disadvantages regarding speed, reliability, and the need for derivatives.

Uploaded by

Charl Barangan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
99 views3 pages

Bracketing and Open Methods Lecture Notes

The document discusses root-finding methods, categorizing them into bracketing and open methods. Bracketing methods, such as the Bisection and Regula Falsi methods, require two initial guesses and guarantee convergence, while open methods, including Fixed-Point Iteration, Newton-Raphson, and Secant methods, do not require bracketing but may lack guaranteed convergence. Each method has its own advantages and disadvantages regarding speed, reliability, and the need for derivatives.

Uploaded by

Charl Barangan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Lecture Notes: Bracketing and Open

Methods for Root Finding


1. Bracketing Methods
Bracketing methods require two initial guesses a and b such that:

f(a) * f(b) < 0

This ensures that a root exists in the interval [a, b] assuming f(x) is continuous.

1.1 Bisection Method


Concept: Iteratively halves the interval [a, b] and retains the subinterval where a root lies.

Formula:

x_r = (a + b)/2

Error Estimate:

|e_n| ≤ (b - a)/2^n

Pros:
- Guaranteed convergence.
- Simple and reliable.

Cons:
- Slow convergence (linear rate).

1.2 Regula Falsi Method (False Position)


Concept: Uses linear interpolation between f(a) and f(b).

Formula:

x_r = b - f(b)(a - b)/(f(a) - f(b))

Pros:
- Often faster than bisection.

Cons:
- May converge slowly if one endpoint stays fixed.
2. Open Methods
Open methods use one or two initial guesses but do not require bracketing the root.

2.1 Fixed-Point Iteration


Concept: Rearranges f(x) = 0 into x = g(x), then:

x_{n+1} = g(x_n)

Convergence Condition:
|g'(x)| < 1 in the neighborhood of the root

Pros:
- Simple to implement.
Cons:
- Convergence not guaranteed.
- May diverge if condition is not met.

2.2 Newton-Raphson Method


Concept: Uses the tangent at the current point to estimate the next point.

Formula:

x_{n+1} = x_n - f(x_n)/f'(x_n)

Pros:
- Quadratic convergence near the root.
Cons:
- Requires derivative f'(x).
- May fail or diverge.

2.3 Secant Method


Concept: Uses a finite difference approximation of the derivative:

x_{n+1} = x_n - f(x_n) * (x_n - x_{n-1}) / (f(x_n) - f(x_{n-1}))

Pros:
- Faster than bisection.
- No derivative required.
Cons:
- May not converge for poor initial guesses.

3. Comparison Table
Method Type Requires Derivative Convergence Reliability
Bracketing Needed

Bisection Bracketing Yes No Linear Guaranteed

Regula Falsi Bracketing Yes No Faster than Sometimes


bisection slow

Fixed-Point Open No Yes (for g' Linear Conditional


check)

Newton- Open No Yes Quadratic Fast but


Raphson risky

Secant Open No No ~1.618 Moderate

You might also like