A detailed study of the degree setting for Gosper's algorithm for indefinite hypergeometric summation is presented. In particular, we discriminate between rational and proper hypergeometric input. As a result, the critical degree bound can be improved in the former case.
Improvement in the stability of the BCGM-OR algorithm
β Scribed by Masahiro Fukumoto; Takeshi Kanai; Hajime Kubota; Shigeo Tsujii
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 233 KB
- Volume
- 83
- Category
- Article
- ISSN
- 1042-0967
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper I introduce a new mathematical tool for dealing with the refinement and/or the improvement of unstructured triangulations: the Longest-Edge Propagation Path associated with each triangle to be either refined and/or improved in the mesh. This is defined as the (finite) ordered list of s
It is possible to summarize the schemes, used in the past to stabilize algorithms, in the form of algorithm models. These models serve as patterns for subsequent applications. Summm'y--There are a number of algorithms in the literature which both theoretically and empirically are known to be only l