A new method for solving a nonlinear equation with error estimations
The first step of \textit{C. Brezinski}'s \(\Theta\)-algorithm [Acceleration de la convergence en analyse numerique, Lect. Notes Math. 584 (1977; Zbl 0352.65003)] is used to accelerate the convergence of the method of successive approximations for a fixed point of a single equation in one unknown. The main advantage of the new method in comparison with Steffensen's and Newton's method is when the multiplicity of the root is larger than or equal to two. The rate of convergence of the new method is established, sufficient conditions for convergence for any starting point in an interval are shown and a posteriori error estimates are given. Some of these results also apply to other methods, such as Steffensen's. The paper concludes with some numerical experiments.
- Accélération de la convergence en analyse numérique
- Error Control in Convergence Acceleration Processes
- Extrapolation methods theory and practice
- scientific article; zbMATH DE number 3615777 (Why is no real title available?)
- scientific article; zbMATH DE number 3240705 (Why is no real title available?)
- scientific article; zbMATH DE number 3269388 (Why is no real title available?)
- scientific article; zbMATH DE number 3393634 (Why is no real title available?)
- Numerical Comparisons of Nonlinear Convergence Accelerators
- On a Device for Computing the e m (S n ) Transformation
- Sequence transformations and their applications
- Sélection entre procédés d'accélération de la convergence
This page was built for publication: A new method for solving a nonlinear equation with error estimations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2564294)