The convergence rate of the sandwich algorithm for approximating convex functions (Q1195962): Difference between revisions
From MaRDI portal
Revision as of 13:59, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The convergence rate of the sandwich algorithm for approximating convex functions |
scientific article |
Statements
The convergence rate of the sandwich algorithm for approximating convex functions (English)
0 references
11 January 1993
0 references
Interval bisection, slope bisection, maximum error rule and chord rule are considered as four natural rules leading to different versions of the sandwich algorithm for approximating a convex function of one variable over an interval by evaluating the function and its derivative at a sequence of points. Further the author demonstrates that the global approximation error with \(n\) evaluation points decreases by the order of \(O(1/n^ 2)\) which is optimal.
0 references
convergence rate
0 references
interval bisection
0 references
slope bisection
0 references
maximum error rule
0 references
chord rule
0 references
sandwich algorithm
0 references
convex function
0 references
0 references
0 references
0 references
0 references
