Can adaption help on the average?
From MaRDI portal
Publication:760763
DOI10.1007/BF01410103zbMATH Open0555.65030OpenAlexW1976232523MaRDI QIDQ760763FDOQ760763
Authors: Grzegorz W. Wasilkowski, H. Woźniakowski 
Publication date: 1984
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132927
Recommendations
Analysis of algorithms and problem complexity (68Q25) General theory of numerical analysis in abstract spaces (65J05)
Cites Work
- Gaussian measures in Banach spaces
- Title not available (Why is that?)
- Average case optimal algorithms in Hilbert spaces
- On the Optimal Solution of Large Linear Systems
- Average case optimality for linear problems
- On the optimal error of algorithms for solving scalar autonomous ODE
- Bisection is optimal
- Optimal sequential and non-sequential procedures for evaluating a functional
- Title not available (Why is that?)
- For which error criteria can we solve nonlinear equations?
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (33)
- On sequential and parallel solution of initial value problems
- On average case errors in numerical analysis
- Basic principles of feedback and adaptive approaches in the finite element method
- On the adaptive and continuous information problems
- Recent developments in information-based complexity
- Another look at adaptation on the average
- Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case
- A survey of average case complexity for linear multivariate problems
- Average case optimal algorithms in Hilbert spaces
- Optimal linear randomized methods for linear operators in Hilbert spaces
- Adaption helps for some nonconvex classes
- Integration and approximation of multivariate functions: average case complexity with isotropic Wiener measure
- What is the complexity of ill-posed problems?
- Approximation of linear functionals on a Banach space with a Gaussian measure
- A stochastic analog to Chebyshev centers and optimal average case algorithms
- 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
- Average complexity for linear problems in a model with varying information noise
- A minimax principle for the optimal error of Monte Carlo methods
- Complexity of multilinear problems in the average case setting
- Orthogonally invariant measures and best approximation of linear operators
- Information of varying cardinality
- How powerful is continuous nonlinear information for linear problems?
- Average case optimality
- The h, p and h-p versions of the finite element method in 1 dimension. III. The adaptive h-p version
- Randomized complexity of mean computation and the adaption problem
- The average a posteriori error of numerical methods
- A survey of information-based complexity
- Average approximations and moments of measures
- Adaptive approximation for multivariate linear problems with inputs lying in a cone
- On adaption with noisy information
- Parallel and sequential computation: A statistician's view
This page was built for publication: Can adaption help on the average?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760763)
