arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.2169cs.SC
收藏

计算机代数中有理数分数幂的表示、化简与显示

Representation, simplification and display of fractional powers of rational numbers in computer algebra

Albert D. Rich, David R. Stoutemyer

摘要:

正有理数的分数幂的简化以及这些数的和、积和幂的简化在开始的代数中教授。这些数字通常可以用多种方式表示,本文将对此进行详细讨论。由于它们是代数数的这样一个受限子集,因此似乎在所有广泛使用的计算机代数系统中必须已经实现了对它们的良好简化。然而,在开始代数教的算法使用整数分解,这可能会消耗大量的计算机代数中经常出现的无法接受的时间。因此,一些系统显然使用了各种特殊的技术,这些技术可能会返回错误的结果,因为没有将两个等效表达式之间的差异简化为0。即使是避免了这个缺陷的系统,对于所有等价的输入表单,也通常不会返回相同的结果,或者返回一个不必要的庞大结果,没有任何其他补偿有用的属性。本文指出了其中的一些缺陷,然后描述了各种替代形式的优点和缺点,以及如何克服这些缺陷,而不需要昂贵的整数分解。

英文摘要:

Simplification of fractional powers of positive rational numbers and of sums, products and powers of such numbers is taught in beginning algebra. Such numbers can often be expressed in many ways, as this article discusses in some detail. Since they are such a restricted subset of algebraic numbers, it might seem that good simplification of them must already be implemented in all widely used computer algebra systems. However, the algorithm taught in beginning algebra uses integer factorization, which can consume unacceptable time for the large numbers that often arise within computer algebra. Therefore some systems apparently use various ad hoc techniques that can return an incorrect result because of not simplifying to 0 the difference between two equivalent such expressions. Even systems that avoid this flaw often do not return the same result for all equivalent such input forms, or return an unnecessarily bulky result that does not have any other compensating useful property. This article identifies some of these deficiencies, then describes the advantages and disadvantages of various alternative forms and how to overcome the deficiencies without costly integer factorization.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑