On convergence criteria for Jarratt's method (Q1064014): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q127064045, #quickstatements; #temporary_batch_1722794872778
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4071019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the rate of convergence of newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternative convergence criteria for iterative methods of solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5553606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative method for locating turning points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Limiting Values and Two Error Estimation Procedures for Power Series Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities: theory of majorization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the tangent method / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127064045 / rank
 
Normal rank

Latest revision as of 20:09, 4 August 2024

scientific article
Language Label Description Also known as
English
On convergence criteria for Jarratt's method
scientific article

    Statements

    On convergence criteria for Jarratt's method (English)
    0 references
    0 references
    1984
    0 references
    Let f(\(\chi)\) together with its first two derivatives be continuous in the domain \({\mathbb{D}}\) and additionally let \(\chi_ M\in {\mathbb{D}}\) be an extremum (or turning point) of this function. Also, let \(\chi_{n+1}=T(\chi_ n,\chi_{n-1},\chi_{n-2})\) be the value obtained by the method of \textit{P. Jarratt} [Computer J. 10, 82-84 (1967; Zbl 0154.169)] for computing the extremum (or turning point) of a function. Criteria are demonstrated which insure that, for any triple of initial assumptions \((\chi_ 1,\chi_ 0,\chi_{-1})\in {\mathbb{D}}\), Jarratt's method converges to the extremum of f(\(\chi)\), and that from and after some \(n=N_ 0\), the rate of convergence of this method increases steadily, finally becoming unbounded when the solution \(\chi_ M\) is attained.
    0 references
    0 references
    extremum of a function
    0 references
    turning point
    0 references
    rate of convergence
    0 references
    0 references
    0 references