On general convergence in extracting radicals via a fundamental family of iteration functions

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

Newton's method is well-known to be generally convergent for solving xn - c = 0. In this paper, we first extend this result to the next two members of an infinite family of high order methods referred to here as the Basic Family which starts with Newton's method. While computing roots of unity numerically is a trivial task, studying the general convergence of the Basic Family in this simple case is an important first step toward the understanding of the global behavior of this fundamental family. With the aid of polynomiography, techniques for the visualization of polynomial root-finding, we further conjecture the general convergence of all members of the Basic Family when extracting radicals. Using the computer algebra system Maple, we obtain some partial results toward the proof of our conjecture.

Original languageEnglish (US)
Pages (from-to)832-842
Number of pages11
JournalJournal of Computational and Applied Mathematics
Volume206
Issue number2
DOIs
StatePublished - Sep 15 2007

All Science Journal Classification (ASJC) codes

  • Computational Mathematics
  • Applied Mathematics

Keywords

  • Discrete dynamical systems
  • General convergence
  • Iteration functions
  • Newton's method
  • Root-finding

Fingerprint Dive into the research topics of 'On general convergence in extracting radicals via a fundamental family of iteration functions'. Together they form a unique fingerprint.

Cite this