LAWRA - linear algebra with recursive algorithms. Recursion leads to automatic variable blocking for dense linear-algebra algorithms. The recursive way of programming algorithms eliminates using BLAS level 2 during the factorization steps. For this and other reasons recursion usually speeds up the algorithms. The Cholesky factorization algorithms for positive definite matrices and LU factorization for general matrices are formulated. Different storage data formats and recursive BLAS are explained in this paper. Performance graphs of packed and recursive Cholesky algorithms are presented.
Keywords for this software
References in zbMATH (referenced in 3 articles , 1 standard article )
Showing results 1 to 3 of 3.
- Charara, Ali; Ltaief, Hatem; Keyes, David: Redesigning triangular dense matrix computations on GPUs (2016)
- Duff, Iain S.: The impact of high-performance computing in the solution of linear systems: Trends and problems (2000)
- Andersen, B. S.; Gustavson, F.; Karaivanov, A.; Waśniewski, J.; Yalamov, P. Y.: LAWRA -- linear algebra with recursive algorithms. (1999)