An optimal multiple root-finding method of order three (Q1334505): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A family of root finding methods / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4060241 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3925805 / rank | |||
Normal rank | |||
Latest revision as of 16:58, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal multiple root-finding method of order three |
scientific article |
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
