Automatic Derivation of Linear Algebra Algorithms with Application to Control Theory

It is our belief that the ultimate automatic system for deriving linear algebra libraries should be able to generate a set of algorithms starting from the mathematical specification of the target operation only. Indeed, one should be able to visit a website, fill in a form with information about the operation to be performed and about the target architectures, click the SUBMIT button, and receive an optimized library routine for that operation even if the operation has not previously been implemented. In this paper we relate recent advances towards what is probably regarded as an unreachable dream. We discuss the steps necesautomatically obtain an algorithm starting from the mathematical abstract description of the operation to be solved. We illustrate how these steps have been incorporated into two prototype systems and we show the application of one the two systems to a problem from Control Theory: The Sylvester Equation. The output of this system is a description of an algorithm t...

• Type: Conference
• Year: 2004
• Where: PARA
• Authors: Paolo Bientinesi, Sergey Kolos, Robert A. van de Geijn
• Keywords: Applied Computing, Linear Algebra Libraries, Optimized Library Routine, PARA 2004, Target Operation