Scribd
Upload
10 views3 pages

Numerical Analysis: Error and Root Methods

The document discusses key concepts in numerical analysis, including errors, precision, and methods for solving algebraic and transcendental equations. It outlines three primary methods: the Bisection Method, the Method of False Position, and the Newton-Raphson Method, each with its algorithm for finding roots of functions. Errors in numerical analysis arise from round-off and truncation errors, with precision indicating the closeness of computed values to true values.

Uploaded by

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

Numerical Analysis: Error and Root Methods

The document discusses key concepts in numerical analysis, including errors, precision, and methods for solving algebraic and transcendental equations. It outlines three primary methods: the Bisection Method, the Method of False Position, and the Newton-Raphson Method, each with its algorithm for finding roots of functions. Errors in numerical analysis arise from round-off and truncation errors, with precision indicating the closeness of computed values to true values.

Uploaded by

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

### Numerical Analysis

#### Errors and Precision


In numerical analysis, errors are the differences between the true
value and the approximated value. Errors can arise from various
sources, including round-off errors and truncation errors.

- **Round-off Errors**: These occur due to the finite precision


with which computers represent numbers. For example,
representing \(\pi\) as 3.14 introduces a round-off error.

- **Precision**: Precision refers to how close a computed or


measured value is to the true value. High precision means smaller
errors.

#### Solution of Algebraic and Transcendental Equations


Algebraic equations are polynomial equations (e.g., \(x^3 - 2x + 1
= 0\)), while transcendental equations involve transcendental
functions (e.g., \(e^x - x^2 = 0\)).

#### Bisection Method


The Bisection Method is a bracketing method for finding roots of
a function. It repeatedly bisects an interval and then selects the
subinterval in which the root must lie.

- **Algorithm**:
1. Choose initial points \(a\) and \(b\) such that \(f(a) \cdot f(b) <
0\).
2. Compute the midpoint \(c = \frac{a + b}{2}\).
3. If \(f(c) = 0\) (or \(|f(c)|\) is sufficiently small), \(c\) is the root.
4. Otherwise, replace \(a\) or \(b\) with \(c\) depending on the
sign of \(f(c)\).
5. Repeat until convergence.

#### Method of False Position (Regula Falsi)


The Method of False Position is similar to the Bisection Method
but uses a linear interpolation to find a better approximation of
the root.

- **Algorithm**:
1. Choose initial points \(a\) and \(b\) such that \(f(a) \cdot f(b) <
0\).
2. Compute the new point \(c\) using the formula \(c = a - f(a) \
cdot \frac{b - a}{f(b) - f(a)}\).
3. If \(f(c) = 0\) (or \(|f(c)|\) is sufficiently small), \(c\) is the root.
4. Otherwise, replace \(a\) or \(b\) with \(c\) depending on the
sign of \(f(c)\).
5. Repeat until convergence.

#### Newton-Raphson Method


The Newton-Raphson Method is an iterative method for finding
successively better approximations to the roots of a real-valued
function.

- **Algorithm**:
1. Choose an initial guess \(x_0\).
2. Compute the next approximation using the formula \(x_{n+1}
= x_n - \frac{f(x_n)}{f'(x_n)}\).
3. Repeat until the difference between successive approximations
is smaller than a predefined tolerance level.

These methods are fundamental in numerical analysis for solving


equations. If you need further explanations or examples, feel free
to ask!

You might also like