The science of deriving dense linear algebra algorithms
Top Cited Papers
- 1 March 2005
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 31 (1) , 1-26
- https://doi.org/10.1145/1055531.1055532
Abstract
In this article we present a systematic approach to the derivation of families of high-performance algorithms for a large set of frequently encountered dense linear algebra operations. As part of the derivation a constructive proof of the correctness of the algorithm is generated. The article is structured so that it can be used as a tutorial for novices. However, the method has been shown to yield new high-performance algorithms for well-studied linear algebra operations and should also be of interest to those who wish to produce best-in-class high-performance codes.Keywords
This publication has 15 references indexed in Scilit:
- Formal derivation of algorithmsACM Transactions on Mathematical Software, 2003
- FLAMEACM Transactions on Mathematical Software, 2001
- A Note On Parallel Matrix InversionSIAM Journal on Scientific Computing, 2001
- An industrial strength theorem prover for a logic based on Common LispIEEE Transactions on Software Engineering, 1997
- A set of level 3 basic linear algebra subprogramsACM Transactions on Mathematical Software, 1990
- An extended set of FORTRAN basic linear algebra subprogramsACM Transactions on Mathematical Software, 1988
- Basic Linear Algebra Subprograms for Fortran UsageACM Transactions on Mathematical Software, 1979
- An axiomatic basis for computer programmingCommunications of the ACM, 1969
- A constructive approach to the problem of program correctnessBIT Numerical Mathematics, 1968
- Assigning meanings to programsPublished by American Mathematical Society (AMS) ,1967