Typing linear algebra: A biproduct-oriented approach

Abstract : Interested in formalizing the generation of fast running code for linear algebra applications, the authors show how an index-free, calculational approach to matrix algebra can be developed by regarding matrices as morphisms of a category with biproducts. This shifts the traditional view of matrices as indexed structures to a type-level perspective analogous to that of the pointfree algebra of programming. The derivation of fusion, cancellation and abide laws from the biproduct equations makes it easy to calculate algorithms implementing matrix multiplication, the central operation of matrix algebra, ranging from its divide-and-conquer version to its vectorization implementation. From errant attempts to learn how particular products and coproducts emerge from biproducts, not only blocked matrix algebra is rediscovered but also a way of extending other operations (e.g. Gaussian elimination) blockwise, in a calculational style, is found. The prospect of building biproduct-based type checkers for computer algebra systems such as MatlabTM is also considered.
Liste complète des métadonnées

Littérature citée [39 références]  Voir  Masquer  Télécharger

Contributeur : Hugo Daniel Macedo <>
Soumis le : mardi 17 décembre 2013 - 14:05:39
Dernière modification le : vendredi 25 mai 2018 - 12:02:06
Document(s) archivé(s) le : lundi 17 mars 2014 - 23:16:09


Fichiers produits par l'(les) auteur(s)




Hugo Macedo, José Oliveira. Typing linear algebra: A biproduct-oriented approach. Science of Computer Programming, Elsevier, 2013, 78 (11), pp.2160-2191. 〈http://www.sciencedirect.com/science/article/pii/S0167642312001402〉. 〈10.1016/j.scico.2012.07.012〉. 〈hal-00919866〉



Consultations de la notice


Téléchargements de fichiers