ON OPTIMAL RECOVERY OF FUNCTIONS FROM THE KOROBOV CLASS IN THE FRAMEWORK OF C(N)D – STATEMENT

2020

Closed access Metadata (CSL-JSON)
DOI 10.51889/2020-2.1728-7901.19
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

With optimal recovery of an operator T mapping a functional class F into a normed space Y by computing units constructed from inaccurate numerical information l(N), the problems С(N)D - 1, С(N)D –2 and С(N)D –3 are successively solved. In this work, when we consider the unit operator as the operator T , the multidimensional oneperiodic Korobov class as the class F , the normalized space of functions continuous on the unit cube as the space Y , the trigonometric Fourier coefficients of the function being restored as numerical information l(N) , problems С(N)D – 2 and С(N)D –3 are solved. Namely, in the problem С(N)D – 2 the marginal error of the optimal computing unit (l¯(N),ϕ¯¯¯N) from the previously solved problem С(N)D - 1 was found, and in the problem С(N)D - 3 it was proved, that any computing unit with respect to trigonometric Fourier coefficients has a better marginal error, than a computing unit (l¯(N),ϕ¯¯¯N)