Local Average Error

Grzegorz W. Wasilkowski
An average case setting for linear problems has been studied in a series of recent papers. Optimal algorithms and optimal information were obtained for certain probability measures. In this paper the local average error of algorithms and local average radius of information are defined. Using these concepts, optimal information and optimal algorithms can be found for nonlinear problems and arbitrary Borel measures.
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.