✦ LIBER ✦

A root-finding algorithm based on Newton's method

✍ Scribed by Kaj Madsen

Publisher: Springer Netherlands
Year: 1973
Tongue: English
Weight: 266 KB
Volume: 13
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01933524

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some remarks on Dvorcuk's root-finding m

Some remarks on Dvorcuk's root-finding method

✍ N. Kjurkchiev; K. Mahdi 📂 Article 📅 1994 🏛 Springer Netherlands 🌐 English ⚖ 178 KB

How to find all roots of complex polynom

How to find all roots of complex polynomials by Newton’s method

✍ John Hubbard; Dierk Schleicher; Scott Sutherland 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 749 KB

Two observations on Durand-Kerner's root

Two observations on Durand-Kerner's root-finding method

✍ Göran Kjellberg 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 181 KB

Newton’s method and high-order algorithm

Newton’s method and high-order algorithms for the nth root computation

✍ François Dubeau 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 705 KB

Two modifications of Newton's method to accelerate the convergence of the nth root computation of a strictly positive real number are revisited. Both modifications lead to methods with prefixed order of convergence p ∈ N, p ≥ 2. We consider affine combinations of the two modified pth-order methods w

Topological complexity of a root finding

Topological complexity of a root finding algorithm

✍ Myong-Hi Kim 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 587 KB

A note on King's method F for finding a

A note on King's method F for finding a bracketed root

✍ D. B. Popovski 📂 Article 📅 1982 🏛 Springer Vienna 🌐 English ⚖ 202 KB