Abstract
A good quality numerical software is very important in many industrial applications. Here “quality” means:
-
the practical problem is solved as fast as possible, and
-
with an acceptable error (as is well-known computers make roundoff errors which can spoil the result significantly).
Therefore, some companies develop libraries of computer programs which are ready to use, and where the “best” present algorithms are implemented. One such library is LAPACK (Linear Algebra PACKage) [4] which is the basis for highly tuned libraries on different architectures, and BLAS (Basic Linear Algebra Subroutines) [5] in which some basic matrix and vector operations are implemented, and which is heavily used in LAPACK.
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
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.
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.
B.S. Andersen, F. Gustavson, and J. Waśniewski. Formulation of the Cholesky Factorization Operating on a Matrix in Packed Storage Form. http://lawra.uni-c.dk/lawra/pspapers/bjarnepaper99.ps. The paper is sent to be published in ACM TOMS.
E. Anderson, Z. Bai, C. Bischof, 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.
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.
J. J. Dongarra, J. R. Bunch, C. B. Moler, and G. W. Stewart. LINPACK Users’ Guide. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1979.
J. J. Dongarra, J. Du Croz, I. S. Duff, and S. Hammarling. A set of Level 3 Basic Linear Algebra Subprograms. ACM Trans. Math. Soft., 16(1):1–28, March 1990.
E. Elmroth and F. Gustavson. New Serial and Parallel Recursive QR Factorization Algorithms for SMP Systems. 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 120–128, Umeå, Sweden, June 1998. Springer.
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.G. Gustavson. Recursion leads to automatic variable blocking for dense linear-algebra algorithms. IBM Journal of Research and Development, 41(6), November 1997.
IBM. Engineering and Scientific Subroutine Library for AIX, Version 3, Volume 1 edition, December 1997. Pub. number SA22-7272-0.
IBM. XL Fortran AIX, Language Reference, first edition, Dec 1997. Version 5, Release 1.
B. Kågström, P. Ling, and C. Van Loan. GEMM-based level 3 BLAS: High-Performance Model Implementations and Performance Evaluation Benchmark. ACM Trans. Math. Software, 24(3):268–302, 1998.
M. Metcalf and J. Reid. FORTRAN 90 Explained. Oxford University Press, Oxford, UK, first edition, 1990.
S. Toledo. Locality of Reference in LU Decomposition with Partial Pivoting. SIAM Journal of Matrix Analysis and Applications, 18(4), 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 and J. Dongarra. Automatically Tuned Linear Algebra Software (ATLAS). http://www.netlib.org/atlas/, 1999. University of Tennessee at Knoxville, Tennessee, USA.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gustavson, F., Waśniewski, J. (2000). LAWRA Workshop Linear Algebra with Recursive Algorithms http://lawra.uni-c.dk/lawra/. In: Bubak, M., Afsarmanesh, H., Hertzberger, B., Williams, R. (eds) High Performance Computing and Networking. HPCN-Europe 2000. Lecture Notes in Computer Science, vol 1823. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45492-6_78
Download citation
DOI: https://doi.org/10.1007/3-540-45492-6_78
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67553-2
Online ISBN: 978-3-540-45492-2
eBook Packages: Springer Book Archive