A new iteration method with cubic convergence to solve nonlinear algebraic equations

Tiegang Fang, Fang Guo, Chia-Fon Lee

Research output: Contribution to journalArticlepeer-review

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, x0, 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 languageEnglish (US)
Pages (from-to)1147-1155
Number of pages9
JournalApplied Mathematics and Computation
Volume175
Issue number2
DOIs
StatePublished - Apr 15 2006

Keywords

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

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A new iteration method with cubic convergence to solve nonlinear algebraic equations'. Together they form a unique fingerprint.

Cite this