Open AccessPreface
Author(s) -
Henning Bordihn,
Rudolf Freund,
Mika Hirvensalo,
Markus Holzer,
Martin Kutrib,
Friedrich Otto
Publication year - 2011
Publication title -
fundamenta informaticae
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.311
H-Index - 67
eISSN - 1875-8681
pISSN - 0169-2968
DOI - 10.3233/fi-2011-582
Subject(s) - computer science
If f 2 CŒ0; 1 the convergence is uniform. This result shows that the rate of convergence Bn.f ; x/ f .x/ ! 0 as n ! 1 is of order not better than 1=n if f 00.x/ ¤ 0: In this sense the theorem of E. Voronovskaja is a first example of saturation, i.e. the optimal rate of convergence is 1=n: To increase the rate of convergence, it was P. L. Butzer [34] who introduced in 1953 the following linear combinations:
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom