%  function [L,U]=badfact(A)
%
%   Gaussian elimination without pivoting
% 
% Notice how it computes the L and U factors from scratch
%
function [L,U]=badfact(A)
[m,n]=size(A);
U=zeros(n,n);
L=eye(m,n);
if m == n 
   p=n-1
else
   p=min([m n]);
end;
for k=1:p
 U(k,k:n)=A(k,k:n);
 L(k+1:m,k)=A(k+1:m,k)/U(k,k);
%
%  Compute Multipliers
% for i=k+1:m
%  L(i,k)=A(i,k)/A(k,k);
% end;
%
 A(k+1:m,k+1:n)=A(k+1:m,k+1:n) -L(k+1:m,k)*U(k,k+1:n);
%
%  Modify Matrix
%  for j=k+1:n
%   for i=k+1:m
%    A(i,j)=A(i,j)-L(i,k)*U(k,j)
%   end;
%  end;
%
end;
U(n,n)=A(n,n);
%
%
%
%*******************************************************************************%
%*******************************************************************************