Average case optimal algorithms in Hilbert spaces
From MaRDI portal
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.
Recommendations
Cites work
- Average case optimal algorithms in Hilbert spaces
- Average case optimality for linear problems
- Can adaption help on the average?
- Gaussian measures in Banach spaces
- scientific article; zbMATH DE number 3827201 (Why is no real title available?)
- scientific article; zbMATH DE number 3688714 (Why is no real title available?)
- scientific article; zbMATH DE number 3480903 (Why is no real title available?)
- scientific article; zbMATH DE number 3204642 (Why is no real title available?)
- Orthogonal projections are optimal algorithms
Cited in
(29)- Average case optimal algorithms in Hilbert spaces
- An information-based approach to ill-posed problems
- A stochastic analog to Chebyshev centers and optimal average case algorithms
- Corrections to Probabilistic analysis of numerical methods for integral equations
- Information of varying cardinality
- How powerful is continuous nonlinear information for linear problems?
- On linearity of spline algorithms
- Optimal average case estimation in Hilbert norms
- Asymptotic analysis in multivariate average case approximation with Gaussian kernels
- Approximation complexity of sums of random processes
- Asymptotic analysis of average case approximation complexity of additive random fields
- An estimate of average case approximation complexity for tensor degrees of random processes
- Optimal algorithms for computing average temperatures
- A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications
- Invertibility of random fredholm operators
- What is the complexity of ill-posed problems?
- Recent developments in information-based complexity
- scientific article; zbMATH DE number 177344 (Why is no real title available?)
- An Average-Case Sublinear Exact Li and Stephens Forward Algorithm
- Average case tractability of approximating -variate functions
- Asymptotics of Average Case Approximation Complexity for Tensor Products of Euler Integrated Processes
- On the average complexity of multivariate problems
- Can adaption help on the average?
- Orthogonal projections are optimal algorithms
- Average case optimality for linear problems
- Probabilistic analysis of numerical methods for integral equations
- Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements
- Orthogonally invariant measures and best approximation of linear operators
- Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces
This page was built for publication: Average case optimal algorithms in Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1073284)
