Comments on the Richardson Extrapolation

Lee, S. M.

doi:10.13182/nse86-a17538

Search citation statements

Order By: Relevance

Paper Sections

Select...

Richardson Extrapolation1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1986

2013

Publication Types

Select...

Article3

Other1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This procedure has been applied to many numerical methods in order to improve the accuracy of the results [9], [10], [11]. Richardson extrapolation can be applied to any numerical method which has an error expansion in the form…”

Section: Richardson Extrapolationmentioning

confidence: 99%

On second derivative-free zero finding methods

Hasan

2010

Proceedings of the 2010 American Control Conference

View full text Add to dashboard Cite

High order root-finding algorithms are constructed from formulas for approximating higher order logarithmic and standard derivatives. These formulas are free of derivatives of second order or higher and use only function evaluation and/or first derivatives at multiple points. Richardson extrapolation technique is applied to obtain better approximations of these derivatives. The proposed approaches resulted in deriving a family of root-finding methods of any desired order. The first member of this family is the square root iteration or Ostrowski iteration. Additionally, higher order derivatives are approximated using multipoint function evaluations. We also derived a procedure for fourth order methods that are dependents only on the function and its first derivative evaluated at multiple points.

show abstract

Section: Richardson Extrapolationmentioning

confidence: 99%