Average case optimal algorithms in Hilbert spaces (Q1073284)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3944463
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average case optimal algorithms in Hilbert spaces |
scientific article; zbMATH DE number 3944463 |
Statements
Average case optimal algorithms in Hilbert spaces (English)
0 references
1986
0 references
We study optimal algorithms and optimal information for an average case model. This is done for linear problems in a separable Hilbert space equipped with a probability measure. We show, in particular, that for any measure a (linear) spline algorithm is optimal among linear algorithms. The spline algorithm is defined in terms of the covariance operator of the measure. We provide a condition on the measure which guarantees that the spline algorithm is optimal among all algorithms. The problem of optimal information is also solved.
0 references
optimal algorithms
0 references
optimal information
0 references
0.8629087805747986
0 references
0.860188364982605
0 references
0.8562260866165161
0 references
0.8530086278915405
0 references
0.8177058100700378
0 references