Академический Документы
Профессиональный Документы
Культура Документы
n=1
approximating a zero p of f with
| p
n
p|
b a
2
n
, when n 1.
Proof For each n 1, we have
b
n
a
n
=
1
2
n1
(b a) and p (a
n
, b
n
).
Since p
n
=
1
2
(a
n
+ b
n
) for all n 1, it follows that
| p
n
p|
1
2
(b
n
a
n
) =
b a
2
n
.
Because
| p
n
p| (b a)
1
2
n
,
the sequence { p
n
}
n=1
converges to p with rate of convergence O
1
2
n
; that is,
p
n
= p + O
1
2
n
.
It is important to realize that Theorem 2.1 gives only a bound for approximation error
and that this bound might be quite conservative. For example, this bound applied to the
problem in Example 1 ensures only that
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Soluc ao
Solucao
Apos 13 itera coes, p
13
= 1.365112305 aproxima a raiz p com
erro:
|pp
13
| < |b
14
a
14
| = |1.3652343751.365112305| = 0.000122070.
Como |a
14
| < |p|, temos
|p p
13
|
|p|
<
|b
14
a
14
|
|a
14
|
9.0 10
5
,
Logo, a aproxima cao esta correta, com erro inferior a 10
4
Soluc ao
Solucao
Apos 13 itera coes, p
13
= 1.365112305 aproxima a raiz p com
erro:
|pp
13
| < |b
14
a
14
| = |1.3652343751.365112305| = 0.000122070.
Como |a
14
| < |p|, temos
|p p
13
|
|p|
<
|b
14
a
14
|
|a
14
|
9.0 10
5
,
Logo, a aproxima cao esta correta, com erro inferior a 10
4
Soluc ao
Solucao
Apos 13 itera coes, p
13
= 1.365112305 aproxima a raiz p com
erro:
|pp
13
| < |b
14
a
14
| = |1.3652343751.365112305| = 0.000122070.
Como |a
14
| < |p|, temos
|p p
13
|
|p|
<
|b
14
a
14
|
|a
14
|
9.0 10
5
,
Logo, a aproxima cao esta correta, com erro inferior a 10
4
Soluc ao
Solucao
Apos 13 itera coes, p
13
= 1.365112305 aproxima a raiz p com
erro:
|pp
13
| < |b
14
a
14
| = |1.3652343751.365112305| = 0.000122070.
Como |a
14
| < |p|, temos
|p p
13
|
|p|
<
|b
14
a
14
|
|a
14
|
9.0 10
5
,
Logo, a aproxima cao esta correta, com erro inferior a 10
4
Resultado Te orico
Teorema
Suponha que f C[a, b] e f(a)f(b) < 0. O metodo da bissecao
gera uma sequencia {p
n
}
n=1
aproxima um zero de f com
|p
n
p|
b a
2
n
, n 1
Resultado Te orico
Limitante de Erro Conservador
O teorema da um limitante para o erro de aproxima cao e que
este limitante pode ser muito conservador;
Por exemplo, este limitante aplicado ao problema anterior
(f(x) = x
3
+ 4x
2
10) assegura que:
|p p
9
|
2 1
2
9
2 10
3
mas o erro e muito menor:
|p p
9
| = |1.365230013 1.365234375| 4.4 10
6
.
Exerccio
Exemplo
Determine o n umero de itera coes necessarias para resolver a equacao
f(x) = x
3
+ 4x
2
10 = 0, com precisao de 10
3
, usando a
1
= 1 e
b
1
= 2.
Solucao
Usaremos logaritmo (base 10) para encontrar o inteiro N que
satisfaz:
|p
N
p| 2
N
(b a) = 2
N
< 10
3
Assim
N log
10
2 < 3 N >
3
log
10
2
9.96
Logo 10 itera coes sao sucientes para garantir esta precisao.
Na tabela temos que p
9
= 1.365234375 possui precisao
inferior a 10
4
.
Exerccio
Exemplo
Determine o n umero de itera coes necessarias para resolver a equacao
f(x) = x
3
+ 4x
2
10 = 0, com precisao de 10
3
, usando a
1
= 1 e
b
1
= 2.
Solucao
Usaremos logaritmo (base 10) para encontrar o inteiro N que
satisfaz:
|p
N
p| 2
N
(b a) = 2
N
< 10
3
Assim
N log
10
2 < 3 N >
3
log
10
2
9.96
Logo 10 itera coes sao sucientes para garantir esta precisao.
Na tabela temos que p
9
= 1.365234375 possui precisao
inferior a 10
4
.
Considerac oes nais
Consideracoes nais
O Metodo da Bisse cao possui diversas limitacoes;
Primeiro que a taxa de convergencia e lenta: N pode se
tornar muito grande antes de p p
N
se tornar pequeno;
, . . . , and, nally, to f
(n1)
.
This result is considered in Exercise 23.
Theorem 1.10 (Generalized Rolles Theorem)
Suppose f C[a, b] is n times differentiable on (a, b). If f (x) = 0 at the n + 1 distinct
numbers a x
0
< x
1
< . . . < x
n
b, then a number c in (x
0
, x
n
), and hence in (a, b),
exists with f
(n)
(c) = 0.
We will also make frequent use of the Intermediate Value Theorem. Although its state-
ment seems reasonable, its proof is beyond the scope of the usual calculus course. It can,
however, be found in most analysis texts.
Theorem 1.11 (Intermediate Value Theorem)
If f C[a, b] and K is any number between f (a) and f (b), then there exists a number c
in (a, b) for which f (c) = K.
Figure 1.7 shows one choice for the number that is guaranteed by the Intermediate
Value Theorem. In this example there are two other possibilities.
Figure 1.7
x
y
f (a)
f (b)
y f (x)
K
(a, f (a))
(b, f (b))
a b c
Example 2 Show that x
5
2x
3
+ 3x
2
1 = 0 has a solution in the interval [0, 1].
Solution Consider the function dened by f (x) = x
5
2x
3
+ 3x
2
1. The function f is
continuous on [0, 1]. In addition,
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.