✦ LIBER ✦

The Splitting Algorithm for Egyptian Fractions

✍ Scribed by L. Beeckmans

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 406 KB
Volume: 43
Category: Article
ISSN: 0022-314X
DOI: 10.1006/jnth.1993.1015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fractional splitting algorithm for non

A fractional splitting algorithm for nonoverlapping domain decomposition for parabolic problem

✍ Daoud S. Daoud; D. Subasi 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB

Algorithm for splitting planar faces

✍ Jiri Kripac 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 437 KB

An algorithm for calculating continued f

An algorithm for calculating continued fractions

✍ Jozef Mikloško 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 208 KB

A new algorithm is described in the paper for calculating continued fractions. The conditions are given under which this algorithm is faster than the hitherto fastest algorithm for handling this problem. Also the interrelation between the suggested algorithm and that for calculatinga tridiagonal sys

An algorithm for calculating generalized

An algorithm for calculating generalized continued fractions

✍ M.G. de Bruin 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Perron fractions : an algorithm for comp

Perron fractions : an algorithm for computing the Padé table

✍ J.H. McCabe 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 263 KB

Performance bounds on the splitting algo

Performance bounds on the splitting algorithm for binary testing

✍ M. R. Garey; R. L. Graham 📂 Article 📅 1974 🏛 Springer-Verlag 🌐 English ⚖ 407 KB