Optimal recovery of operator sequences

Abstract

In this paper we consider two recovery problems based on information given with an error. First is the problem of optimal recovery of the class W T q = {(t 1 h 1 , t 2 h 2 , . . .) ∈ ℓ q : h q 1}, where 1 ≤ q < ∞ and t 1 t 2 . . . 0, in the space ℓ q when in the capacity of inexact information we know either the first n ∈ N elements of a sequence with an error measured in the space of finite sequences ℓ n r , 0 < r ≤ ∞, or a sequence itself is known with an error measured in the space ℓ r . The second is the problem of optimal recovery of scalar products acting on Cartesian product W T,S p,q of classes W T p and W S q , where 1 < p, q < ∞, 1 p + 1 q = 1 and s 1 ≥ s 2 ≥ . . . ≥ 0, when in the capacity of inexact information we know the first n coordinate-wise products x 1 y 1 , x 2 y 2 , . . . , x n y m of the element x × y ∈ W T,S p,q with an error measured in the space ℓ n r . We find exact solutions to above problems and construct optimal methods of recovery. As an application of our results we consider the problem of optimal recovery of classes in Hilbert spaces by Fourier coefficients known with an error measured in the space ℓ p with p > 2.