Abstract
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 necessary to automatically 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 that can then be directly translated into code via API’s that we have developed. The description can also be passed as input to a parallel performance analyzer to obtain optimized parallel routines [5].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bartels, R.H., Stewart, G.W.: Solution of the matrix equation AX + XB = C. Commun. ACM 15(9), 820–826 (1972)
Bientinesi, P., Gunnels, J.A., Gustavson, F.G., Henry, G.M., Myers, M.E., Quintana-Orti, E.S., van de Geijn, R.A.: Rapid development of high-performance linear algebra libraries. In: Dongarra, J., Madsen, K., Waśniewski, J. (eds.) PARA 2004. LNCS, vol. 3732, pp. 376–384. Springer, Heidelberg (2006) (to appear)
Bientinesi, P., Gunnels, J.A., Myers, M.E., Quintana-Ortí, E.S., van de Geijn, R.A.: The science of deriving dense linear algebra algorithms. ACM Transactions on Mathematical Software 31(1) (March 2005)
Kågström, B., Poromaa, P.: Lapack-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs. ACM Transactions on Mathematical Software 22(1), 78–103 (1996)
Gunnels, J.: A Systematic Approach to the Design and Analysis of Parallel Dense Linear Algebra Algorithms. PhD thesis, The University of Texas at Austin, Department of Computer Sciences. Technical Report CS-TR-01-44 (December 2001)
Gunnels, J.A., Gustavson, F.G., Henry, G.M., van de Geijn, R.A.: FLAME: Formal linear algebra methods environment. ACM Transactions on Mathematical Software 27(4), 422–455 (2001)
Jonsson, I.: Recursive Blocked Algorithms, Data Structures, and High-Performance Software for Solving Linear Systems and Matrix Equations. PhD thesis, Dept. Computing Science, Umeå University, SE-901 87, Sweden (2003)
Jonsson, I., Kågström, B.: Recursive blocked algorithms for solving triangular systems— part i: one-sided and coupled Sylvester-type matrix equations. ACM Transactions on Mathematical Software 28(4), 392–415 (2002)
Quintana-Ortí, E.S., van de Geijn, R.A.: Formal derivation of algorithms: The triangular Sylvester equation. TOMS 29(2), 218–243 (2003)
van de Geijn, R.A.: Using PLAPACK: Parallel Linear Algebra Package. MIT Press, Cambridge (1997)
Wolfram, S.: The Mathematica Book, 3rd edn. Cambridge University Press, Cambridge (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bientinesi, P., Kolos, S., van de Geijn, R.A. (2006). Automatic Derivation of Linear Algebra Algorithms with Application to Control Theory. In: Dongarra, J., Madsen, K., Waśniewski, J. (eds) Applied Parallel Computing. State of the Art in Scientific Computing. PARA 2004. Lecture Notes in Computer Science, vol 3732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558958_46
Download citation
DOI: https://doi.org/10.1007/11558958_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29067-4
Online ISBN: 978-3-540-33498-9
eBook Packages: Computer ScienceComputer Science (R0)