Optimal recovery of operator sequences

Q3 Mathematics Matematychni Studii Pub Date : 2021-10-16 DOI:10.30970/ms.56.2.193-207
V. Babenko, N. Parfinovych, D. Skorokhodov
{"title":"Optimal recovery of operator sequences","authors":"V. Babenko, N. Parfinovych, D. Skorokhodov","doi":"10.30970/ms.56.2.193-207","DOIUrl":null,"url":null,"abstract":"In this paper we solve two problems of optimal recovery based on information given with an error. First is the problem of optimal recovery of the class $W^T_q = \\{(t_1h_1,t_2h_2,\\ldots)\\,\\colon \\,\\|h\\|_{\\ell_q}\\le 1\\}$, where $1\\le q < \\infty$ and $t_1\\ge t_2\\ge \\ldots \\ge 0$ are given, in the space $\\ell_q$. Information available about a sequence $x\\in W^T_q$ is provided either (i) by an element $y\\in\\mathbb{R}^n$, $n\\in\\mathbb{N}$, whose distance to the first $n$ coordinates $\\left(x_1,\\ldots,x_n\\right)$ of $x$ in the space $\\ell_r^n$, $0 < r \\le \\infty$, does not exceed given $\\varepsilon\\ge 0$, or (ii) by a sequence $y\\in\\ell_\\infty$ whose distance to $x$ in the space $\\ell_r$ does not exceed $\\varepsilon$. We show that the optimal method of recovery in this problem is either operator $\\Phi^*_m$ with some $m\\in\\mathbb{Z}_+$ ($m\\le n$ in case $y\\in\\ell^n_r$), where \n\\smallskip\\centerline{$\\displaystyle \\Phi^*_m(y) = \\Big\\{y_1\\left(1 - \\frac{t_{m+1}^q}{t_{1}^q}\\Big),\\ldots,y_m\\Big(1 - \\frac{t_{m+1}^q}{t_{m}^q}\\Big),0,\\ldots\\right\\},\\quad y\\in\\mathbb{R}^n\\text{ or } y\\in\\ell_\\infty,$} \n\\smallskip\\noior convex combination $(1-\\lambda) \\Phi^*_{m+1} + \\lambda\\Phi^*_{m}$. \nThe second one is the problem of optimal recovery of the scalar product operator acting on the Cartesian product $W^{T,S}_{p,q}$ of classes $W^T_p$ and $W^S_q$, where $1 < p,q < \\infty$, $\\frac{1}{p} + \\frac{1}{q} = 1$ and $s_1\\ge s_2\\ge \\ldots \\ge 0$ are given. Information available about elements $x\\in W^T_p$ and $y\\in W^S_q$ is provided by elements $z,w\\in \\mathbb{R}^n$ such that the distance between vectors $\\left(x_1y_1, x_2y_2,\\ldots,x_ny_n\\right)$ and $\\left(z_1w_1,\\ldots,z_nw_n\\right)$ in the space $\\ell_r^n$ does not exceed $\\varepsilon$. We show that the optimal method of recovery is delivered either by operator $\\Psi^*_m$ with some $m\\in\\{0,1,\\ldots,n\\}$, where \n\\smallskip\\centerline{$\\displaystyle \\Psi^*_m = \\sum_{k=1}^m z_kw_k\\Big(1 - \\frac{t_{m+1}s_{m+1}}{t_ks_k}\\Big),\\quad z,w\\in\\mathbb{R}^n,$} \n\\smallskip\\noior by convex combination $(1-\\lambda)\\Psi^*_{m+1} + \\lambda\\Psi^*_{m}$. \nAs an application of our results we consider the problem of optimal recovery of classes in Hilbert spaces by the Fourier coefficients of its elements known with an error measured in the space $\\ell_p$ with $p > 2$.","PeriodicalId":37555,"journal":{"name":"Matematychni Studii","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Matematychni Studii","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.30970/ms.56.2.193-207","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper we solve two problems of optimal recovery based on information given with an error. First is the problem of optimal recovery of the class $W^T_q = \{(t_1h_1,t_2h_2,\ldots)\,\colon \,\|h\|_{\ell_q}\le 1\}$, where $1\le q < \infty$ and $t_1\ge t_2\ge \ldots \ge 0$ are given, in the space $\ell_q$. Information available about a sequence $x\in W^T_q$ is provided either (i) by an element $y\in\mathbb{R}^n$, $n\in\mathbb{N}$, whose distance to the first $n$ coordinates $\left(x_1,\ldots,x_n\right)$ of $x$ in the space $\ell_r^n$, $0 < r \le \infty$, does not exceed given $\varepsilon\ge 0$, or (ii) by a sequence $y\in\ell_\infty$ whose distance to $x$ in the space $\ell_r$ does not exceed $\varepsilon$. We show that the optimal method of recovery in this problem is either operator $\Phi^*_m$ with some $m\in\mathbb{Z}_+$ ($m\le n$ in case $y\in\ell^n_r$), where \smallskip\centerline{$\displaystyle \Phi^*_m(y) = \Big\{y_1\left(1 - \frac{t_{m+1}^q}{t_{1}^q}\Big),\ldots,y_m\Big(1 - \frac{t_{m+1}^q}{t_{m}^q}\Big),0,\ldots\right\},\quad y\in\mathbb{R}^n\text{ or } y\in\ell_\infty,$} \smallskip\noior convex combination $(1-\lambda) \Phi^*_{m+1} + \lambda\Phi^*_{m}$. The second one is the problem of optimal recovery of the scalar product operator acting on the Cartesian product $W^{T,S}_{p,q}$ of classes $W^T_p$ and $W^S_q$, where $1 < p,q < \infty$, $\frac{1}{p} + \frac{1}{q} = 1$ and $s_1\ge s_2\ge \ldots \ge 0$ are given. Information available about elements $x\in W^T_p$ and $y\in W^S_q$ is provided by elements $z,w\in \mathbb{R}^n$ such that the distance between vectors $\left(x_1y_1, x_2y_2,\ldots,x_ny_n\right)$ and $\left(z_1w_1,\ldots,z_nw_n\right)$ in the space $\ell_r^n$ does not exceed $\varepsilon$. We show that the optimal method of recovery is delivered either by operator $\Psi^*_m$ with some $m\in\{0,1,\ldots,n\}$, where \smallskip\centerline{$\displaystyle \Psi^*_m = \sum_{k=1}^m z_kw_k\Big(1 - \frac{t_{m+1}s_{m+1}}{t_ks_k}\Big),\quad z,w\in\mathbb{R}^n,$} \smallskip\noior by convex combination $(1-\lambda)\Psi^*_{m+1} + \lambda\Psi^*_{m}$. As an application of our results we consider the problem of optimal recovery of classes in Hilbert spaces by the Fourier coefficients of its elements known with an error measured in the space $\ell_p$ with $p > 2$.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
算子序列的最优恢复
本文解决了两个基于带有误差的给定信息的最优恢复问题。首先是类的最优恢复问题 $W^T_q = \{(t_1h_1,t_2h_2,\ldots)\,\colon \,\|h\|_{\ell_q}\le 1\}$,其中 $1\le q < \infty$ 和 $t_1\ge t_2\ge \ldots \ge 0$ 是给定的,在空间中 $\ell_q$. 关于序列的可用信息 $x\in W^T_q$ 是由元素提供的(i) $y\in\mathbb{R}^n$, $n\in\mathbb{N}$,谁的距离到第一个 $n$ 坐标 $\left(x_1,\ldots,x_n\right)$ 的 $x$ 在太空中 $\ell_r^n$, $0 < r \le \infty$,不超过给定 $\varepsilon\ge 0$,或(ii)按顺序 $y\in\ell_\infty$ 谁的距离 $x$ 在太空中 $\ell_r$ 不超过 $\varepsilon$. 我们证明了该问题的最优恢复方法是任一算子 $\Phi^*_m$ 有一些 $m\in\mathbb{Z}_+$ ($m\le n$ 以防万一 $y\in\ell^n_r$),其中 \smallskip\centerline{$\displaystyle \Phi^*_m(y) = \Big\{y_1\left(1 - \frac{t_{m+1}^q}{t_{1}^q}\Big),\ldots,y_m\Big(1 - \frac{t_{m+1}^q}{t_{m}^q}\Big),0,\ldots\right\},\quad y\in\mathbb{R}^n\text{ or } y\in\ell_\infty,$} \smallskip\noior 凸组合 $(1-\lambda) \Phi^*_{m+1} + \lambda\Phi^*_{m}$. 第二个问题是作用于笛卡尔积的标量积算子的最优恢复问题 $W^{T,S}_{p,q}$ 类的 $W^T_p$ 和 $W^S_q$,其中 $1 < p,q < \infty$, $\frac{1}{p} + \frac{1}{q} = 1$ 和 $s_1\ge s_2\ge \ldots \ge 0$ 是给定的。有关元素的可用信息 $x\in W^T_p$ 和 $y\in W^S_q$ 由元素提供 $z,w\in \mathbb{R}^n$ 使得向量之间的距离 $\left(x_1y_1, x_2y_2,\ldots,x_ny_n\right)$ 和 $\left(z_1w_1,\ldots,z_nw_n\right)$ 在太空中 $\ell_r^n$ 不超过 $\varepsilon$. 结果表明,最佳的采收率方法是由作业者提出的 $\Psi^*_m$ 有一些 $m\in\{0,1,\ldots,n\}$,其中 \smallskip\centerline{$\displaystyle \Psi^*_m = \sum_{k=1}^m z_kw_k\Big(1 - \frac{t_{m+1}s_{m+1}}{t_ks_k}\Big),\quad z,w\in\mathbb{R}^n,$} \smallskip\noior 通过凸组合 $(1-\lambda)\Psi^*_{m+1} + \lambda\Psi^*_{m}$. 作为我们的结果的一个应用,我们考虑了Hilbert空间中类的最优恢复问题,该问题是通过在空间中测量误差的已知元素的傅里叶系数来实现的 $\ell_p$ 有 $p > 2$.
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Matematychni Studii
Matematychni Studii Mathematics-Mathematics (all)
CiteScore
1.00
自引率
0.00%
发文量
38
期刊介绍: Journal is devoted to research in all fields of mathematics.
期刊最新文献
On the h-measure of an exceptional set in Fenton-type theorem for Taylor-Dirichlet series Almost periodic distributions and crystalline measures Reflectionless Schrodinger operators and Marchenko parametrization Existence of basic solutions of first order linear homogeneous set-valued differential equations Real univariate polynomials with given signs of coefficients and simple real roots
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1