For an equation f (x) = 0 having a multiple root of multiplicity m > 1 unknown, we propose a transformation which converts the multiple root to a simple root of H (x) = 0. The transformed function H (x) of f (x) with a small > 0 has appropriate properties in applying a derivative free iterative meth
Accelerating generators of iterative methods for finding multiple roots of nonlinear equations
✍ Scribed by M.S. Petković; L.D. Petković; J. Džunić
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 397 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
✦ Synopsis
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 algorithms for solving nonlinear equations are studied: those with a known order of multiplicity and others with no information on multiplicity. We also demonstrate the acceleration of iterative methods for the simultaneous approximations of multiple roots of algebraic polynomials. A discussion about the computational efficiency of the root-solvers considered and three numerical examples are given.
📜 SIMILAR VOLUMES
Conventional numerical methods for finding multiple roots of polynomials are inaccurate. The accuracy is unsatisfactory because the derivatives of the polynomial in the intermediate steps of the associated root-finding procedures are eliminated. Engineering applications require that this problem be
x,,, -J, m = 1, 2, 3 . . be an iteration method for solving the nonlinear problem F(X) = 0, where F(X) and its derivatives possess all of the properties required by T(x,,,). Then ifit can be established thatfor the problem at hand jlF(~,+ 1)i/ < &,, llF(x& V m > M,, (M, < co) and 0 < &,, < 1, dejini