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 WTq = \(t1h1,t2h2,…)∈ q\,:\,\|h\|q≤slant 1\, where 1 q < ∞ and t1≥slant t2≥slant … ≥slant 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 rn, 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 WT,Sp,q of classes WTp and WSq, where 1 < p,q < ∞, 1p + 1q = 1 and s1 s2 … 0, when in the capacity of inexact information we know the first n coordinate-wise products x1y1, x2y2,…,xnym of the element x× y ∈ WT,Sp,q with an error measured in the space rn. 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…