Date:

Exp:
LU DOOLITTLE DECOMPOSITION
PROGRAMMING CODE:
clear;
clc;
A=input('enter the matrix');
[m n]=size(A);
L=zeros(size(A));
U=zeros(size(A));
U(1,:)=A(1,:);
L(:,1)=A(:,1)/U(1,1);
for k=2:m
for i=2:m
for j=i:m
U(i,j)=A(i,j)-dot(L(i,1:i-1),U(1:i-1,j));
end
L(i,k)=(A(i,k)-dot(L(i,1:k-1),U(1:k-1,k)))/U(k,k);
end
end
fprintf('lower triangluar matrix');
L
fprintf('upper triangular matrix');
U

OUTPUT:
1. enter the matrix[4 12 -16;12 37 -43;-16 -43 98]
lower triangluar matrix
L=
1

-4

upper triangular matrix

U=
4

12 -16

2. enter the matrix[1 2 3 4 5;2 6 7 8 9;3 7 10 11 12;4 8 11 13

14;5 9 12 14 15]
lower triangluar matrix
L=
1.0000

2.0000

1.0000

3.0000

0.5000

1.0000

4.0000

-2.0000

5.0000 -0.5000

-5.0000

0
0
1.0000
2.2000

0
0
1.0000

upper triangular matrix

U=
1.0000

2.0000

3.0000

4.0000

2.0000

1.0000

0.5000

-1.0000

0
0

-5.0000
0

5.0000
-1.0000
-2.5000
-11.0000
1.2000