有理矩阵行列式的精确自适应算法
Towards an exact adaptive algorithm for the determinant of a rational matrix
摘要:
在本文中,我们提出了几个策略,一个有理矩阵的行列式的精确计算。首先,我们利用中国剩余定理和有理重构从有理行列式的模象中恢复出有理行列式。然后,我们展示了一个预处理的行列式,它允许我们跳过合理的重建过程,并重建一个整数的结果。我们比较这些方法与矩阵预处理,使我们能够处理整数而不是有理矩阵。这使我们能够引入整数行列式算法的有理行列式问题。特别地,我们讨论了[9]的自适应行列式算法的适用性,并将其与整数中国剩余方案进行了比较。我们提出了一个分析的复杂性的策略,并评估其实验性能的许多例子。这种经验使我们能够开发一种自适应的策略,将选择最佳的解决方案在运行时间,取决于矩阵的属性。所有策略都在LinBox线性代数库中实现。
英文摘要:
In this paper we propose several strategies for the exact computation of the determinant of a rational matrix. First, we use the Chinese Remaindering Theorem and the rational reconstruction to recover the rational determinant from its modular images. Then we show a preconditioning for the determinant which allows us to skip the rational reconstruction process and reconstruct an integer result. We compare those approaches with matrix preconditioning which allow us to treat integer instead of rational matrices. This allows us to introduce integer determinant algorithms to the rational determinant problem. In particular, we discuss the applicability of the adaptive determinant algorithm of [9] and compare it with the integer Chinese Remaindering scheme. We present an analysis of the complexity of the strategies and evaluate their experimental performance on numerous examples. This experience allows us to develop an adaptive strategy which would choose the best solution at the run time, depending on matrix properties. All strategies have been implemented in LinBox linear algebra library.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。