Professional Documents
Culture Documents
(
(
- t
0
x(t) = x e cos t + sin t = 0
in which
2
2
k c
= -
m 4m
Roots of Equations
E. T. S. I. Caminos, Canales y Puertos 7
Determine real roots of :
Algebraic equations (including polynomials)
Transcendental equations such as f(x) = sin(x) + e
-x
Combinations thereof
Roots of Equations
E. T. S. I. Caminos, Canales y Puertos 8
in which:
PV = present value or purchase price = $7,500
A = annual payment = $1,000/yr
n = number of years = 20 yrs
i = interest rate = ? (as a fraction, e.g., 0.05
= 5%)
Engineering Economics Example:
A municipal bond has an annual payout of
$1,000 for 20 years. It costs $7,500 to purchase
now. What is the implicit interest rate, i ?
Solution: Present-value, PV, is:
( )
n
1 1 i
PV A
i
(
+
( =
(
Roots of Equations
E. T. S. I. Caminos, Canales y Puertos 9
Engineering Economics Example (cont.):
We need to solve the equation for i:
( )
20
1 1 i
f (i) 7,500 1, 000 0
i
(
+
( = =
(
( )
20
1 1 i
7, 500 1, 000
i
(
+
( =
(
Equivalently, find the root of:
Roots of Equations
E. T. S. I. Caminos, Canales y Puertos 10
Engineering Economics Example
-$15,000
-$10,000
-$5,000
$0
$5,000
$10,000
0% 20% 40% 60% 80% 100%
Interest Rate, i
f
(
i
)
=
P
V
-
g
(
i
)
Excel
Roots of Equations
E. T. S. I. Caminos, Canales y Puertos 11
Roots of Equations
Graphical methods:
Determine the friction coefficient c necessary for a
parachutist of mass 68.1 kg to have a speed of 40
m/seg at 10 seconds.
Reorganizing.
E. T. S. I. Caminos, Canales y Puertos 12
Two Fundamental Approaches
1. Bracketing or Closed Methods
- Bisection Method
- False-position Method (Regula falsi).
2. Open Methods
- Newton-Raphson Method
- Secant Method
- Fixed point Methods
Roots of Equations
E. T. S. I. Caminos, Canales y Puertos 13
Bracketing Methods
f(x)
f(x)
f(x)
f(x)
x
l
x
u
a)
b)
c)
d)
x
x
x
x
In Figure a) we have the case of f(x
l
)
and f(x
u
) with the same sign, and there
is no root in the interval (x
l
,x
u
).
In Figure b) we have the case of f(x
l
)
and f(x
u
) With different sign, and there
is a root in the interval (x
l
,x
u
).
In Figure c) we have the case of f(x
l
)
and f(x
u
) with the same sign, and there
are two roots.
In Figure d) we have the case of f(x
l
)
and f(x
u
) with different sign, and there is
an odd number of roots.
E. T. S. I. Caminos, Canales y Puertos 14
Though the cases above are generally valid, there are
cases in which they do not hold.
In Figure a) we have the case of f(x
l
)
and f(x
u
) with different sign, but there is
a double root.
f(x)
f(x)
f(x)
x
l
x
u
a)
b)
c)
x
x
x
In Figure b) We have the case of f(x
l
)
and f(x
u
) With different sign, but there
are two discontinuities.
In Figure c) we have the case of f(x
l
)
and f(x
u
) with the same sign, but there
is a multiple root.
Bracketing Methods
E. T. S. I. Caminos, Canales y Puertos 15
f(x
1
) f(x
r
) > 0
x
f(x)
l u
r
x x
x
2
+
=
f(x
u
)
(x
u
)
(x
1
)
f(x
1
)
f(x
r
)
f(x
u
)
f(x
1
)
(x
1
)
(x
u
) (x
r
)
f(x
r
)
x
f(x)
x
r
=> x
1
Bracketing Methods (Bisection method)
Bisection Method
E. T. S. I. Caminos, Canales y Puertos 16
Bisection Method
Advantages:
1. Simple
2. Estimate of maximum error:
3. Convergence guaranteed
Disadvantages:
1. Slow
2. Requires two good initial estimates which define
an interval around root:
- use graph of function,
- incremental search, or
- trial & error
l u
max
x x
E
2
s
i 1 i
max max
E 0.5 E
+
=
Bracketing Methods (Bisection method)
E. T. S. I. Caminos, Canales y Puertos 17
x
False-position Method
f(x)
f(x
u
)
(x
u
)
(x
1
)
f(x
1
)
u 1 u
r u
1 u
f (x )(x x )
x x
f (x ) f (x )
f(x
r
)
f(x
1
) f(x
r
) > 0
x
1
= x
r
f(x)
f(x
u
)
f(x
1
)
(x
1
)
(x
u
)
(x
r
)
f(x
r
)
Bracketing Methods (False-position Method)
E. T. S. I. Caminos, Canales y Puertos 18
There are some cases in which the false position
method is very slow, and the bisection method gives
a faster solution.
Bracketing Methods (False-position Method)
E. T. S. I. Caminos, Canales y Puertos 19
Summary of False-Position Method:
Advantages:
1. Simple
2. Brackets the Root
Disadvantages:
1. Can be VERY slow
2. Like Bisection, need an initial interval around the
root.
Bracketing Methods (False-position Method)
E. T. S. I. Caminos, Canales y Puertos 20
Roots of Equations - Open Methods
Characteristics:
1. Initial estimates need not bracket the root
2. Generally converge faster
3. NOT guaranteed to converge
Open Methods Considered:
- Fixed-point Methods
- Newton-Raphson Iteration
- Secant Method
Open Methods
E. T. S. I. Caminos, Canales y Puertos 21
Two Fundamental Approaches
1. Bracketing or Closed Methods
- Bisection Method
- False-position Method
2. Open Methods
- One Point Iteration
- Newton-Raphson Iteration
- Secant Method
Roots of Equations
E. T. S. I. Caminos, Canales y Puertos 22
Newton-Raphson Method:
Geometrical Derivation:
Slope of tangent at x
i
is
Solve for x
i+1
:
[Note that this is the same form as the generalized one-
point iteration, x
i+1
= g(x
i
)]
i
i
i i 1
f (x ) 0
f '(x )
x x
+
i
i 1 i
i
f (x )
x x
f '(x )
+
=
Open Methods (Newton-Raphson Method)
E. T. S. I. Caminos, Canales y Puertos 23
Newton-Raphson Method
x
i
= x
i+1
i
i 1 i
i
f (x )
x x
f '(x )
+
=
Tangent w/slope=f '(x
i
)
x
f(x)
f(x
i
)
x
i
f(x
i+1
)
i
i
i i 1
f (x ) 0
f ' (x )
x x
+
x
f(x)
f(x
i
)
(x
i
)
f(x
i+1
)
i
i
i i 1
f (x ) 0
f ' (x )
x x
+
x
i+
1
x
i+
1
Open Methods (Newton-Raphson Method)
E. T. S. I. Caminos, Canales y Puertos 24
Open Methods
a) Inflection point in the
neighboor of a root.
b) Oscilation in the neighboor
of a maximum or minimum.
c) Jumps in functions with
several roots.
d) Existence of a null
derivative.
E. T. S. I. Caminos, Canales y Puertos 25
Bond Example:
To apply Newton-Raphson method to:
( )
20
1 1 i
f (i) 7, 500 1, 000 0
i
(
+
( = =
(
( )
( )
20
21
1 1 i
1, 000
f '(i) 20 1 i
i i
(
+
( = +
`
(
)
We need the derivative of the function:
Open Methods (Newton-Raphson Method)
E. T. S. I. Caminos, Canales y Puertos 26
Secant Method
Approx. f '(x) with backward FDD:
Substitute this into the N-R equation:
to obtain the iterative expression:
i 1 i
i 1 i
f (x ) f (x )
f '(x)
x x
i
i 1 i
i
f (x )
x x
f '(x )
+
=
i i 1 i
i 1 i
i 1 i
f (x )(x x )
x x
f (x ) f (x )
x
f(x)
f(x
i
)
x
i
f(x
i-1
)
i-1 i
i
i-1 i
f(x ) - f(x )
f ' (x )
x - x
~
f(x)
x
i-1
x
i+
1
x
f(x
i
)
x
i
f(x
i-1
)
i-1 i
i
i-1 i
f(x ) - f(x )
f ' (x )
x - x
~
x
i-1
x
i+
1
Open Methods (Secant Method)