Optimal recovery of operator sequences
نویسندگان
چکیده
In this paper we consider two recovery problems based on information given with an error. First is the problem of optimal class $W^T_q = \{(t_1h_1,t_2h_2,\ldots)\in \ell_q\,:\,\|h\|_q\leqslant 1\}$, where $1\le q < \infty$ and $t_1\geqslant t_2\geqslant \ldots \geqslant 0$, in space $\ell_q$ when capacity inexact know either first $n\in\mathbb{N}$ elements a sequence error measured finite sequences $\ell_r^n$, $0 r \le \infty$, or itself known $\ell_r$. The second scalar products acting Cartesian product $W^{T,S}_{p,q}$ classes $W^T_p$ $W^S_q$, $1 p,q $\frac{1}{p} + \frac{1}{q} 1$ $s_1\ge s_2\ge \ge $n$ coordinate-wise $x_1y_1, x_2y_2,\ldots,x_ny_m$ element $x\times y \in W^{T,S}_{p,q}$ $\ell_r^n$. We find exact solutions to above construct methods recovery. As application our results Hilbert spaces by Fourier coefficients $\ell_p$ $p > 2$.
منابع مشابه
Banach Algebras of Operator Sequences
During the last decades it turned out to be fruitful to apply certain Banach algebra techniques in the theory of approximation of operators by matrix sequences. Here we discuss the case of operator sequences (acting on infinite dimensional Banach spaces and which do not necessarily converge strongly) and we derive analogous results concerning the stability and Fredholm properties of such sequen...
متن کاملStatistical Characterization of Morphological Operator Sequences
Detection followed by morphological processing is commonly used in machine vision. However, choosing the morphological operators and parameters is often done in a heuristic manner since a statistical characterization of their performance is not easily derivable. If we consider a morphology operator sequence as a classifier distinguishing between two patterns, the automatic choice of the operato...
متن کاملOptimal Partitioning of Sequences
The problem of partitioning a sequence of n real numbers into p intervals is considered. The goal is to find a partition such that the cost of the most expensive interval measured with a cost function f is minimized. An efficient algorithm which solves the problem in time O(p(n − p) log p) is developed. The algorithm is based on finding a sequence of feasible non-optimal partitions, each having...
متن کاملOptimal Operator preconditioning for weakly singular operator over 3D screens
In this supplement to [14], we propose a new Calderón-type preconditioner for the weakly singular integral operator for −∆ on screens in R. We introduce a modified hypersingular operator, which is the exact inverse of the weakly singular operator on the unit disk. It forms the foundation for dual-mesh-based operator preconditioning. Applied to low-order boundary element Galerkin discretizations...
متن کاملAn insertion operator preserving infinite reduction sequences
A common way to show the termination of the union of two abstract reduction systems, provided both systems terminate, is to prove they enjoy a specific property (some sort of “commutation” for instance). This specific property is actually used to show that, for the union not to terminate, one out of both systems must itself be non-terminating, which leads to a contradiction. Unfortunately, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Matemati?nì studìï
سال: 2021
ISSN: ['2411-0620', '1027-4634']
DOI: https://doi.org/10.30970/ms.56.2.193-207