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

MaRDI QIDQ4591347zbMATH OpenFDO

Authors Gilbert Labelle

Publication date 14 November 2017

Full work available at URL http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAN0162

zbMATH Keywords

combinatorial speciesNewton-Raphson iterationorder of convergencetree-like structures

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Numerical computation of solutions to systems of equations (65H10)

Recommendations

• Une approche combinatoire pour l'itération de Newton-Raphson
• Root finding by high order iterative methods based on quadratures
• Iterative functions with order of convergence greater than that of Newton's method
• A class of generalized Newton iterative schemes
• New iterative method for solving non-linear equations with fourth-order convergence

Cited in

(2)

• Une approche combinatoire pour l'itération de Newton-Raphson
• A simple algorithm for high order Newton iteration formulae and some new variants

This page was built for publication: On extensions of the Newton-Raphson iterative scheme to arbitrary orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4591347)