Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anderson, E., Bai, Z., et al: LAPACK Users’ Guide Release 2.0. SIAM, hiladelphia (1995)
Dongara, J., DuCroz, J., Duff, I., Hammarling, S.: A Set of Level 3 Basic Linear Algebra Subprograms. ACm Trans. Math. Softw. 16 (1990) 1–17
Dongara, J., Duff, I., Sorensen, D., van der Vorst, H.: Numerical Linear Algebra for High-erformance Computers. SIAM, hiladelphia (1998)
Dongara, J., Waśnievski J.: High-erformance Linear Algebra ackage-LA-ACK90. Report UNIC-98-01, UNI•C, Lyngby, Denmark (1998)
Gustavson, F.G.: Recursion Leads to Automatic Variable Blocking for Dense Linear Algebra Algorithms. IBM J. of Research and Development, 41, No. 6 (1997) 737–755
Nyhoff., L., Leestma, S.: Introduction to Fortran 90 for Engineers and Scientists. Prentice Hall, New Jersey (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Georgiev, K., Waśniewski, J. (2001). Recursive Version of LU Decomposition. In: Vulkov, L., Yalamov, P., Waśniewski, J. (eds) Numerical Analysis and Its Applications. NAA 2000. Lecture Notes in Computer Science, vol 1988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45262-1_38
Download citation
DOI: https://doi.org/10.1007/3-540-45262-1_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41814-6
Online ISBN: 978-3-540-45262-1
eBook Packages: Springer Book Archive