Gilbert Labelle - On extensions of the Newton-Raphson iterative scheme to arbitrary orders

dmtcs:2824 - Discrete Mathematics & Theoretical Computer Science, January 1, 2010, DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010) - https://doi.org/10.46298/dmtcs.2824
On extensions of the Newton-Raphson iterative scheme to arbitrary ordersArticle

Authors: Gilbert Labelle 1,2

  • 1 Département d'informatique [Montréal]
  • 2 Laboratoire de combinatoire et d'informatique mathématique [Montréal]

The classical quadratically convergent Newton-Raphson iterative scheme for successive approximations of a root of an equation $f(t)=0$ has been extended in various ways by different authors, going from cubical convergence to convergence of arbitrary orders. We introduce two such extensions, using appropriate differential operators as well as combinatorial arguments. We conclude with some applications including special series expansions for functions of the root and enumeration of classes of tree-like structures according to their number of leaves.


Volume: DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
Section: Proceedings
Published on: January 1, 2010
Imported on: January 31, 2017
Keywords: Newton-Raphson iteration,order of convergence,combinatorial species,tree-like structures,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
Funding:
    Source : OpenAIRE Graph
  • Funder: Natural Sciences and Engineering Research Council of Canada

4 Documents citing this article

Consultation statistics

This page has been seen 158 times.
This article's PDF has been downloaded 142 times.