Lecture 1

Stability of algorithms :

A numerical algorithm is a finite sequence of arithmetic and logical operations.

Definition :

A numerical stable if exists C70 such that for two input data In
algorithm is ,
there a constant I, .

for the input data 0 02 .

,
we have 01-02 1 C ·

In-I2/recursion of the fibonaccic-like) sequence is unstable)

Definition : Normalized floating point number

Let m =

* mi
·
Gi with tEIN
, M
↳ first
=

digit
1
,
Mi t RO
is 1
always

The number of the form a =

I M .
2K (KEZ) is called a normalized floating point number .

M :
Mantissa of length' t 10 . 1- -...... 2k
-
t digits
K :
exponent K-1 K [K
,

Notation : a = I <M ...

M21K] = I 0 M .
,
...

My
LK

Notation : M =
M1t , K t kt) is the set of machine numbers for fixed K K
+
EI and tEIN values
·
> , ,

I Generally KLO and k

+
> 0 )
.

Definition : Machine numbers

MCt , K
-

,
k
+
) =

[
& = 12K
. E Mi · 2.
iEnt KT , U

Example :
=
mantissa
t
>
-

M(3 , -
1, 2) ~
10 1 . - -
.

24 , (-1[k + 2)
u u
Kikt

I E % E
elements in case of K = 0 : 0 , 100 0 101 , 0 110 0 , 11 1 2
,
.

,
. . .

, , ,

=
[1001 13 0.100 22
Co
1 A #
(M1
=
2 0 25 2 4 + 1 33
-
= ·
= . = = = .
.
=
.

E1 [10111] 1 0 101 2"-1

1 +
= -
=
.
.
= -
2 = = 0 25.

[111/2] 22
#
7
Mc = =
0 111
.
. =
.

4 = =
3 5
.