More About Timing

Both timing programs, but the linear equation timing program in particular, are intended to be used to collect data to determine optimal values for the block routines. All of the block factorization, inversion, reduction, and orthogonal transformation routines in LAPACK are included in the linear equation timing program. Currently, the block parameters NB and NX, as well as others, are passed to the block routines by the environment inquiry function ILAENV, which in turn receives these values through a common block set in the timing program. Future implementations of ILAENV may be tuned to a specific machine so that users of LAPACK will not have to set the block size. For a brief introduction to ILAENV and guidelines on setting some of the parameters, see the LAPACK Users' Guide [1].

The main timing procedure for the REAL linear equation routines
is found in `LAPACK/TIMING/LIN/stimaa.f` in the Unix version and
is the first program unit in SLINTIMF in the non-Unix version.
The main timing procedure for the REAL eigenvalue routines
is found in `LAPACK/TIMING/EIG/stimee.f` in the Unix version and
is the first program unit in SEIGTIMF in the non-Unix version.

- The Linear Equation Timing Program
- Timing the Level 2 and 3 BLAS
- Timing the Nonsymmetric Eigenproblem
- Timing the Generalized Nonsymmetric Eigenproblem
- Timing the Symmetric and Generalized Symmetric Eigenproblem
- Timing the Singular Value Decomposition
- Timing the Generalized Singular Value Decomposition
- Timing the Generalized QR and RQ Factorizations
- Timing the Generalized Linear Regression Model Problem
- Timing the Constrained Linear Least Squares Problem