| Article ID: | iaor1995177 |
| Country: | Japan |
| Volume: | 34 |
| Issue: | 11 |
| Start Page Number: | 2443 |
| End Page Number: | 2448 |
| Publication Date: | Nov 1993 |
| Journal: | Transactions of the Information Processing Society of Japan |
| Authors: | Murakami Takahiko |
| Keywords: | combinatorial analysis, numerical analysis |
The paper derives two types of iterative methods, each containing two parameters. Then it establishes that these methods converge globally and monotonically to the zeros of both a polynomial and with only real zeros and an entire function of genus 0 and 1 (and in certain cases of genus 2) with only real zeros under some assumptions. This paper discusses the convergence speed in Ostrowski’s method, Halley’s method and the present methods.