CPSC/Math 402: Numerical Linear Algebra
Lab Exercise

Using the C++ Matrix Class

The primary goal of lab is to become a little familiar with the C++ program handed out in class. The header file shows you the methods and data members of the class. The function to perform one iteration of iterative refinement is not complete yet.

Start by copying the following files of source code to your directory:

Now do the following:

  1. Compile and run testMat.cc to see how it works. One way to compile is with the following command (this compiles each file and links them and stores the executable in the file testM; you may also compile and link separately or use a Makefile): 
          g++ testMat.cc Matrix.cc -o testm
    Now execute the program by typing 
         ./testm
    Test the program by using the following input:
    1. The system in Computer Problem 2.9 part (a) (page 102) with epsilon = 0.000001 (10^-6). That is, the system 
                 0.000001  1  1.000001
               1     1      2
      All three pivoting strategies should give you the same solution.

    2. The same system with the following values of epsilon: 10^-15, 10^-16, and 10^-18. Notice that naive pivoting doesn't work so well anymore!

    3. The system in Computer Problem 2.1 part (a) (page 100). In theory this matrix is singular but roundoff in representation (the entries are not machine numbers in base 2) means the computer doesn't notice (see part (c)). Save the answers you get.

  2. Now compile and run testHilbert.cc. This program asks you for the size of the Hilbert matrix you want to generate. The Hilbert matrix is ill-conditioned but the program does ok for small n.

  3. Now open Matrix.cc in emacs and complete the function refine that computes one iteration of iterative refinement. Part of it is already done for you. You have three places to add code -- there are comments indicating what you are to do.

  4. Open up testMat.cc and add a call to the refine function after the system has been solved for each of the pivoting strategies.

  5. Compile your program and test it on the system from problem 2.9. You should see that when you use epsilon = 10^-16 (or any value that gave a different answer for naive pivoting) the iterative refinement corrects the solution.