No label defined (Q4037207)

[For the entire collection see Zbl 0755.00006.] Let \(F\) be a set in a linear space and \(S\) an operator from \(F\) to a metric space \(B\). Knowing that \(f\in F\) one constructs an approximation for \(S(f)\) which is based on the information \(x^ n(f)= (y_ 1,\dots,y_ n)\), \(y_ i= x_ i(f)\), where \(x_ i\) is a linear operator from a given set \(X_ i\), \(i=1,\dots,n\). The problem is to choose information operators \(x_ 1,\dots,x_ n\) and a terminal operation, i.e., an operator \(\beta: \{x^ n\times x^ n(f)\}\to B\) which approximates \(S(f)\). In this paper, some classes of stochastic algorithms for choosing \(x^ n\) and \(\beta\) are described.