
 a) Verify with numeric applications, 
    some basic properties and theorems I. 
    
 b) The coefficients, integers or fractions, are randomly
    selected by the computer.

 c) The size of the matrices, are randomly selected by the 
    computer, but you can select the size if you want.

 
    Try the examples in this order.


                  Solving linear systems by matrix inversions :
                  *********************************************

   invx1f.exe   invx1f.exe :  Ax=b1            => x = Inv(A)*b1


                  Linear systems with common coefficient matrix :
                  *********************************************

   Solving by matrix inversions (in several step) :
   ==============================================

   invx2f.exe   invx2f.exe :  Ax=b1            => x = Inv(A)*b1 
                              Ax=b2            => x = Inv(A)*b2

   invx3f.exe   invx3f.exe :  Ax=b1            => x = Inv(A)*b1 
                              Ax=b2            => x = Inv(A)*b2
                              Ax=b3            => x = Inv(A)*b3

   Solving by matrix inversions (in one step) :
   ==========================================

   invz2f.exe   invz2f.exe :  Ax = b1|b2       => x = Inv(A)*b1|b2 
   invz3f.exe   invz3f.exe :  Ax = b1|b2|b3    => x = Inv(A)*b1|b2|b3 
   invz4f.exe   invz4f.exe :  Ax = b1|b2|b3|b4 => x = Inv(A)*b1|b2|b3|b4


   Solving by GaussJordan elimination (in one step) :
   ================================================

   gausx2f.exe  gausx2i.exe :  GaussJordan  A|b1|b2
   gausx3f.exe  gausx3i.exe :  GaussJordan  A|b1|b2|b3
   gausx4f.exe  gausx4i.exe :  GaussJordan  A|b1|b2|b3|b4


