summaryrefslogtreecommitdiff
path: root/1332/CH6/EX6.5/6_5.sce
blob: c8db77c9932cef7c33c59c21bbae160d9f2f8bdb (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
//Example 6.5
//Dolittle Factorization Method
//Page no. 233
clc;clear;close;

A=[2,1,1;1,3,1;1,1,4];
printf('\tL\t\t  *\t\tU\t\t  =\t\tA')
U(2,1)=0;U(3,1)=0;U(3,2)=0;
L(1,2)=0;L(1,3)=0;L(2,3)=0;
for i=1:3
    L(i,i)=1
end
for i=1:3
    U(1,i)=A(1,i)
end
L(2,1)=1/U(1,1);
for i=2:3
    U(2,i)=A(2,i)-U(1,i)*L(2,1);
end
L(3,1)=1/U(1,1);
L(3,2)=(A(3,2)-U(1,2)*L(3,1))/U(2,2);
U(3,3)=A(3,3)-U(1,3)*L(3,1)-U(2,3)*L(3,2);
printf('\n')
for i=1:3
    for j=1:3
        printf('%.2f\t',L(i,j))
    end
    
    if(i==2)
        printf('  *     ')
    else
        printf('\t')
    end
    
    for j=1:3
        printf('%.2f\t',U(i,j))
    end
    if(i==2)
        printf('  =     ')
    else
        printf('\t')
    end
    for j=1:3
        printf('%.2f\t',A(i,j))
    end
    printf('\n')
end