LAPACK  3.5.0
LAPACK: Linear Algebra PACKage
 All Classes Files Functions Variables Typedefs Macros
README
Go to the documentation of this file.
1  ===============
2  = README File =
3  ===============
4 
5 This README File is for the LAPACK driver variants.
6 It is composed of 5 sections:
7  - Description: contents a quick description of each of the variants. For a more detailed description please refer to LAWN XXX.
8  - Build
9  - Testing
10  - Linking your program
11  - Support
12 
13 Author: Peng DU and Julie LANGOU, May 2008
14 
15 ===============
16 = DESCRIPTION =
17 ===============
18 
19 This directory contains several variants of LAPACK routines in single/double/complex/double complex precision:
20  - [sdcz]getrf with LU Crout Level 3 BLAS version algorithm [2]- Directory: SRC/VARIANTS/lu/CR
21  - [sdcz]getrf with LU Left Looking Level 3 BLAS version algorithm [2]- Directory: SRC/VARIANTS/lu/LL
22  - [sdcz]getrf with Sivan Toledo's recursive LU algorithm [1] - Directory: SRC/VARIANTS/lu/REC
23  - [sdcz]geqrf with QR Left Looking Level 3 BLAS version algorithm [2]- Directory: SRC/VARIANTS/qr/LL
24  - [sdcz]potrf with Cholesky Right Looking Level 3 BLAS version algorithm [2]- Directory: SRC/VARIANTS/cholesky/RL
25  - [sdcz]potrf with Cholesky Top Level 3 BLAS version algorithm [2]- Directory: SRC/VARIANTS/cholesky/TOP
26 
27 References:For a more detailed description please refer to
28  - [1] Toledo, S. 1997. Locality of Reference in LU Decomposition with Partial Pivoting. SIAM J. Matrix Anal. Appl. 18, 4 (Oct. 1997),
29  1065-1081. http://dx.doi.org/10.1137/S0895479896297744
30  - [2]LAWN XXX
31 
32 =========
33 = BUILD =
34 =========
35 
36 These variants are compiled by default in the build process but they are not tested by default.
37 The build process creates one new library per variants in the four arithmetics (singel/double/comple/double complex).
38 The libraries are in the SRC/VARIANTS/LIB directory.
39 
40 Corresponding libraries created in SRC/VARIANTS/LIB:
41  - LU Crout : lucr.a
42  - LU Left Looking : lull.a
43  - LU Sivan Toledo's recursive : lurec.a
44  - QR Left Looking : qrll.a
45  - Cholesky Right Looking : cholrl.a
46  - Cholesky Top : choltop.a
47 
48 
49 ===========
50 = TESTING =
51 ===========
52 
53 To test these variants you can type 'make variants-testing'
54 This will rerun the linear methods testings once per variants and append the short name of the variants to the output files.
55 You should then see the following files in the TESTING directory:
56 [scdz]test_cholrl.out
57 [scdz]test_choltop.out
58 [scdz]test_lucr.out
59 [scdz]test_lull.out
60 [scdz]test_lurec.out
61 [scdz]test_qrll.out
62 
63 ========================
64 = LINKING YOUR PROGRAM =
65 ========================
66 
67 You just need to add the variants methods library in your linking sequence before your lapack libary.
68 Here is a quick example for LU
69 
70 Default using LU Right Looking version:
71  $(FORTRAN) -c myprog.f
72  $(FORTRAN) -o myexe myprog.o $(LAPACKLIB) $(BLASLIB)
73 
74 Using LU Left Looking version:
75  $(FORTRAN) -c myprog.f
76  $(FORTRAN) -o myexe myprog.o $(PATH TO LAPACK/SRC/VARIANTS/LIB)/lull.a $(LAPACKLIB) $(BLASLIB)
77 
78 ===========
79 = SUPPORT =
80 ===========
81 
82 You can use either LAPACK forum or the LAPACK mailing list to get support.
83 LAPACK forum : http://icl.cs.utk.edu/lapack-forum
84 LAPACK mailing list : lapack@cs.utk.edu
these errors have not been linked to actual bugs in the library
Definition: changelog:469
should fix FTBFS on kfreebsd **Upload to unstable *Some routines produced incorrect results in multithreaded environment Thanks to Michael Banck for the May
Definition: changelog:85
liblapack3 Description
Definition: control:33
Intel Corp All rights reserved Redistribution and use in source and binary with or without are permitted provided that the following conditions are this list of conditions and the following disclaimer *Redistributions in binary form must reproduce the above copyright this list of conditions and the following disclaimer in the documentation and or other materials provided with the distribution *Neither the name of Intel Corporation nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS AS IS AND ANY EXPRESS OR IMPLIED BUT NOT LIMITED TO
Definition: LICENSE:4
least squared solutions to linear sets of eigenvector singular value etc It is a very comprehensive and reputable package that has found extensive use in the scientific community These testing programs have been run against the shared library in the lapack package The results have been collected in the files test_results These programs are provided separately here so that the user can test and compare alternate versions of the lapack such as those provided by the ATLAS and the lapack package lapack3 doc lapack3 doc least squared solutions to linear sets of eigenvector singular value etc It is a very comprehensive and reputable package that has found extensive use in the scientific community This package contains the Lapack User s Guide manual in html format Since version
Definition: control:109
lapack
Definition: changelog:208
Choosing ILP64 Data Model To choose ILP64 data use the following const float *The purpose and format of these predicate functions are described in the LAPACK documentation This interface passes the pointer to the corresponding LAPACK routine as it is Be cautious with return values of the logical type if you link against LAPACK compiled with Fortran compiler Whereas all non zero values are treated as TRUE some Fortran compilers may rely on a certain TRUE so you will have to use the same TRUE value in the predicate function to be consistent with LAPACK implementation Implementation Details The current C interface implementation consists of wrappers to LAPACK routines The row major matrices are transposed on entry to and on exit from the LAPACK if needed Top level interfaces additionally allocate deallocate working space on entry to and on exit from the LAPACK routine Because of possible additional a routine called with this interface may require more memory space and run slower than the corresponding LAPACK routine Disclaimer and Legal Information INFORMATION IN THIS DOCUMENT IS PROVIDED IN CONNECTION WITH EXPRESS OR BY ESTOPPEL OR TO ANY INTELLECTUAL PROPERTY RIGHTS IS GRANTED BY THIS DOCUMENT EXCEPT AS PROVIDED IN INTEL S TERMS AND CONDITIONS OF SALE FOR SUCH INTEL ASSUMES NO LIABILITY AND INTEL DISCLAIMS ANY EXPRESS OR IMPLIED RELATING TO SALE AND OR USE OF INTEL PRODUCTS INCLUDING LIABILITY OR WARRANTIES RELATING TO FITNESS FOR A PARTICULAR OR INFRINGEMENT OF ANY COPYRIGHT OR OTHER INTELLECTUAL PROPERTY RIGHT UNLESS OTHERWISE AGREED IN WRITING BY THE INTEL PRODUCTS ARE NOT DESIGNED NOR INTENDED FOR ANY APPLICATION IN WHICH THE FAILURE OF THE INTEL PRODUCT COULD CREATE A SITUATION WHERE PERSONAL INJURY OR DEATH MAY OCCUR Intel may make changes to specifications and product descriptions at any without notice Designers must not rely on the absence or characteristics of any features or instructions marked reserved or undefined Intel reserves these for future definition and shall have no responsibility whatsoever for conflicts or incompatibilities arising from future changes to them The information here is subject to change without notice Do not finalize a design with this information The products described in this document may contain design defects or errors known as errata which may cause the product to deviate from published specifications Current characterized errata are available on request Contact your local Intel sales office or your distributor to obtain the latest specifications and before placing your product order Copies of documents which have an order number and are referenced in this or other Intel may be obtained by or go to http
Definition: README:151
Description LAPACKLIB