### Abstract

Recently, we have shown that for each natural number m greater than one, and each natural number k less than or equal to m, there exists a root-finding iteration function, defined as the ratio of two determinants that depend on the first m-k derivatives of the given function. For each k the corresponding matrices are upper Hessenberg matrices. Additionally, for k = 1 these matrices are Toeplitz matrices. The goal of this paper is to analyze the order of convergence of this fundamental family. Newton's method, Halley's method, and their multi-point versions are members of this family. In this paper we also derive these special cases. We prove that for fixed m, as k increases, the order of convergence decreases from m to the positive root of the characteristic polynomial of generalized Fibonacci numbers of order m. For fixed k, the order of convergence increases in m. The asymptotic error constant is also derived in terms of special determinants.

Original language | English (US) |
---|---|

Pages (from-to) | 96-109 |

Number of pages | 14 |

Journal | BIT Numerical Mathematics |

Volume | 39 |

Issue number | 1 |

DOIs | |

State | Published - Jan 1 1999 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Software
- Computer Networks and Communications
- Computational Mathematics
- Applied Mathematics

### Cite this

}

*BIT Numerical Mathematics*, vol. 39, no. 1, pp. 96-109. https://doi.org/10.1023/A:1022321325108

**On the Order of Convergence of a Determinantal Family of Root-Finding Methods.** / Kalantari, Bahman.

Research output: Contribution to journal › Article

TY - JOUR

T1 - On the Order of Convergence of a Determinantal Family of Root-Finding Methods

AU - Kalantari, Bahman

PY - 1999/1/1

Y1 - 1999/1/1

N2 - Recently, we have shown that for each natural number m greater than one, and each natural number k less than or equal to m, there exists a root-finding iteration function, defined as the ratio of two determinants that depend on the first m-k derivatives of the given function. For each k the corresponding matrices are upper Hessenberg matrices. Additionally, for k = 1 these matrices are Toeplitz matrices. The goal of this paper is to analyze the order of convergence of this fundamental family. Newton's method, Halley's method, and their multi-point versions are members of this family. In this paper we also derive these special cases. We prove that for fixed m, as k increases, the order of convergence decreases from m to the positive root of the characteristic polynomial of generalized Fibonacci numbers of order m. For fixed k, the order of convergence increases in m. The asymptotic error constant is also derived in terms of special determinants.

AB - Recently, we have shown that for each natural number m greater than one, and each natural number k less than or equal to m, there exists a root-finding iteration function, defined as the ratio of two determinants that depend on the first m-k derivatives of the given function. For each k the corresponding matrices are upper Hessenberg matrices. Additionally, for k = 1 these matrices are Toeplitz matrices. The goal of this paper is to analyze the order of convergence of this fundamental family. Newton's method, Halley's method, and their multi-point versions are members of this family. In this paper we also derive these special cases. We prove that for fixed m, as k increases, the order of convergence decreases from m to the positive root of the characteristic polynomial of generalized Fibonacci numbers of order m. For fixed k, the order of convergence increases in m. The asymptotic error constant is also derived in terms of special determinants.

UR - http://www.scopus.com/inward/record.url?scp=0004967376&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0004967376&partnerID=8YFLogxK

U2 - 10.1023/A:1022321325108

DO - 10.1023/A:1022321325108

M3 - Article

VL - 39

SP - 96

EP - 109

JO - BIT

JF - BIT

SN - 0006-3835

IS - 1

ER -