This README File is for the LAPACK driver variants.
It is composed of 5 sections:
- Description: contents a quick description of each of the variants. For a more detailed description please refer to LAWN XXX.
Author: Julie LANGOU, May 2008
This directory contains several variants of LAPACK routines in single/double/complex/double complex precision:
- [sdcz]getrf with LU Crout Level 3 BLAS version algorithm [2]- Directory: SRC/VARIANTS/lu/CR
- [sdcz]getrf with LU Left Looking Level 3 BLAS version algorithm [2]- Directory: SRC/VARIANTS/lu/LL
- [sdcz]getrf with Sivan Toledo's recursive LU algorithm [1] - Directory: SRC/VARIANTS/lu/REC
- [sdcz]geqrf with QR Left Looking Level 3 BLAS version algorithm [2]- Directory: SRC/VARIANTS/qr/LL
- [sdcz]potrf with Cholesky Right Looking Level 3 BLAS version algorithm [2]- Directory: SRC/VARIANTS/cholesky/RL
- [sdcz]potrf with Cholesky Top Level 3 BLAS version algorithm [2]- Directory: SRC/VARIANTS/cholesky/TOP
References:For a more detailed description please refer to
- [1] Toledo, S. 1997. Locality of Reference in LU Decomposition with Partial Pivoting. SIAM J. Matrix Anal. Appl. 18, 4 (Oct. 1997),
1065-1081. http://dx.doi.org/10.1137/S0895479896297744
These variants are compiled by default in the build process but they are not tested by default.
The build process creates one new library per variants in the four arithmetics (singel/double/comple/double complex).
The libraries are in the SRC/VARIANTS/LIB directory.
Corresponding libraries created in SRC/VARIANTS/LIB:
- LU Left Looking : lull.a
- LU Sivan Toledo's recursive : lurec.a
- QR Left Looking : qrll.a
- Cholesky Right Looking : cholrl.a
- Cholesky Top : choltop.a
To test these variants you can type 'make variants-testing'
This will rerun the linear methods testings once per variants and append the short name of the variants to the output files.
You should then see the following files in the TESTING directory: