Abstract
Fortran 90 allows writing recursive procedures (see [7]). Recursion leads to automatic variable blocking for dense linear-algebra algorithms (see [5, 8]). The recursive way of programming algorithms eliminate the use of BLAS level 2 in the factorization steps. For this and other reasons recursion usually speed up the algorithms.
The formulation of the Cholesky factorization algorithm using recursion in Fortran 90 is presented in this paper.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. Anderson, Z. Bai, C. H. Bischof, J. Demmel, J. J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostrouchov and D. C. Sorensen. LAPACK Users’ Guide Release 2.0 SIAM, Philadelphia, 1995.
J.W. Demmel. Applied Numerical Linear Algebra. SIAM, Philadelphia, 1997.
J. Dongarra, and J. Waśniewski. High Performance Linear Algebra Package—LAPACK90. Lawn number 134: http://www.netlib.org/lapack/lawns/lawn134.ps Report UNIC-98-01, UNI•C, Lyngby, Denmark, 1998. Report ut-cs-98-384, University of Tennessee, Computer Science Department, Knoxville, April, 1998.
G.H. Golub and C.F. Van Loan. Matrix Computations. Johns Hopkins University Press Baltimore, MD, Any ed. from 1983.
F.G. Gustavson. Recursive Leads to Automatic Variable Blocking for Dense Linear-Algebra Algorithms. IBM Journal of Research and Development, Volume 41, Number 6, November 1997.
F.G. Gustavson, A. Henriksson, I. Jonsson, B. Kågström and P. Ling. Superscalar GEMM-based Level 3 BLAS—The On-going Evolution of a Portable and High-Performance Library. This Proceedings, Springer Verlag, 1998.
S. Metcalf and J. Reid. Fortran 90/95 Explained. Oxford, New York, Tokyo, Oxford University Press, 1996.
S. Toledo. Locality of Reference in LU Decomposition with Partial Pivoting. SIAM Journal on Matrix Analysis and Applications, vol. 18, No. 4, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Waśniewski, J., Andersen, B.S., Gustavson, F. (1998). Recursive formulation of Cholesky algorithm in Fortran 90. In: Kågström, B., Dongarra, J., Elmroth, E., Waśniewski, J. (eds) Applied Parallel Computing Large Scale Scientific and Industrial Problems. PARA 1998. Lecture Notes in Computer Science, vol 1541. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0095384
Download citation
DOI: https://doi.org/10.1007/BFb0095384
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65414-8
Online ISBN: 978-3-540-49261-0
eBook Packages: Springer Book Archive