Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
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. © 2005 ACM.
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
Karthik Visweswariah, Sanjeev Kulkarni, et al.
IEEE International Symposium on Information Theory - Proceedings
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996