Knowledge-Based Automatic Generation of Partitioned Matrix Expressions
In a series of papers it has been shown that for many linear algebra operations it is possible to generate families of algorithms by following a systematic procedure. Although powerful, such a methodology involves complex algebraic manipulation, symbolic computations and pattern matching, making the generation a process challenging to be performed by hand. We aim for a fully automated system that from the sole description of a target operation creates multiple algorithms without any human intervention. Our approach consists of three main stages. The first stage yields the core object for the entire process, the Partitioned Matrix Expression (PME), which establishes how the target problem may be decomposed in terms of simpler sub-problems. In the second stage the PME is inspected to identify predicates, the Loop-Invariants, to be used to set up the skeleton of a family of proofs of correctness. In the third and last stage the actual algorithms are constructed so that each of them satisfies its corresponding proof of correctness. In this paper we focus on the first stage of the process, the automatic generation of Partitioned Matrix Expressions. In particular, we discuss the steps leading to a PME and the knowledge necessary for a symbolic system to perform such steps. We also introduce cl1ck, a prototype system written in Mathematica that generates PMEs automatically.
KeywordsCanonical Form Pattern Match Symbolic System Cholesky Factorization Triangular System
Unable to display preview. Download preview PDF.
- 1.FLAME Project: FLAME Online Reference, http://z.cs.utexas.edu/wiki/flame.wiki/
- 6.Whaley, R.C., Dongarra, J.: Automatically tuned linear algebra software. In: SuperComputing 1998: High Performance Networking and Computing (1998)Google Scholar
- 8.Püschel, M., Moura, J.M.F., Johnson, J., Padua, D., Veloso, M., Singer, B., Xiong, J., Franchetti, F., Gacic, A., Voronenko, Y., Chen, K., Johnson, R.W., Rizzolo, N.: SPIRAL: Code generation for DSP transforms. Proceedings of the IEEE 93(2), 232–275 (2005); special issue on “Program Generation, Optimization, and Adaptation”Google Scholar
- 10.Bientinesi, P., Quintana-Ortí, E.S., van de Geijn, R.: FLAME lab: A farewell to indices. FLAME Working Note #11. Technical Report TR-2003-11, The University of Texas at Austin, Department of Computer Sciences (April 2003)Google Scholar
- 12.Poulson, J., van de Geijn, R., Bennighof, J.: Parallel algorithms for reducing the generalized hermitian-definite eigenvalue problem. FLAME Working Note #56. Technical Report TR-11-05, The University of Texas at Austin, Department of Computer Sciences (February 2011)Google Scholar
- 13.Bientinesi, P., van de Geijn, R.: A goal-oriented and modular approach to stability analysis. SIAM Journal on Matrix Analysis and Applications (to appear, 2011)Google Scholar
- 14.Wolfram Research: Mathematica Reference Guide, http://reference.wolfram.com/mathematica/
- 15.Gries, D., Schneider, F.B.: A Logical Approach to Discrete Math. Texts and Monographs in Computer Science. Springer, Heidelberg (1992)Google Scholar