This article is cited in 2 papers

Optimal algorithms for integration of convex functions

I. A. Glinkin

Moscow

Abstract: A best quadrature formula and an algorithm that is optimal in one step for integrating a convex function of one variable are described. It is shown that the least guaranteed error of both methods are roughly the same, though, if the behaviour of the integrated function is “not the worst”, the efficiency of the optimal algorithm can be higher.

UDC: 519.644

MSC: Primary 65D32; Secondary 41A55

Received: 15.04.1981
Revised: 04.06.1982

 English version: USSR Computational Mathematics and Mathematical Physics, 1983, 23:2, 6–12

Bibliographic databases:

• 
•