Scribd
Upload
7 views17 pages

Numerical Analysis

Uploaded by

mahmoud amin
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
7 views17 pages

Numerical Analysis

Uploaded by

mahmoud amin
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
You are on page 1/ 17

Faculty of Engineering Benha University

Shoubra Engineering Mathematics

Solution of Equations in one Variable

Dr. Fathi Abdessalam


Solution of Equations in one Variable
we consider one of the most basic problems of numerical approximation, the root-
finding problem. This process involves finding a root of an equation of the form
𝑓 (𝑥) = 0. A root of this equation is also called a zero of the function.
Bisection Technique
The first technique, based on the Intermediate Value Theorem, is called the
Bisection, or Binary-search, method.
Suppose f is a continuous function defined on the interval [a, b], with f (a) and f (b)
of opposite sign. The Intermediate Value Theorem implies that a number p exists in
(a, b)
with 𝑓(𝑝) = 0 . Although
the procedure will work
when there is more than one F(x)

root in the interval (𝑎, 𝑏), we


assume for simplicity that the P
a b
root in this interval is unique.
The method calls for a
repeated halving (or
bisecting) of subintervals of
[a,b] and, at each step,
locating the half containing + 𝑷𝟏 = (𝒂 + 𝒃)/𝟐
-
p. 𝒇(𝒂) > 𝟎 𝒇(𝒃) < 𝟎

a b
Fixed point iteration method:
In numerical analysis, fixed point iteration is a method of
computing fixed points of functions.
More specifically, given a function f (x) defined on the real
numbers with real values and given a point x0 in the domain of f (x) ,the
fixed point iteration is
Example
Answer
Suppose f (x) is a differentiable function defined on the interval [a, b] with
values in the real numbers R. The formula for converging on the zero can be
easily derived. Suppose we have some current approximation xn . Then we
can derive the formula for a better approximation, xn+1 by referring to the
diagram below. We know from the definition of the derivative
at a given point that it is the slope of a tangent at that point That is

You might also like