论文标题
在特征多项式的快速且几乎没有分裂的算法上
On a fast and nearly division-free algorithm for the characteristic polynomial
论文作者
论文摘要
我们回顾了preparata-sarwate算法，一种简单的$ o（n^{3.5}）$方法，用于计算一个仅使用单个$ n $矩阵的特征多项式，决定符和邻接的特征性多项式，决定因素和邻接，仅使用ring ring操作以及小整数的精确部门。该算法是更知名的Faddeev-Leverrier算法的婴儿步长巨型步骤。我们对算法发表了一些评论，并通过经验评估其性能。
We review the Preparata-Sarwate algorithm, a simple $O(n^{3.5})$ method for computing the characteristic polynomial, determinant and adjugate of an $n \times n$ matrix using only ring operations together with exact divisions by small integers. The algorithm is a baby-step giant-step version of the more well-known Faddeev-Leverrier algorithm. We make a few comments about the algorithm and evaluate its performance empirically.
