An optimal multiple root-finding method of order three (Q1334505)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An optimal multiple root-finding method of order three |
scientific article; zbMATH DE number 641406
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal multiple root-finding method of order three |
scientific article; zbMATH DE number 641406 |
Statements
An optimal multiple root-finding method of order three (English)
0 references
25 September 1994
0 references
An optimal one-point iterative method of order three for determining a multiple zero of a complex function in a complex variable which requires less computational effort per iteration step than three known such optimal methods is presented. One numerical example with a non-real zero of multiplicity 5/2 is given.
0 references
optimal one-point iterative method
0 references
order three
0 references
multiple zero
0 references
complex function
0 references
numerical example
0 references
