2022
DOI: 10.1007/s12190-022-01775-2
|View full text |Cite
|
Sign up to set email alerts
|

Optimal fourth and eighth-order iterative methods for non-linear equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
9
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 15 publications
(9 citation statements)
references
References 21 publications
0
9
0
Order By: Relevance
“…E s (MPa) [195,000,205,000] f y (MPa) [400,500] f ct (MPa) [25,50] φ(mm) [6,40] Tables 2-4 show the numerical performance of the known Rall and Schröder's schemes and the proposed method (9) in solving Model (10). The stopping criterion set was | f (x k+1 )| < 10 −16 , taking as an initial guess, the value x 0 = 9 4000 .…”
Section: Input Rangementioning
confidence: 99%
See 1 more Smart Citation
“…E s (MPa) [195,000,205,000] f y (MPa) [400,500] f ct (MPa) [25,50] φ(mm) [6,40] Tables 2-4 show the numerical performance of the known Rall and Schröder's schemes and the proposed method (9) in solving Model (10). The stopping criterion set was | f (x k+1 )| < 10 −16 , taking as an initial guess, the value x 0 = 9 4000 .…”
Section: Input Rangementioning
confidence: 99%
“…when the multiplicity is unknown. In recent years, some optimal iterative methods for solving nonlinear problems with multiple roots have appeared in the literature, such as [8][9][10][11], for cases with known multiplicity and [12], for unknown multiplicity. In most cases, the iterative expression is complicated, which increases the computational cost.…”
Section: Introductionmentioning
confidence: 99%
“…The composition technique is the preferred approach for building an optimal method, along with the use of various approximations and interpolations to reduce the number of functional evaluations. Various fourth-and eighth order optimal iterative algorithms have been developed, see e.g., Chun and Lee [11], Kung and Traub [26], Liu and Wang [28], Pandey et al [35], Parimala et al [36], Rafiullah and Jabeen [40], Sharma and Arora [45] and the references cited therein.…”
Section: Introductionmentioning
confidence: 99%
“…Equation ( 2) has a quadratic order of convergence for m ≥ 1. While there exist numerous with and without memory iterative methods for computing simple roots [1][2][3][4][5][6], the task of developing efficient methods for finding multiple roots remains challenging. Despite the availability of several without memory iterative methods for multiple roots (see [7][8][9][10] and the references therein), there is a paucity of methods that utilise multiple points with memory and accelerating parameters for computing multiple roots.…”
Section: Introductionmentioning
confidence: 99%