✦ LIBER ✦

Accelerating convergence by root finding

✍ Scribed by Jet Wimp

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 435 KB
Volume: 5
Category: Article
ISSN: 0362-546X
DOI: 10.1016/0362-546x(81)90110-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Chebyshev-like root-finding methods with

Chebyshev-like root-finding methods with accelerated convergence

✍ M. S. Petković; L. Rančić; L. D. Petković; S. Ilić 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 187 KB

Quadratically convergent multiple roots

Quadratically convergent multiple roots finding method without derivatives

✍ Xin-Yuan Wu; Jian-Lin Xia; Rong Shao 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 221 KB

In this paper, an iteration method without derivatives for multiple roots is proposed. This method proved to be quadratically convergent. Its efficiency and accuracy are illustrated by numerical experiments.

Finding polynomial roots: A fast algorit

Finding polynomial roots: A fast algorithm convergent on the complex plane

✍ Ivanisov, Andrey V. ;Polishchuk, Vadim K. 📂 Article 📅 1985 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 351 KB 👁 1 views

An algorithm is suggested which performs fast calculations of all the roots of a polynomial with maximal computer accuracy using, as the only primary information, the coefficients and the degree of the polynomial. The algorithm combines global as well as local convergences, i.e. it ensures a rapid h

Finding roots by deflated polynomial app

Finding roots by deflated polynomial approximation

✍ T.N. Lucas 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 689 KB

A numerical technique is presented which evaluates the roots of polynomials with real coeficients. Features of the method include no complex arithmetic requirements, no need to guess at initial quadratic factor estimates, multiple or nearly equal roots being easily dealt with and a high degree of fl

Accelerating generators of iterative met

Accelerating generators of iterative methods for finding multiple roots of nonlinear equations

✍ M.S. Petković; L.D. Petković; J. Džunić 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 397 KB

a b s t r a c t Two accelerating generators that produce iterative root-finding methods of arbitrary order of convergence are presented. Primary attention is paid to algorithms for finding multiple roots of nonlinear functions and, in particular, of algebraic polynomials. First, two classes of algor

A method of finding the roots of polynom

A method of finding the roots of polynomials which converge for any initial approximation

✍ A.V. Ivanisov; V.K. Polishchuk 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 674 KB