Abstract:
In the paper is shown that results of C(N)D-recovery of derivatives by the value
at the point with using just only one relationships kfkWr
2
(0,1)s kRfk
W
r+ s−1
2
2
(0,1)s
implies
Radon’s scanning algorithm of an arbitrary open (not necessarily connected) bounded set, which
is optimal among the all computational aggregates, constructed by arbitrary linear numerical
information from the considered object with indicating the boundaries of the computational
error, not affecting the final result.
