2019
DOI: 10.3390/sym11020239
|View full text |Cite
|
Sign up to set email alerts
|

Some Real-Life Applications of a Newly Constructed Derivative Free Iterative Scheme

Abstract: In this study, we present a new higher-order scheme without memory for simple zeros which has two major advantages. The first one is that each member of our scheme is derivative free and the second one is that the present scheme is capable of producing many new optimal family of eighth-order methods from every 4-order optimal derivative free scheme (available in the literature) whose first substep employs a Steffensen or a Steffensen-like method. In addition, the theoretical and computational properties of the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
17
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 23 publications
(19 citation statements)
references
References 28 publications
0
17
0
Order By: Relevance
“…An example of an approximation of the Colebrook equation based on internal cycles is given by Serghides [51]. Serghides' methods belong to Steffensen types of methods, which do not require derivatives (other Steffensen types of methods can be used in addition [52,53]).…”
Section: Approximations By Multi-point Methods With Internal Cyclesmentioning
confidence: 99%
“…An example of an approximation of the Colebrook equation based on internal cycles is given by Serghides [51]. Serghides' methods belong to Steffensen types of methods, which do not require derivatives (other Steffensen types of methods can be used in addition [52,53]).…”
Section: Approximations By Multi-point Methods With Internal Cyclesmentioning
confidence: 99%
“…Let us start a short review of the literature with some of the existing methods with or without memory before proceeding to the proposed idea. Behl et al [5] presented an optimal scheme that does not need any derivative evaluations. In addition, the given scheme is capable of generating new optimal eighth-order methods from the earlier optimal fourth-order schemes in which the first sub-step employs Steffensen's or a Steffensen-type method.…”
Section: Introductionmentioning
confidence: 99%
“…It is almost inaccessible to find the solution by an analytical approach. Therefore, we worry about the iterative schemes to find the multiple solution r m with known multiplicity m > 1 of the uni-variate function in Equation (1).…”
Section: Introductionmentioning
confidence: 99%
“…Construction of the iterative schemes [1][2][3] (that do not essentially require the value of second-order derivative of Θ) having optimal convergence order [4] is the foremost and most difficult issue in the region of numerical analysis. It is also interesting with practical perspective because sometimes it is very difficult to compute the second-order derivative.…”
Section: Introductionmentioning
confidence: 99%