A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Average complexity for linear operators over bounded domains
1987
Journal of Complexity
Suppose one wants to compare worst case and average complexities for approximation of a linear operator. In order to get a fair comparison the complexities have to be obtained for the same domain of the linear operator. In previous papers, average complexity was studied when the domain was the entire space. To avoid trivial results, worst case complexity has been studied for bounded domains, and in particular, for balls of finite radius. In this paper we study the average complexity for
doi:10.1016/0885-064x(87)90005-7
fatcat:o23vvmsi6vfptgndxl4zrcjsam