基于知识的分块矩阵表达式的自动生成
Knowledge-Based Automatic Generation of Partitioned Matrix Expressions
摘要:
在一系列的文件已经表明,许多线性代数运算是可能产生家庭的算法,通过以下一个系统的程序。虽然功能强大,但这种方法涉及复杂的代数运算,符号计算和模式匹配,使生成过程具有挑战性,难以手工执行。我们的目标是一个完全自动化的系统,从目标操作的唯一描述创建多个算法,而无需任何人为干预。我们的方法包括三个主要阶段。第一阶段产生整个过程的核心对象,分区矩阵表达式(PME),它建立了如何将目标问题分解为更简单的子问题。在第二阶段的PME检查,以确定谓词,循环不变式,用于建立一个家庭的正确性证明的骨架。在第三阶段和最后一个阶段,实际的算法被构造,使得它们中的每一个都满足其相应的正确性证明。在本文中,我们专注于第一阶段的过程中,自动生成的分块矩阵表达式。特别是,我们讨论的步骤导致一个PME和必要的知识,一个符号系统来执行这些步骤。我们还介绍了Cl1ck,一个用Mathematica编写的原型系统,自动生成PME。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。