Optimal linear randomized methods for linear operators in Hilbert spaces
Some of the basic questions of information-based complexity are strongly related to \(n\)-width and \(s\)-numbers. These relations were studied in particular by \textit{P. Mathé} [J. Complexity 6, No. 1, 41-66 (1990; Zbl 0723.68047)]. The author studies Monte Carlo methods or randomized methods for linear operators. The main result is the characterization of linear stochastic \(n\)-widths in the case of linear operators in Hilbert spaces.
scientific article; zbMATH DE number 55603