Using matrix eigenvalues to construct an iterative method with the highest possible efficiency index two
In this paper, we first derive a family of iterative schemes with fourth order. A weight function is used to maintain its optimality. Then, we transform it into methods with several self-accelerating parameters to reach the highest possible convergence rate 8. For this aim, we employ the property of...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
MDPI
2022
|
| Subjects: | |
| Online Access: | http://eprints.um.edu.my/42858/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper, we first derive a family of iterative schemes with fourth order. A weight function is used to maintain its optimality. Then, we transform it into methods with several self-accelerating parameters to reach the highest possible convergence rate 8. For this aim, we employ the property of the eigenvalues of the matrices and the technique with memory. Solving several nonlinear test equations shows that the proposed variants have a computational efficiency index of two (maximum amount possible) in practice. |
|---|