KMS Chongqing Institute of Green and Intelligent Technology, CAS
| Two variants of HJLS-PSLQ with applications | |
Feng, Yong ; Chen, Jingwei; Wu, Wenyuan
| |
| 2014 | |
| 摘要 | The HJLS and PSLQ algorithms are the most popular algorithms for finding nontrivial integer relations for several real numbers. It has been already shown that PSLQ is essentially equivalent to HJLS under certain settings. We here call them HJLS-PSLQ. In the present work, we provide two variants of HJLSPSLQ. The first one is a new modification of Bailey and Broadhurst's multi-pair version. We prove the termination of our modification, while the original multi-pair version may not terminate. The second one is an incremental version of HJLS-PSLQ. For those applications requiring to call HJLSPSLQ many times, such as finding the minimal polynomial of an algebraic number without knowing the degree, we show the incremental version is more efficient than HJLS-PSLQ, both theoretically and practically. Copyright 2014 ACM. |
| 语种 | 英语 |
| DOI | 10.1145/2631948.2631965 |
| 会议(录)名称 | 2014 Symposium on Symbolic-Numeric Computation, SNC 2014
 |
| 页码 | 88-96 |
| 通讯作者 | Chen, J. (chenjingwei@cigit.ac.cn) |
| 收录类别 | EI |
| 会议地点 | Shanghai, China |
| 会议日期 | July 28, 2014 - July 31, 2014 |
