Note on the estimation of the order of convergence of some iterative methods
From MaRDI portal
The paper deals with a certain class of polynomials, each having a unique positive root. Using ideas of \textit{J. F. Traub} [Iterative methods for the solution of equations. (1964; Zbl 0121.112)] the author improves the upper and lower bounds established earlier by \textit{J. Herzberger} [Computing 36, 175-180 (1986; Zbl 0572.65033)]. The new estimates are applied to determination of the \(R\)-order of iterative processes.
Recommendations
Cites work
- Bounds for the R-order of certain iterative numerical processes
- scientific article; zbMATH DE number 179034 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- On the R-order of some recurrences with applications to inclusion- methods
- The Representation of Complex Circular Functions Using Taylor Series
Cited in
(7)- Explicit bounds for the positive root of classes of polynomials with applications
- scientific article; zbMATH DE number 3860308 (Why is no real title available?)
- Enclosing roots of polynomial equations and their applications to iterative processes
- scientific article; zbMATH DE number 3913555 (Why is no real title available?)
- scientific article; zbMATH DE number 4123171 (Why is no real title available?)
- scientific article; zbMATH DE number 549076 (Why is no real title available?)
- Locating roots of a certain class of polynomials
This page was built for publication: Note on the estimation of the order of convergence of some iterative methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198982)