Average case optimal algorithms in Hilbert spaces
From MaRDI portal
Publication:1073284
DOI10.1016/0021-9045(86)90043-2zbMath0588.41008OpenAlexW2048357906MaRDI QIDQ1073284
Grzegorz W. Wasilkowski, Henryk Woźniakowski
Publication date: 1986
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9045(86)90043-2
Related Items (20)
Asymptotic analysis in multivariate average case approximation with Gaussian kernels ⋮ A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications ⋮ An information-based approach to ill-posed problems ⋮ Invertibility of random fredholm operators ⋮ What is the complexity of ill-posed problems? ⋮ An estimate of average case approximation complexity for tensor degrees of random processes ⋮ Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements ⋮ Asymptotic analysis of average case approximation complexity of additive random fields ⋮ Recent developments in information-based complexity ⋮ Orthogonally invariant measures and best approximation of linear operators ⋮ Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces ⋮ Corrections to Probabilistic analysis of numerical methods for integral equations ⋮ Average case tractability of approximating ∞-variate functions ⋮ Approximation complexity of sums of random processes ⋮ On the average complexity of multivariate problems ⋮ Can adaption help on the average? ⋮ Information of varying cardinality ⋮ How powerful is continuous nonlinear information for linear problems? ⋮ Probabilistic analysis of numerical methods for integral equations ⋮ Average case optimal algorithms in Hilbert spaces
Cites Work
This page was built for publication: Average case optimal algorithms in Hilbert spaces
