Modified Jarratt method for computing multiple roots (Q711336): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Optimal Order of One-Point and Multipoint Iteration / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a General Class of Multipoint Root-Finding Methods of High Computational Efficiency / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5732060 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some efficient fourth order multipoint methods for solving equations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4354453 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new fourth-order iterative method for finding multiple roots of nonlinear equations / rank | |||
Normal rank | |||
Revision as of 09:34, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Modified Jarratt method for computing multiple roots |
scientific article |
Statements
Modified Jarratt method for computing multiple roots (English)
0 references
25 October 2010
0 references
Construction of iterative methods of optimal order for multiple roots is a difficult problem in numerical analysis. A fourth order method for computing multiple roots of nonlinear equations \((f(x)=0)\) is presented. The method is based on the Jarratt scheme for simple roots. The method is optimal, since it requires three evaluations per step. The efficacy is tested on the a number of relevant numerical problems.
0 references
root finding
0 references
Jarratt method
0 references
multiple roots
0 references
order of convergence
0 references
efficiency
0 references
