Quadratically convergent multiple roots finding method without derivatives
β Scribed by Xin-Yuan Wu; Jian-Lin Xia; Rong Shao
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 221 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π 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
We propose a new QR-like algorithm, symmetric squared QR (SSQR) method, that can be readily parallelized using commonly available parallel computational primitives such as matrix-matrix multiplication and QR decomposition. The algorithm converges quadratically and the quadratic convergence is achiev
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