An optimal order method for multiple roots in case of unknown multiplicity (Q1736762)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An optimal order method for multiple roots in case of unknown multiplicity |
scientific article |
Statements
An optimal order method for multiple roots in case of unknown multiplicity (English)
0 references
26 March 2019
0 references
Summary: In the literature, recently, some three-step schemes involving four function evaluations for the solution of multiple roots of nonlinear equations, whose multiplicity is not known in advance, are considered, but they do not agree with Kung-Traub's conjecture. The present article is devoted to the study of an iterative scheme for approximating multiple roots with a convergence rate of eight, when the multiplicity is hidden, which agrees with Kung-Traub's conjecture. The theoretical study of the convergence rate is investigated and demonstrated. A few nonlinear problems are presented to justify the theoretical study.
0 references
nonlinear equations
0 references
iterative method
0 references
multiple root
0 references
unknown multiplicity
0 references
optimal convergence rate
0 references
0 references
0 references
0 references
0 references
0 references