一种新的积算式的快速算法
A New Fast Computation of a Permanent
摘要:
本文提出了一种快速计算任意方阵积和式的通用算法Store-zechin。它的核心思想是存储、多路复用和递归。也就是说,在递归过程中,不再计算已经计算的一些子项,而是直接用先前的计算结果代替。新算法充分利用计算机存储器和存储数据来加速永久式的计算。分析表明,用Store-Zechin法计算n × n矩阵的积和式需要(2^(n - 1)- 1)n次乘法和(2^(n-1))(n - 2)+ 1次加法,而用Ryser算法进行(2 ^n- 1)n + 1次乘法和(2 ^n-n)(n + 1)- 2次加法,并利用R-N-W算法进行(2^(n - 1))n +(n + 2)次乘法和(2^(n - 1))(n + 1)+(n^2 - n-1)次加法。因此,Store-zechin算法比后两种算法更加优秀,具有更好的应用前景。
英文摘要:
This paper proposes a general algorithm called Store-zechin for quickly computing the permanent of an arbitrary square matrix. Its key idea is storage, multiplexing, and recursion. That is, in a recursive process, some sub-terms which have already been calculated are no longer calculated, but are directly substituted with the previous calculation results. The new algorithm utilizes sufficiently computer memories and stored data to speed the computation of a permanent. The Analyses show that computating the permanent of an n * n matrix by Store-zechin requires (2^(n - 1)- 1)n multiplications and (2^(n-1))(n - 2)+ 1 additions while does (2^n - 1)n + 1 multiplications and (2^n - n)(n + 1)- 2 additions by the Ryser algorithm, and does (2^(n - 1))n + (n + 2) multiplications and (2^(n - 1))(n + 1)+ (n^2 - n -1) additions by the R-N-W algorithm. Therefore, Store-zechin is excellent more than the latter two algorithms, and has a better application prospect.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。