A set of level 3 basic linear algebra subprograms
ACM Transactions on Mathematical Software (TOMS)
Introduction to Fortran 90 for engineers and scientists
Introduction to Fortran 90 for engineers and scientists
Recursion leads to automatic variable blocking for dense linear-algebra algorithms
IBM Journal of Research and Development
Numerical Linear Algebra for High Performance Computers
Numerical Linear Algebra for High Performance Computers
| Hi-index | 0.00 |
The effective use of the cache memories of the processors is a key component of obtaining high performance algorithms and codes, including here algorithms and codes for parallel computers with shared and distributed memories. The recursive algorithms seem to be a tool for such an action. Unfortunately, worldwide used programming language FORTRAN 77 does not allow explicit recursion.The paper presents a recursive version of LU factorization algorithm for general matrices using FORTRAN 90. FORTRAN 90 allows writing recursive procedures and the recursion is automatic as it is a duty of the compiler. Usually, recursion speeds up the algorithms. The recursive versions reported in the paper are some modification of the LAPACK algorithms and they transform some basic linear algebra operations from BLAS level 2 to BLAS level 3.