Discrete mathematics

Channel (broadcasting)

Pure mathematics

Linear operators

Computer network

Mathematics

Economic growth

Evolutionary biology

Biology

Banach space

Mathematical analysis

Function (biology)

Economics

Convergence (economics)

Computer science

Separable space

Applied mathematics

Bounded function

Rate of convergence

Hilbert space

Polynomial

Journal of Complexity

In the first part we have shown that, for L2-approximation of functions from a separable Hilbert space in the worst-case setting, linear algorithms based on function values are almost as powerful as arbitrary linear algorithms if the linear widths are square-summable. That is, they achieve the same polynomial rate of convergence. In this sequel, we prove a similar result for separable Banach spaces and other classes of functions.

Function values are enough for L2-approximation: Part II