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 1220 articles , 4 standard articles )
Showing results 1 to 20 of 1220.
- Bezanson, Jeff; Edelman, Alan; Karpinski, Stefan; Shah, Viral B.: Julia: a fresh approach to numerical computing (2017)
- Birgin, E.G.; Martínez, J.M.: The use of quadratic regularization with a cubic descent condition for unconstrained optimization (2017)
- Bosner, Nela; Karlsson, Lars: Parallel and heterogeneous $m$-Hessenberg-triangular-triangular reduction (2017)
- Gianluca Frison, Dimitris Kouzoupis, Andrea Zanelli, Moritz Diehl: BLASFEO: Basic linear algebra subroutines for embedded optimization (2017) arXiv
- Hadjiantoni, Stella; Kontoghiorghes, Erricos John: Estimating large-scale general linear and seemingly unrelated regressions models after deleting observations (2017)
- Huang, Wen; Absil, P.-A.; Gallivan, K.A.: Intrinsic representation of tangent vectors and vector transports on matrix manifolds (2017)
- Martinsson, Per-Gunnar; Quintana Ortí, Gregorio; Heavner, Nathan; van de Geijn, Robert: Householder QR factorization with randomization for column pivoting (HQRRP) (2017)
- M. N. Gevorkyan, A. V. Demidova, A. V. Korolkova, D. S. Kulyabov, L. A. Sevastianov: The Stochastic Processes Generation in OpenModelica (2017) arXiv
- Pouransari, Hadi; Coulier, Pieter; Darve, Eric: Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation (2017)
- QuanSheng Wu, ShengNan Zhang, Hai-Feng Song, Matthias Troyer, Alexey A. Soluyanov: WannierTools: An open-source software package for novel topological materials (2017) arXiv
- Voronin, Sergey; Martinsson, Per-Gunnar: Efficient algorithms for CUR and interpolative matrix decompositions (2017)
- Zlatev, Zahari; Dimov, Ivan; Faragó, István; Georgiev, Krassimir; Havasi, Ágnes: Stability of the Richardson extrapolation combined with some implicit Runge-Kutta methods (2017)
- 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)
- Adsuara, J.E.; Cordero-Carrión, I.; Cerdá-Durán, P.; Aloy, M.A.: Scheduled relaxation Jacobi method: improvements and applications (2016)
- Aliaga, José I.; Alonso, Pedro; Badía, José M.; Chacón, Pablo; Davidović, Davor; López-Blanco, José R.; Quintana-Ortí, Enrique S.: A fast band-Krylov eigensolver for macromolecular functional motion simulation on multicore architectures and graphics processors (2016)
- Aruliah, D.A.; van Veen, Lennaert; Dubitski, Alex: Algorithm 956: PAMPAC, a parallel adaptive method for pseudo-arclength continuation (2016)
- Bai, ZhaoJun; Li, RenCang; Lin, WenWei: Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods (2016)
- Bestehorn, Michael: Computational Physics. With examples using Fortran. (2016)
- Chen, Yuxin; Keyes, David; Law, Kody J.H.; Ltaief, Hatem: Accelerated dimension-independent adaptive metropolis (2016)
- Diao, Huai-An; Wei, Yimin; Qiao, Sanzheng: Structured condition numbers of structured Tikhonov regularization problem and their estimations (2016)