next up previous contents index
Next: Program vectopt Up: Optimizing and Example Previous: Optimizing and Example

Program lastest

 

The program lastest shown efficiency of basic operations implemented in LASPack . The output contains the following data:

Results:    (for dimension 100000, cycles 100)
--------

   #   with LASPack  in-line code  efficiency     description
-------------------------------------------------------------------------
   1       ---            ---          ---       vector constr. & destr.
   2     0.00900 s        ---          ---       vector generation
   3     0.06316 s        ---          ---       matrix constr. & destr.
   4     1.32628 s        ---          ---       matrix generation
   5     0.02283 s      0.02283 s    100.00 %    a = b
   6     0.04033 s      0.03850 s     95.45 %    a = b + c
   7     0.02283 s      0.02283 s    100.00 %    a = s * b
   8     0.04316 s      0.04333 s    100.39 %    s = b * c
   9     0.26699 s      0.27116 s    101.56 %    a = L * b
  10     0.03000 s      0.02983 s     99.44 %    a = a + b
  11     0.01933 s      0.01967 s    101.72 %    a = s * a
  12     0.04250 s      0.04183 s     98.43 %    a = b + s * c
  13     0.03267 s      0.03300 s    101.02 %    a = a + s * b
-------------------------------------------------------------------------

Here s is a scalar, a, b, c are vectors, and L is a matrix. The in-line routines are in comparison with LASPack simplified and can be therefore a little faster.



Tomas Skalicky (skalicky@msmfs1.mw.tu-dresden.de)