Pages that link to "Item:Q3474221"
From MaRDI portal
The following pages link to On the minimal cost of approximating linear problems based on information with deterministic noise (Q3474221):
Displaying 17 items.
- On the optimal robust solution of IVPs with noisy information (Q261847) (← links)
- Exact orders of computational (numerical) diameters in problems of reconstructing functions and sampling solutions of the Klein-Gordon equation from Fourier coefficients (Q483194) (← links)
- The exact information-based complexity of smooth convex minimization (Q511109) (← links)
- Noisy information for linear problems in the asymptotic setting (Q806961) (← links)
- On the power of standard information for \(L_{\infty}\) approximation in the randomized setting (Q1035792) (← links)
- Average complexity for linear problems in a model with varying information noise (Q1893075) (← links)
- Optimal approximation of stochastic integrals in analytic noise model (Q2009523) (← links)
- Randomized Runge-Kutta method -- stability and convergence under inexact information (Q2041068) (← links)
- Complexity of approximating Hölder classes from information with varying Gaussian noise (Q2192676) (← links)
- Randomized derivative-free Milstein algorithm for efficient approximation of solutions of SDEs under noisy information (Q2199772) (← links)
- Optimal pointwise approximation of SDE's from inexact information (Q2360711) (← links)
- Worst case complexity of problems with random information noise (Q2365416) (← links)
- The minimal cost of approximating linear operators using perturbed information -- the asymptotic setting (Q2365845) (← links)
- Perspectives on information-based complexity (Q3992024) (← links)
- Termination Conditions for Approximating Linear Problems with Noisy Information (Q4031576) (← links)
- Information cost functions (Q5946559) (← links)
- Euler scheme for approximation of solution of nonlinear ODEs under inexact information (Q6064949) (← links)
