Abstract
A new Recursive Packed Inverse Calculation Algorithm for symmetric positive definite matrices has been developed. The new Recursive Inverse Calculation algorithm uses minimal storage, n(n + 1)/2, and has nearly the same performance as the LAPACK full storage algorithm using n 2 memory words. New recursive packed BLAS needed for this algorithm have been developed too. Two transformation routines, from the LAPACK packed storage data format to the recursive storage data format were added to the package too.
We present performance measurements on several current architectures that demonstrate improvements over the traditional packed routines.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R.C. Agawal, F.G. Gustavson, and M. Zubair. Exploiting functional parallelism on power2 to design high-performance numerical algorithms. IBM Journal of Research and Development, 38(5):563–576, September 1994.
Bjarne S. Andersen, Fred G. Gustavson, and Jerzy Waśniewski. A recursive formulation of Cholesky facorization of a matrix in packed storage. ACM Transactions on Mathematical Software, 27(2):214–244, June 2001.
B.S. Andersen, F. Gustavson, A. Karaivanov, J. Waśniewski, and P.Y. Yalamov. LAWRA-Linear Algebra with Recursive Algorithms. In R. Wyrzykowski, B. Mochnacki, H. Piech, and J. Szopa, editors, Proceedings of the 3th International Conference on Parallel Processing and Applied Mathematics, PPAM’99, pages 63–76, Kazimierz Dolny, Poland, 1999. Technical University of Czȩstochowa.
E. Anderson, Z. Bai, C. Bischof, L. S. Blackford, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, and D. Sorensen. LAPACK Users’ Guide. Society for Industrial and Applied Mathematics, Philadelphia, PA, third edition, 1999.
Vincent A. Barker, L. Susan Blackford, Jack J. Dongarra, Jeremy Du Croz, Sven Hammarling, Minka Marinova, Jerzy Waśniewski, and Plamen Yalamov. LAPACK95 Users’ Guide. Society for Industrial and Applied Mathematics, Philadelphia, PA, first edition, 2001.
J. Bilmes, K. Asanović, C.W. Chin, and J. Demmel. Optimizing Matrix Multiply Using PHIPAC: a Portable, High-Performance, ANSI C Coding Methodology. In Proceedings of the International Conference on Supercomputing, Vienna, Austria, Jul 1997. ACM SIGARC.
J.W. Demmel. Applied Numerical Linear Algebra. SIAM, Philadelphia, 1997.
J. Dongarra, J. Du Croz, I. S. Duff, and S. Hammarling. A Set of Level 3 Basic Linear Algebra Subprograms. A CM Trans. Math. Soft., 16(1):1–17, March 1990.
J. Dongarra, J. Du Croz, S. Hammarling, and Richard J. Hanson. An Extended Set of Fortran Basic Linear Algebra Subroutines. ACM Trans. Math. Soft., 14(1):1–17, March 1988.
J. Dongarra et al. BLAS (Basic Linear Algebra Subprograms). http://www.netlib.org/blas/. Ongoing Projects at the Innovative Computing Laboratory, Computer Science Department, University of Tennessee at Knoxville, USA.
E. Elmroth and F. Gustavson. Applying Recursion to Serial and Parallel QR Factorization Leads to Better Performance. IBM Journal of Research and Development, 44(4):605–624, 2000.
G. Golub and C. F. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, MD, third edition, 1996.
A. Gupta, F. Gustavson, A. Karaivanov, J. Waśniewski, and P. Yalamov. Experience with a Recursive Perturbation Based Algorithm for Symmetric Indefinite Linear Systems. In I. Duff, editor, EuroPar’99 Conference Proceedings, Toulouse, France, September 1999.
F. Gustavson, A. Henriksson, I. Jonsson, B. Kågström, and P. Ling. Recursive Blocked Data Formats and BLAS’ for Dense Linear Algebra Algorithms. In B. Kågström, J. Dongarra, E. Elmroth, and J. Waśniewski, editors, Proceedings of the 4th International Workshop, Applied Parallel Computing, Large Scale Scientific and Industrial Problems, PARA’ 98, number 1541 in Lecture Notes in Computer Science Number, pages 195–206, Umeå, Sweden, June 1998. Springer.
F. Gustavson, A. Henriksson, I. Jonsson, B. Kågström, and P. Ling. Superscalar GEMM-based Level 3 BLAS-The On-going Evolution of Portable and High-Performance Library. In B. Kågström, J. Dongarra, E. Elmroth, and J. Waśniewski, editors, Proceedings of the 4th International Workshop, Applied Parallel Computing, Large Scale Scientific and Industrial Problems, PARA’98, number 1541 in Lecture Notes in Computer Science Number, pages 207–215, Umeå, Sweden, June 1998. Springer.
F. Gustavson, A. Karaivanov, M.I. Marinova, J. Waśniewski, and P. Yalamov. A Fast Minimal Storage Symmetric Indefinite Solver. In T. Sørevik, F. Manne, R. Moe, and A.H. Gebremedhin, editors, Proceedings of the 5th International Workshop, PARA’2000, Applied Parallel Computing, number 1947 in Lecture Notes in Computer Science Number, pages 104–113, Bergen, Norway, June 2000. Springer.
F. Gustavson, A. Karaivanov, J. Waśniewski, and P. Yalamov. A Columnwise Recursive Perturbation Based Algorithm for Symmetric Indefinite Linear Systems. In PDPTA’99 Conference Proceedings, Las Vegas, USA, June 1999.
F.G. Gustavson. Recursion Leads to Automatic Variable Blocking for Dense Linear-Algebra Algorithms. IBM Journal of Research and Development, 41(6), November 1997.
N. J. Higham. Accuracy and Stability of Numerical Algorithms. SIAM, 1996.
IBM. Engineering and Scientific Subroutine Library for AIX, Version 3, Volume 1 edition, December 1997. Pub. number SA22-7272-0.
B. Kågström, P. Ling, and C. Van Loan. GEMM-based level 3 BLAS: High-performance model implementations and performance evaluation benchmark. Technical Report UMINF 95-18, Department of Computing Science, Umea University, 1995. Submitted to ACM Trans. Math. Softw.
B. Kågström, P. Ling, and C. Van Loan. GEMM-based level 3 BLAS: High-Performance Model Implementations and Performance Evaluation Benchmark. A CM Trans. Math. Software, 24(3):268–302, 1998.
C. L. Lawson, R. J. Hanson, D. Kincaid, and F. T. Krogh. Basic Linear Algebra Subprograms for Fortran Usage. ACM Trans. Math. Soft., 5:308–323, 1979.
M. Metcalf and J. Reid. Fortran 90/95 Explained. Oxford University Press, Oxford, UK, second edition, 1999.
S. Toledo. Locality of Reference in LU Decomposition with Partial Pivoting. SIAM Journal of Matrix Analysis and Applications, 18(4):1065–1081, 1997.
L.N. Trefethen and D. Bau. Numerical Linear Algebra. SIAM, Philadelphia, 1997.
J. Waśniewski, B.S. Andersen, and F. Gustavson. Recursive Formulation of Cholesky Algorithm in Fortran 90. In B. Kågström, J. Dongarra, E. Elmroth, and J. Waśniewski, editors, Proceedings of the 4th International Workshop, Applied Parallel Computing, Large Scale Scientific and Industrial Problems, PARA’ 98, number 1541 in Lecture Notes in Computer Science Number, pages 574–578, Umeå, Sweden, June 1998. Springer.
R.C. Whaley, A. Petitet, and J. Dongarra. ATLAS: Automatically Tuned Linear Algebra Software. http://www.netlib.org/atlas/, 2000. University of Tennessee at Knoxville, Tennessee, USA.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andersen, B.S., Gunnels, J.A., Gustavson, F., Waśniewski, J. (2002). A Recursive Formulation of the Inversion of Symmetric Positive Definite Matrices in Packed Storage Data Format. In: Fagerholm, J., Haataja, J., Järvinen, J., Lyly, M., Råback, P., Savolainen, V. (eds) Applied Parallel Computing. PARA 2002. Lecture Notes in Computer Science, vol 2367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48051-X_29
Download citation
DOI: https://doi.org/10.1007/3-540-48051-X_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43786-4
Online ISBN: 978-3-540-48051-8
eBook Packages: Springer Book Archive