On the Local Convergence of a Third Order Family of Iterative Processes
AbstractEfficiency is generally the most important aspect to take into account when choosing an iterative method to approximate a solution of an equation, but is not the only aspect to consider in the iterative process. Another important aspect to consider is the accessibility of the iterative process, which shows the domain of starting points from which the iterative process converges to a solution of the equation. So, we consider a family of iterative processes with a higher efficiency index than Newton’s method. However, this family of proecsses presents problems of accessibility to the solution x * . From a local study of the convergence of this family, we perform an optimization study of the accessibility and obtain iterative processes with better accessibility than Newton’s method. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Hernández-Verón, M.A.; Romero, N. On the Local Convergence of a Third Order Family of Iterative Processes. Algorithms 2015, 8, 1121-1128.
Hernández-Verón MA, Romero N. On the Local Convergence of a Third Order Family of Iterative Processes. Algorithms. 2015; 8(4):1121-1128.Chicago/Turabian Style
Hernández-Verón, M. A.; Romero, N. 2015. "On the Local Convergence of a Third Order Family of Iterative Processes." Algorithms 8, no. 4: 1121-1128.