✦ LIBER ✦

Comparison of four algorithms accelerating the convergence of a subset of logarithmic fixed point sequences

✍ Scribed by Paul Sablonniere

Publisher: Springer US
Year: 1991
Tongue: English
Weight: 715 KB
Volume: 1
Category: Article
ISSN: 1017-1398
DOI: 10.1007/bf02142320

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convergence acceleration of logarithmic

Convergence acceleration of logarithmic fixed point sequences

✍ Paul Sablonniere 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 314 KB

Convergence acceleration of logarithmic

Convergence acceleration of logarithmic fixed point sequences

✍ Paul Sablonniere 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 255 KB

Let (x,) be some sequence generated by x,+ 1 = f(x,) where i>1 For x 0 > 0 small, it converges to zero logarithmically, i.e. lim, xn+l/x . = 1, thus we need algorithms for accelerating its convergence. Using asymptotic expansions in the analysis of the A 2 and 02-algorithms leads to modified iter

Comparison of four nonlinear transforms

Comparison of four nonlinear transforms on some classes of logarithmic fixed point sequences

✍ Paul Sablonnière 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 997 KB

Weak Convergence to a Fixed Point of the

Weak Convergence to a Fixed Point of the Sequence of Mann Type Iterates

✍ J.Y. Park; J.U. Jeong 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 194 KB