### Abstract

We study a fundamental family of root-finding iteration functions in the context of symmetric functions. This family, which we refer to as the Basic Family, goes back to Schröder's 1870 paper, and admits numerous different representations. In one representation, it is known as König's family. A purely algebraic derivation by Kalantari et al. leads to the discovery of many minimality and uniqueness properties of this family. Our new perspective reveals a symmetric algebraic structure of the Basic Family, which gives rise to simple combinatorial proofs of many important properties of this family and two of its variants. The first variant maintains high order of convergence for multiple roots. The second variant, called the Truncated Basic Family, is an infinite family of mth order methods for every m ≥ 3, using only the first m - 1 derivatives. Our result extends Kalantari's analysis of Halley's family, the special case of the Truncated Basic Family where m = 3. Finally, we give a recipe for constructing new high order root-finding algorithms, and use it to derive an interesting family of iteration functions that have higher orders of convergence for multiple roots than for simple roots.

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

Pages (from-to) | 156-174 |

Number of pages | 19 |

Journal | Advances in Applied Mathematics |

Volume | 34 |

Issue number | 1 |

DOIs | |

State | Published - Jan 2005 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Applied Mathematics

### Keywords

- Iteration functions
- König's family
- Roof-finding
- Schröder's algorithms
- Schur functions
- Symmetric functions

### Cite this

*Advances in Applied Mathematics*,

*34*(1), 156-174. https://doi.org/10.1016/j.aam.2004.05.005

}

*Advances in Applied Mathematics*, vol. 34, no. 1, pp. 156-174. https://doi.org/10.1016/j.aam.2004.05.005

**Symmetric functions and root-finding algorithms.** / Jin, Yi; Kalantari, Bahman.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Symmetric functions and root-finding algorithms

AU - Jin, Yi

AU - Kalantari, Bahman

PY - 2005/1

Y1 - 2005/1

N2 - We study a fundamental family of root-finding iteration functions in the context of symmetric functions. This family, which we refer to as the Basic Family, goes back to Schröder's 1870 paper, and admits numerous different representations. In one representation, it is known as König's family. A purely algebraic derivation by Kalantari et al. leads to the discovery of many minimality and uniqueness properties of this family. Our new perspective reveals a symmetric algebraic structure of the Basic Family, which gives rise to simple combinatorial proofs of many important properties of this family and two of its variants. The first variant maintains high order of convergence for multiple roots. The second variant, called the Truncated Basic Family, is an infinite family of mth order methods for every m ≥ 3, using only the first m - 1 derivatives. Our result extends Kalantari's analysis of Halley's family, the special case of the Truncated Basic Family where m = 3. Finally, we give a recipe for constructing new high order root-finding algorithms, and use it to derive an interesting family of iteration functions that have higher orders of convergence for multiple roots than for simple roots.

AB - We study a fundamental family of root-finding iteration functions in the context of symmetric functions. This family, which we refer to as the Basic Family, goes back to Schröder's 1870 paper, and admits numerous different representations. In one representation, it is known as König's family. A purely algebraic derivation by Kalantari et al. leads to the discovery of many minimality and uniqueness properties of this family. Our new perspective reveals a symmetric algebraic structure of the Basic Family, which gives rise to simple combinatorial proofs of many important properties of this family and two of its variants. The first variant maintains high order of convergence for multiple roots. The second variant, called the Truncated Basic Family, is an infinite family of mth order methods for every m ≥ 3, using only the first m - 1 derivatives. Our result extends Kalantari's analysis of Halley's family, the special case of the Truncated Basic Family where m = 3. Finally, we give a recipe for constructing new high order root-finding algorithms, and use it to derive an interesting family of iteration functions that have higher orders of convergence for multiple roots than for simple roots.

KW - Iteration functions

KW - König's family

KW - Roof-finding

KW - Schröder's algorithms

KW - Schur functions

KW - Symmetric functions

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

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

U2 - 10.1016/j.aam.2004.05.005

DO - 10.1016/j.aam.2004.05.005

M3 - Article

AN - SCOPUS:10244225282

VL - 34

SP - 156

EP - 174

JO - Advances in Applied Mathematics

JF - Advances in Applied Mathematics

SN - 0196-8858

IS - 1

ER -