Computing Simple Roots by an Optimal Sixteenth-Order Class
The problem considered in this paper is to approximate the simple zeros of the function by iterative processes. An optimal 16th order class is constructed. The class is built by considering any of the optimal three-step derivative-involved methods in the first three steps of a four-step cycle in wh...
Saved in:
Main Authors: | F. Soleymani, S. Shateyi, H. Salmani |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/958020 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Optimal Sixteenth Order Convergent Method Based on Quasi-Hermite Interpolation for Computing Roots
by: Fiza Zafar, et al.
Published: (2014-01-01) -
Two Optimal Eighth-Order Derivative-Free Classes of Iterative Methods
by: F. Soleymani, et al.
Published: (2012-01-01) -
A Numerical Method for Computing the Principal Square Root of a Matrix
by: F. Soleymani, et al.
Published: (2014-01-01) -
A Class of Three-Step Derivative-Free Root Solvers with Optimal Convergence Order
by: F. Soleymani, et al.
Published: (2012-01-01) -
The Empiricist Impulse: Doers and Thinkers in Sixteenth-Century Spain
by: Portuondo María M.
Published: (2024-12-01)