Can adaption help on the average?
From MaRDI portal
Publication:760763
DOI10.1007/BF01410103zbMath0555.65030OpenAlexW1976232523MaRDI QIDQ760763
Henryk Woźniakowski, Grzegorz W. Wasilkowski
Publication date: 1984
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132927
Analysis of algorithms and problem complexity (68Q25) General theory of numerical analysis in abstract spaces (65J05)
Related Items
A survey of information-based complexity, Approximation of linear functionals on a Banach space with a Gaussian measure, Parallel and sequential computation: A statistician's view, On adaption with noisy information, A stochastic analog to Chebyshev centers and optimal average case algorithms, Another look at adaptation on the average, What is the complexity of ill-posed problems?, Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case, Recent developments in information-based complexity, On sequential and parallel solution of initial value problems, Orthogonally invariant measures and best approximation of linear operators, A survey of average case complexity for linear multivariate problems, Complexity of multilinear problems in the average case setting, Optimal linear randomized methods for linear operators in Hilbert spaces, A minimax principle for the optimal error of Monte Carlo methods, Integration and approximation of multivariate functions: average case complexity with isotropic Wiener measure, On adaptive information with varying cardinality for linear problems with elliptically contoured measures, s-numbers in information-based complexity, On the average complexity of multivariate problems, The h, p and h-p versions of the finite element method in 1 dimension. III. The adaptive h-p version, Information of varying cardinality, On average case errors in numerical analysis, Average approximations and moments of measures, Basic principles of feedback and adaptive approaches in the finite element method, The average a posteriori error of numerical methods, Average case optimality, Average case optimal algorithms in Hilbert spaces
Cites Work
- Average case optimality for linear problems
- Average case optimal algorithms in Hilbert spaces
- For which error criteria can we solve nonlinear equations?
- Bisection is optimal
- On the optimal error of algorithms for solving scalar autonomous ODE
- Gaussian measures in Banach spaces
- On the Optimal Solution of Large Linear Systems
- Optimal sequential and non-sequential procedures for evaluating a functional
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
