Rate of convergence of higher-order methods

DOI10.1016/j.apnum.2011.06.016zbMath1281.65080OpenAlexW2098220598MaRDI QIDQ1946151

Trond Steihaug, Sara Suleiman

Publication date: 18 April 2013

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2011.06.016

zbMATH Keywords

convergencesystem of nonlinear equationsnumerical experimentsHalley's methodChebyshev's methodSchröder's methodNewton's methodssingle point iterative method

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Related Items (4)

Tensor methods for solving symmetric \({\mathcal {M}}\)-tensor systems ⋮ On diagonally structured problems in unconstrained optimization using an inexact super Halley method ⋮ A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class ⋮ On the final steps of Newton and higher order methods

Uses Software

• DAFNE

This page was built for publication: Rate of convergence of higher-order methods