Four algorithms for the computation of convergents of generalized continued fractions are defined and studied with respect to numerical effort, error propagation, and practical aspects. Some conclusions from numerical tests are deduced.
A generalization of the algorithm for continued fractions related to the algorithm of Viggo Brunn
โ Scribed by E. V. Podsypanin
- Publisher
- Springer US
- Year
- 1981
- Tongue
- English
- Weight
- 498 KB
- Volume
- 16
- Category
- Article
- ISSN
- 1573-8795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A description is given of a means of implementing a parallel version of the continued fraction integer factoring algorithm (CFRAC) of Morrison and Brillhart on the Massively Parallel Processor. A case study is provided for the factorization of a 60-digit composite factor of 24o5 -1, and some further
The following problem from reliability theory is considered. Given a disjunctive normal form (DNF) ~0 = ~ol v ... v ~or, we want to find a representation of ~0 into disjoint formulas, i.e. find formulas th,..., qs such that q~ = ql v .-. v q~ and t/i/x r b = \_1\_ whenever i ยขj. In addition, the for
The grammar problem, a generalization of the single-source shortest-path prob-ลฝ ลฝ . ลฝ . . lem introduced by D. E. Knuth Inform. Process. Lett. 6 1 1977 , 1แ5 is to compute the minimum-cost derivation of a terminal string from each nonterminal of a given context-free grammar, with the cost of a deriv