LAPACK
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.
This software is also referenced in ORMS.
This software is also referenced in ORMS.
Keywords for this software
References in zbMATH (referenced in 1137 articles , 4 standard articles )
Showing results 1 to 20 of 1137.
Sorted by year (- Abdelfattah, A.; Anzt, H.; Dongarra, J.; Gates, M.; Haidar, A.; Kurzak, J.; Luszczek, P.; Tomov, S.; Yamazaki, I.; YarKhan, A.: Linear algebra software for large-scale accelerated multicore computing (2016)
- Bestehorn, Michael: Computational Physics. With examples using Fortran. (2016)
- Diao, Huai-An; Wei, Yimin; Qiao, Sanzheng: Structured condition numbers of structured Tikhonov regularization problem and their estimations (2016)
- Dopico, Froilán; Uhlig, Frank: Computing matrix symmetrizers. II: New methods using eigendata and linear means; a comparison. (2016)
- Drmač, Zlatko; Gugercin, Serkan: A new selection operator for the discrete empirical interpolation method -- improved a priori error bound and extensions (2016)
- Gaudreau, P.; Slevinsky, R.; Safouhi, H.: The double exponential sinc collocation method for singular Sturm-Liouville problems (2016)
- Hager, William W.; Zhang, Hongchao: Projection onto a polyhedron that exploits sparsity (2016)
- Kiusalaas, Jaan: Numerical methods in engineering with MATLAB. (2016)
- Lawrence, Piers W.; van Barel, Marc; van Dooren, Paul: Backward error analysis of polynomial eigenvalue problems solved by linearization (2016)
- Li, Hui; Zhang, Hongwu; Zheng, Yonggang; Zhang, Liang: A peridynamic model for the nonlinear static analysis of truss and tensegrity structures (2016)
- Michailidis, Panagiotis D.; Margaritis, Konstantinos G.: Scientific computations on multi-core systems using different programming frameworks (2016)
- Napov, Artem; Li, Xiaoye S.: An algebraic multifrontal preconditioner that exploits the low-rank property. (2016)
- Routh, Ong U.: Matrix algorithms in MATLAB (2016)
- Schweizer, Wolfgang: MATLAB compact (2016)
- Shao, Meiyue; da Jornada, Felipe H.; Yang, Chao; Deslippe, Jack; Louie, Steven G.: Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem (2016)
- Trébuchet, Philippe; Mourrain, Bernard; Bucero, Marta Abril: Border basis for polynomial system solving and optimization (2016)
- White, Robert E.: Computational mathematics. Models, methods, and analysis with MATLAB and MPI (2016)
- Zacate, Matthew O.; Evenson, William E.: Stochastic hyperfine interactions modeling library -- version 2 (2016)
- Al-Mohy, Awad H.; Higham, Nicholas J.; Relton, Samuel D.: New algorithms for computing the matrix sine and cosine separately or simultaneously (2015)
- Baboulin, M.; Dongarra, J.; Lacroix, R.: Computing least squares condition numbers on hybrid multicore/GPU systems (2015)