A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity

Research output: Contribution to journalArticle

2 Scopus citations

Abstract

We construct a family of high order iteration functions for finding polynomial roots of a known multiplicity s. This family is a generalization of a fundamental family of high order algorithms for simple roots that dates back to Schröder's 1870 paper. It starts with the well known variant of Newton's method B̂2(x) = x - s • p(x)/p'(x) and the multiple root counterpart of Halley's method derived by Hansen and Patrick. Our approach demonstrates the relevance and power of algebraic combinatorial techniques in studying rational root-finding iteration functions.

Original languageEnglish (US)
Pages (from-to)1897-1906
Number of pages10
JournalProceedings of the American Mathematical Society
Volume138
Issue number6
DOIs
StatePublished - Jun 1 2010

All Science Journal Classification (ASJC) codes

  • Mathematics(all)
  • Applied Mathematics

Keywords

  • Generating functions
  • Iteration functions
  • Multiple roots
  • Recurrence relation
  • Root-finding
  • Symmetric functions

Fingerprint Dive into the research topics of 'A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity'. Together they form a unique fingerprint.

  • Cite this