function Feb15Lec()
% Shows why pivoting is not necessary if A is column
% diagonally dominant.
clc
format short
n = 5;
% Generate a random column-diagonally dominant matrix...
A = randn(n,n);
A = A - diag(diag(A));
disp('Original Matrix...')
A = A + diag(1.1*sum(abs(A)))
pause
for k=1:n-1
    kdx = k+1:n;
    clc
    fprintf('Step %1d\n\n',k)
    fprintf('Store multipliers in A(%1d:%1d,%1d)\n',k+1,n,k)
    A = A
    pause
    A(kdx,k) = A(kdx,k)/A(k,k);
    clc
    fprintf('Step %1d\n\n',k)
    fprintf('Update A(%1d:%1d,%1d:%1d)\n',k+1,n,k+1,n)
    A = A
    pause
    A(kdx,kdx) = A(kdx,kdx) - A(kdx,k)*A(k,kdx);
end
    
    
