## Abstract

In this paper, a new iteration scheme is proposed to solve the roots of an algebraic equation f(x) = 0. Given an initial guess, x_{0}, the roots of the equation can be obtained using the following iteration scheme:{A formula is presented}This iteration scheme has unique convergence characteristics different from the well-known Newton's method. It is shown that this iteration method has cubic local convergence in the neighborhood of the root. Using this scheme, real or complex roots for specific algebraic equations can be found. Because there are two iteration directions, for a given initial guess, two solutions can be found for certain algebraic equations with multiple roots. Examples are presented and compared with other methods.

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

Pages (from-to) | 1147-1155 |

Number of pages | 9 |

Journal | Applied Mathematics and Computation |

Volume | 175 |

Issue number | 2 |

DOIs | |

State | Published - Apr 15 2006 |

## Keywords

- Algebraic equation
- Iteration method
- Newton's method
- Nonlinear
- Numerical method

## ASJC Scopus subject areas

- Computational Mathematics
- Applied Mathematics