An optimal multiple root-finding method of order three (Q1334505): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-0427(94)00044-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004914005 / rank
 
Normal rank

Revision as of 17:42, 21 March 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
    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
    0 references

    Identifiers