Research on Algorithms of Number Theory

数论算法研究

• 批准号: 09640061
• 负责人: MAKINO Isao
• 金额: $ 0.32万
• 依托单位: Kogakuin University
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (C)
• 财政年份: 1997
• 资助国家: 日本
• 起止时间: 1997 至 1998
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-09640061/
• 关键词: computer algebra; elementary transcendental function; arbitrary digits; continued fraction

In Symbolic Algebraic Manuplation, time of caluclating elementary trancendental functions are slow than Fortran and C.So we want to fast computing the functions. We used continued fraction and integer computing. In the computing we use only one division. The error is got by Stirling formula. Our computing are firster than Pan GP which is well-known as fast computing language. For example expornetian and tangent are 10 Pines faster and anctangent is 30 or 40 percent faster in 30000 digits. But log is same or a little slower. We will improve the method on computing of continued fraction.

在符号代数运算中，计算初等超越函数的时间比 Fortran 和 C 慢，因此我们希望快速计算函数。我们使用连分数和整数计算。在计算中我们只使用一个除法。误差由斯特林公式求得。我们的计算能力优于众所周知的快速计算语言Pan GP。例如，在 30000 位数字中，expornetian 和 tangent 的速度快 10 Pines，antangent 的速度快 30% 或 40%。但日志是一样的或者慢一点。我们将改进连分数的计算方法。