***********************************************
 This code is an example of an algorithm I'll call
 optimized dynamic relaxation.  Another possible
 name is recycled GMRES(2), which is like standard
 GMRES(2) but with a modified restarting method that
 recycles previous search directions rather than just
 throwing them away.  This is equivalent to LGMRES(1,1)
 (Loose GMRES), and can also be though of as an
 optimized 2cd Order Richardson iteration, or
 a modified form of 2cd order Chebyshev iteration.
 Results are written in output files
 fort.* and sol_zTestgmres.
 ***********************************************
 
 Matrix size nx= 42 N = nx^2 =  1764
 doing the Morgan problem with V_morgan =  0.000000000000000E+00
 # iterations = 77 relative residual err= 8.732771883095845E-10
 average convergence rate /iteration 0.7626980304280178