Discontinuous information in the worst case and randomized settings
✍ Scribed by Aicke Hinrichs; Erich Novak; Henryk Woźniakowski
- Publisher
- John Wiley and Sons
- Year
- 2012
- Tongue
- English
- Weight
- 180 KB
- Volume
- 286
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
We believe that discontinuous linear information is never more powerful than continuous linear information for approximating continuous operators. We prove such a result in the worst case setting. In the randomized setting we consider compact linear operators defined between Hilbert spaces. In this case, the use of discontinuous linear information in the randomized setting cannot be much more powerful than continuous linear information in the worst case setting. These results can be applied when function evaluations are used even if function values are defined only almost everywhere.
📜 SIMILAR VOLUMES
## Abstract Trauma centers are stressful, noisy, and dynamic places, with many people performing complex tasks, and with no technological aids to support their operations. This paper describes research that uses an emergency room as a natural laboratory for investigating information behavior and in
## Abstract For point sets in the rectilinear plane, we consider the following five measures of the interconnect length and prove bounds on the worst‐case ratio: minimum Steiner tree, minimum star, clique, minimum spanning tree, and bounding box. In particular, we prove that, for any set of __n__ p