高阶行列式计算问题的分治算法探讨

Divide-and-Conquer algorithms for Calculation problem of Higher order Determinant

设计了一种大规模行列式计算问题的分治算法,该算法首先将原行列式的维度扩充到2或者3的幂维度,然后分割为规模相等的独立子问题分别求解。该算法所分解的各独立模块可以并行执行,因此,对于高维度行列式的计算,提供了一种参考途径。

A divide-and-conquer algorithm for large-scale determinant computation problem is designed. First, the dimension of the original determinant is extended to the power dimension of 2 or 3, and then it is divided into independent sub-problems of equal scale. The independent modules decomposed by the algorithm can be executed in parallel, so it provides a reference way for calculating high-dimensional determinants.