Abstract
This chapter introduces widely used concepts about linear algebra in computer science, as well as information about the standard libraries that gather kernels for linear algebra operations, such as the basic linear algebra subprograms (BLAS) and the linear algebra package (LAPACK). The creation and evolution of these libraries is historically contextualized to help the reader understand their relevance and utility. Moreover, dense and sparse linear algebra are explained. The authors describe the levels of the BLAS library, the motivation behind the hierarchical structure of the BLAS library, and its connection with the LAPACK library. The authors also provide a detailed introduction on some of the most used and popular dense linear algebra kernels or routines, such as GEMM (matrix-matrix multiplication), TRSM (triangular solver), GETRF (LU factorization), and GESV (LU solve). Finally, the authors focus on the most important sparse linear algebra routines and the motivation behind the discussed approaches.
Reference27 articles.
1. Numerical linear algebra on emerging architectures: The PLASMA and MAGMA projects
2. Accelerating Conjugate Gradient using OmpSs
3. Towards an Auto-Tuned and Task-Based SpMV (LASs Library)
4. The university of Florida sparse matrix collection
5. Demmel, J., Dongarra, J. J., Croz, J. D., Greenbaum, A., Hammarling, S., & Sorensen, D. (1987). Prospectus for the development of a linear algebra library for high performance computers. Mathematics and Computer Science Division Report ANL/MCS-TM-97, Argonne National Laboratory, Argonne, IL.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献