LAPACK is written in Fortran 90 and provides routines for solving systems of simultaneous linear equations, least-squares solutions of linear systems of equations, eigenvalue problems, and singular value problems. The associated matrix factorizations (LU, Cholesky, QR, SVD, Schur, generalized Schur) are also provided, as are related computations such as reordering of the Schur factorizations and estimating condition numbers. Dense and banded matrices are handled, but not general sparse matrices. In all areas, similar functionality is provided for real and complex matrices, in both single and double precision.
The original goal of the LAPACK project was to make the widely used EISPACK and LINPACK libraries run efficiently on shared-memory vector and parallel processors. On these machines, LINPACK and EISPACK are inefficient because their memory access patterns disregard the multi-layered memory hierarchies of the machines, thereby spending too much time moving data instead of doing useful floating-point operations. LAPACK addresses this problem by reorganizing the algorithms to use block matrix operations, such as matrix multiplication, in the innermost loops. These block operations can be optimized for each architecture to account for the memory hierarchy, and so provide a transportable way to achieve high efficiency on diverse modern machines. We use the term "transportable" instead of "portable" because, for fastest possible performance, LAPACK requires that highly optimized block matrix operations be already implemented on each machine.
LAPACK routines are written so that as much as possible of the computation is performed by calls to the Basic Linear Algebra Subprograms (BLAS). LAPACK is designed at the outset to exploit the Level 3 BLAS — a set of specifications for Fortran subprograms that do various types of matrix multiplication and the solution of triangular systems with multiple right-hand sides. Because of the coarse granularity of the Level 3 BLAS operations, their use promotes high efficiency on many high-performance computers, particularly if specially coded implementations are provided by the manufacturer.
Highly efficient machine-specific implementations of the BLAS are available for many modern high-performance computers. For details of known vendor- or ISV-provided BLAS, consult the BLAS FAQ. Alternatively, the user can download ATLAS to automatically generate an optimized BLAS library for the architecture. A Fortran 77 reference implementation of the BLAS is available from netlib; however, its use is discouraged as it will not perform as well as a specifically tuned implementation.
Since 2010, this material is based upon work supported by the National Science Foundation under Grant No. NSF-OCI-1032861. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation (NSF). Until 2006, this material was based upon work supported by the National Science Foundation under Grant No. ASC-9313958, NSF-0444486 and DOE Grant No. DE-FG03-94ER25219. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation (NSF) or the Department of Energy (DOE).
LAPACK is a freely-available software package. It is available from netlib via anonymous ftp and the World Wide Web at http://www.netlib.org/lapack . Thus, it can be included in commercial software packages (and has been). We only ask that proper credit be given to the authors.
The license used for the software is the modified BSD license, see:
Like all software, it is copyrighted. It is not trademarked, but we do ask the following:
If you modify the source for these routines we ask that you change the name of the routine and comment the changes made to the original.
We will gladly answer any questions regarding the software. If a modification is done, however, it is the responsibility of the person who modified the routine to provide support.
LAPACK, version 3.6.0
Standard C language APIs for LAPACK
collaboration LAPACK and INTEL Math Kernel Library Team
LAPACK for Windows
LAPACK is built under Windows using Cmake the cross-platform, open-source build system. The new build system was developed in collaboration with Kitware Inc.
A dedicated website (http://icl.cs.utk.edu/lapack-for-windows/lapack) is available for Windows users.
You will find information about your configuration need.
You will be able to download BLAS, LAPACK, LAPACKE pre-built libraries.
You will learn how you can directly run LAPACKE from VS Studio (just C code, no Fortran!!!). LAPACK now offers Windows users the ability to code in C using Microsoft Visual Studio and link to LAPACK Fortran libraries without the need of a vendor-supplied Fortran compiler add-on. To get more information, please refer to lawn 270.
You will get step by steps procedures Easy Windows Build.
The LAPACK SVN repository is open for read-only for our users to be able to get the latest bug fixed.
svn co https://icl.cs.utk.edu/svn/lapack-dev/lapack/trunk
LAPACK is a community-wide effort.LAPACK relies on many contributors, and we would like to acknowledge their outstanding work. Here is the list of LAPACK contributors since 1992.
If you are wishing to contribute, please have a look at the LAPACK Program Style. This document has been written to facilitate contributions to LAPACK by documenting their design and implementation guidelines.
LAPACK Project Software Grant and Corporate Contributor License Agreement (“Agreement”) [Download]
Contributions are always welcome and can be sent to the LAPACK team.
The LAPACK Release Notes contain the history of the modifications made to the LAPACK library between each new version.
Improvements and Bugs
LAPACK is a currently active project, we are striving to bring new improvements and new algorithms on a regular basis. Here is the list of the improvement since LAPACK 3.0.
Here is the list of the bugs (corrected, confirmed and to be confirmed) since LAPACK 3.0.
Consult LAPACK Frequently Asked Questions.
Please contribute to our FAQ if you feel some questions are missing by emailing the LAPACK team.
The LAPACK User Forum is also a good source to find answers.
Browse, Download LAPACK routines with on-line documentation browser
Here you will be able to browse through the many LAPACK functions, and also download individual routine plus its dependency.
To access a routine, either use the search functionality or go through the different modules.
Please follow the instructions of the README to install the LAPACK manpages on your machine.
The LAPACK team would like to thank Sylvestre Ledru for helping us maintaing those manpages and Albert from the Doxygen team.
LAWNS: LAPACK Working Notes
Version 1.0 : February 29, 1992
Revised, Version 1.0a: June 30, 1992
Revised, Version 1.0b: October 31, 1992
Revised, Version 1.1: March 31, 1993
Version 2.0: September 30, 1994
Version 3.0: June 30, 1999
Update, Version 3.0: October 31, 1999
Update, Version 3.0: May 31, 2000
Version 3.1.0: November 12, 2006
Version 3.1.1: February 26, 2007
Version 3.2: November 18, 2008
Version 3.2.1: April 17, 2009
Version 3.2.2: June 30, 2010
Version 3.3.0: November 14, 2010
Version 3.3.1: April 18, 2011
Version 3.4.0: November 11, 2011
Version 3.4.1: April 20, 2012
Version 3.4.2: September 25, 2012
Version 3.5.0: November 19, 2013
Version 3.6.0: November 15, 2015
LAPACK, version 3.6.0
LAPACK, version 3.5.0
LAPACK, version 3.4.2
LAPACK, version 3.4.0
LAPACK version 3.3.0
LAPACK version 3.2 with CMAKE package
LAPACK version 3.1.1 with manpages and html
LAPACK version 3.1.1
LAPACK version 3.1
LAPACK version 3.0 + UPDATES
Updated: May 31, 2000
LAPACK UPDATES for version 3.0
Instructions: cd LAPACK; gunzip -c update.tgz | tar xvf -
Updated: May 31, 2000
Vendors LAPACK library
Please report to our FAQ to know the list of the current vendors implementations.
CLAPACK is an f2c’ed conversion of LAPACK
ScaLAPACK is a distributed-memory implementation of LAPACK
The Parallel Linear Algebra for Scalable Multi-core Architectures (PLASMA) project aims to address the critical and highly disruptive situation that is facing the Linear Algebra and High Performance Computing community due to the introduction of multi-core architectures.
PLASMA’s ultimate goal is to create software frameworks that enable programmers to simplify the process of developing applications that can achieve both high performance and portability across a range of new architectures.
The development of programming models that enforce asynchronous, out of order scheduling of operations is the concept used as the basis for the definition of a scalable yet highly efficient software framework for Computational Linear Algebra applications.
The MAGMA (Matrix Algebra on GPU and Multicore Architectures) project aims to develop a dense linear algebra library similar to LAPACK but for heterogeneous/hybrid architectures, starting with current "Multicore+GPU" systems.
The MAGMA research is based on the idea that, to address the complex challenges of the emerging hybrid environments, optimal software solutions will themselves have to hybridize, combining the strengths of different algorithms within a single framework. Building on this idea, we aim to design linear algebra algorithms and frameworks for hybrid manycore and GPUs systems that can enable applications to fully exploit the power that each of the hybrid components offers.
Related older Projects
Subdirectory containing CCI (Call Conversion Interface) for LAPACK/ESSL. See lawn82 for more information.