Approximate Solutions To Higher Order Equations(Bisection Method) - Casio fx-3650P Programming Manual

08 Approximate solutions to higher
order equations
f x ( )
Let be a function continuous on the interval
f a ( )
[ , ] a b
, with and
that there must be at least one
f c ( )
= 0
. If we divide the interval into two,
must belong to one of the intervals.
comparing the signs of
we can half the interval in which we search.
Repeating this procedure will yield an approximate
solution of arbitrary accuracy.
ON MODE MODE
Ｌｂｌ １：？→ Ａ：？→ Ｂ： （
⇒ Ｇｏｔｏ １： （ Ａ
Ａ：Ｌｂｌ ２： （Ａ ＋ Ｂ）÷２→ Ｘ：Ｘ
３：Ｘ → Ｂ：Ｇｏｔｏ ２：Ｌｂｌ ３：Ｘ → Ａ：Ｇｏｔｏ ２ ＜ 126 STEP ＞
Find solutions to the equation
Prog 1
1 EXE 1
EXE
14
f b ( )
having opposite signs, so
c
in
a + b
 
f a ( ) f
------------ -
,
, and
 
2
PRGM
MODE
３
Ａ －２ Ａ
３ ２
－２ Ａ －２ Ａ ＋４
3 2
x – 2x –
5 EXE
(bisection method)
[ , ] a b
with
c
Thus by
f b ( )
a
COMP
1 MODE 1
２
Ｂ
－２ Ａ ＋４ ） （
）＞０⇒ Ｇｏｔｏ ２：Ｂ → Ｃ：Ａ → Ｂ：Ｃ →
３ ２
Ｘ －２ Ｘ －２ Ｘ ＋４
2x + 4 = 0
. (Solutions are
S A
S A
S A
a+b
2
1
３ ２
－２ Ｂ －２ Ｂ ＋４
→ Ｙ：Ｙ ＞０⇒ Ｇｏｔｏ
±
2 2
and )
P1 P1 P2 P3 P4 D R G
P1 P1 P2 P3 P4 D R G
P1 P1 P2 P3 P4 D R G
b
）≧０
Disp
Disp