Acceleration of One-step Stationary Root-finding Algorithms

DOI10.1093/IMANUM/9.1.81MaRDI QIDQ4733313zbMATH OpenOpenAlexFDO

Authors

Publication date 1989

Published in IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/imanum/9.1.81

zbMATH Keywords

accelerated Newton methodsBanach spaceiteration methods of higher orderNewton-Moser methodsNewton-Richardson methods

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15)

Recommendations

• General study of iterative processes of R -order at least three under weak convergence conditions
• scientific article; zbMATH DE number 1750757
• On the convergence of generalized Newton methods and implicit functions
• Publication:4893591
• Extending the applicability of iterative methods free of derivatives by means of memory
• scientific article; zbMATH DE number 3956337
• scientific article; zbMATH DE number 5572993
• scientific article; zbMATH DE number 645869
• Third-order iterative methods without using any Fréchet derivative.
• Iterative methods without inversion

Cited in

(2)

• Iterative k-step methods for computing possibly repulsive fixed points in Banach spaces
• A numerical study of basins of attraction of zero-finding neural nets designed using control theory

This page was built for publication: Acceleration of One-step Stationary Root-finding Algorithms

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