用N表示正整数集.设{Hd}和{Gd}是两个Hilbert空间列,对于每个d∈N,一个映射Sd:Hd→Ga就被称为一个解算子.一个多元问题是指求解一个算子序列S={Sd}d∈N。如果S={Sd}d∈N是由线性映射组成的,则称S为多元线性问题.我们通常用有限个信息算子构造算法来求解问题(逼近解算子),其中一个信息算子是指一个连续线性泛函.
The goal of this paper is to study d-variate approximation problems in the worst case setting and algorithms that use finitely many evaluations of arbi- trary linear functionals. In the respects of the exponential convergence-tractability of general linear problems defined over Hilbert spaces, we provide matching neces- sary and sufficient conditions for the respective tractability types.