Average complexity for linear operators over bounded domains (Q579854): Difference between revisions
From MaRDI portal
Latest revision as of 10:15, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Average complexity for linear operators over bounded domains |
scientific article |
Statements
Average complexity for linear operators over bounded domains (English)
0 references
1987
0 references
The worst case and average complexities for approximation of linear operators whose domain is a ball of finite radius q are compared. One proves that the average complexities even for the modest q and for \(q=+\infty\) are closely related. The average complexity for normalized and relative errors is also analyzed. The paper is illustrated by integration of functions of one variable and by approximation of functions of d variables which are equipped with a Wiener measure. See also the papers of \textit{D. Lee} and \textit{G. W. Wasilkowski} [ibid. 2, 12-43 (1986; Zbl 0602.65036)] and \textit{G. W. Wasilkowski} [ibid. 2, 204- 228 (1986; Zbl 0615.94004)].
0 references
worst case complexity
0 references
average complexity
0 references
integration of functions
0 references
approximation of functions
0 references
Wiener measure
0 references
0 references