Scribd
Upload
4 views

Interpretation of Numerical Methods

Interpretation of Numerical Methods

Uploaded by

magsinodenmark19
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views

Interpretation of Numerical Methods

Interpretation of Numerical Methods

Uploaded by

magsinodenmark19
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Interpretation of Numerical Methods

for Root Finding


1. Bisection Method
The Bisection Method is a numerical approach for finding the roots of a non-linear equation
by iteratively narrowing down the interval where the root lies. The given function is f(x) =
2x^2 + 3x - 20, representing the load-bearing capacity of a soil foundation.

In this method:
- We start with two initial guesses, a and b, such that f(a) and f(b) have opposite signs,
ensuring that a root exists between them.
- The midpoint c of the interval [a, b] is calculated as c = (a + b)/2.
- The function is evaluated at c. If f(c) is close enough to zero, then c is considered the root.
- If not, the interval is updated: if f(c) and f(a) have opposite signs, the new interval is [a, c];
otherwise, it is [c, b].
- This process is repeated until the interval is sufficiently small or f(c) is close to zero.

The Bisection Method is simple and reliable but may converge slowly compared to other
techniques.

2. False-Position Method
The False-Position Method (or Regula Falsi) is similar to the Bisection Method but improves
on the way the next approximation of the root is selected. Instead of taking the midpoint of
the interval, it uses a weighted average based on the values of the function at the endpoints.

For the function f(x) = 2x^2 + 3x - 20:


- We start with two initial guesses, a and b, where f(a) and f(b) have opposite signs.
- The new approximation of the root c is calculated using the formula: c = a - f(a)(b - a) /
(f(b) - f(a)).
- The function is evaluated at c. If f(c) is sufficiently close to zero, c is taken as the root.
- Otherwise, the interval is updated based on the sign of f(c), similar to the Bisection
Method.

The False-Position Method often converges faster than the Bisection Method, especially
when the function behaves more linearly within the interval.
3. Incremental Search Method
The Incremental Search Method involves evaluating the function at regular intervals over a
specified range to detect sign changes, indicating the presence of a root.

For the function f(x) = 2x^2 + 3x - 20:


- We choose an initial point and incrementally step through the range by a fixed step size.
- At each step, we check the signs of f(x) at the current point and the next point.
- If a sign change is detected (i.e., f(x_i) and f(x_{i+1}) have opposite signs), then a root lies
between these two points.
- The interval containing the root is refined by reducing the step size, and the process is
repeated until a sufficiently accurate estimate of the root is obtained.

The Incremental Search Method is straightforward but can be inefficient for functions with
multiple roots or when roots are closely spaced.

4. Newton-Raphson Method
The Newton-Raphson Method is an iterative root-finding technique that uses the derivative
of the function to find a better approximation of the root.

For f(x) = 2x^2 + 3x - 20, the derivative is f'(x) = 4x + 3:


- We start with an initial guess x_0 for the root.
- The next approximation x_1 is calculated using the formula: x_1 = x_0 - f(x_0) / f'(x_0).
- This process is repeated until f(x_n) is sufficiently close to zero.

The Newton-Raphson Method converges rapidly if the initial guess is close to the actual root
and the derivative does not approach zero. However, if the initial guess is far from the root
or if the function has discontinuities, it may fail to converge.

5. Secant Method
The Secant Method is a variation of the Newton-Raphson Method that does not require
calculating the derivative. Instead, it approximates the derivative using two previous points.

For the function f(x) = 2x^2 + 3x - 20:


- We start with two initial guesses, x_0 and x_1, close to the root.
- The next approximation x_2 is calculated using: x_2 = x_1 - f(x_1)(x_1 - x_0) / (f(x_1) -
f(x_0)).
- The points x_0 and x_1 are updated for each iteration, and the process repeats until the
function value at the current point is close enough to zero.

The Secant Method typically converges faster than the Bisection and False-Position Methods
but may be less stable than the Newton-Raphson Method due to its reliance on the previous
two estimates.

You might also like