计算算法族的一种简单方法
A Simple Methodology for Computing Families of Algorithms
摘要:
发现操作的“好”算法通常被认为是最好留给专家的艺术。如果有一种简单的方法,一种算法,系统地推导出一系列算法及其成本分析,从而可以选择最佳算法,那会怎么样?我们讨论这样一种方法来获得基于循环的算法。用来说明这种方法的例子,多项式的评估,本身很简单,但结果是令人惊讶的非专家的最佳算法:霍纳规则。最后,我们讨论了最新的进展,使这种方法非常实用的域的高性能线性代数软件库。
英文摘要:
Discovering "good" algorithms for an operation is often considered an art best left to experts. What if there is a simple methodology, an algorithm, for systematically deriving a family of algorithms as well as their cost analyses, so that the best algorithm can be chosen? We discuss such an approach for deriving loop-based algorithms. The example used to illustrate this methodology, evaluation of a polynomial, is itself simple yet the best algorithm that results is surprising to a non-expert: Horner's rule. We finish by discussing recent advances that make this approach highly practical for the domain of high-performance linear algebra software libraries.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。