Skip to main navigation Skip to search Skip to main content

On the derivation of higher order root-finding methods

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

High order root-finding algorithms are constructed based on some canonical conditions and a generalized Taylor series. The convergence order is automatically determined using these canonical conditions. The proposed approaches resulted in deriving methods of any desired order including the Newton, Halley, and Ostrowski iterations. It is also shown that, when zeros are simple, higher order methods may be obtained by applying lower order methods such as Newton Iteration to new functions which have same zeros as the original function. These functions are constructed so that the first few derivatives beyond the first vanish. Several examples are given for constructing methods of higher order for computing the zeros of the entire function sin(z).

Original languageEnglish (US)
Title of host publicationProceedings of the 2007 American Control Conference, ACC
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2328-2333
Number of pages6
ISBN (Print)1424409888, 9781424409884
DOIs
StatePublished - 2007
Event2007 American Control Conference, ACC 2007 - New York, NY, United States
Duration: Jul 9 2007 → Jul 13 2007

Publication series

NameProceedings of the American Control Conference
ISSN (Print)0743-1619

Conference

Conference2007 American Control Conference, ACC 2007
Country/TerritoryUnited States
CityNew York, NY
Period7/9/07 → 7/13/07

Keywords

  • Halley's method
  • Higher order methods
  • Newton's method
  • Order of convergence
  • Ostrowski method
  • Root-finding
  • Square root iteration
  • Zeros of analytic functions
  • Zeros of polynomials
  • rth root iterations

Fingerprint

Dive into the research topics of 'On the derivation of higher order root-finding methods'. Together they form a unique fingerprint.

Cite this