Rate of convergence of higher-order methods
DOI10.1016/J.APNUM.2011.06.016zbMATH Open1281.65080OpenAlexW2098220598MaRDI QIDQ1946151FDOQ1946151
Authors: 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
Recommendations
- scientific article; zbMATH DE number 5196233
- Rate of convergence of a generalization of Newton's method
- On rate of convergence of various iterative schemes
- scientific article; zbMATH DE number 6163310
- Rate of convergence of the bundle method
- On the complexity of convergence for high order iterative methods
- The Convergence Rate of Godunov Type Schemes
- Rate of convergence of a class of numerical methods solving linear inequality systems
- scientific article; zbMATH DE number 3856303
- The Rate of Convergence for the Decomposition Method
convergencenumerical experimentssystem of nonlinear equationsChebyshev's method[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Schr%EF%BF%BD%EF%BF%BDder%27s+method&go=Go Schr��der's method]Halley's methodNewton's methodssingle point iterative method
Cited In (4)
- Tensor methods for solving symmetric \({\mathcal {M}}\)-tensor systems
- On diagonally structured problems in unconstrained optimization using an inexact super Halley method
- On the final steps of Newton and higher order methods
- A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class
Uses Software
This page was built for publication: Rate of convergence of higher-order methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1946151)
