On the randomized Euler algorithm under inexact information
From MaRDI portal
Cites work
- A random Euler scheme for Carathéodory differential equations
- A randomized Milstein method for stochastic differential equations with non-differentiable drift coefficients
- Analysis of nested multilevel Monte Carlo using approximate normal random variables
- Approximation of piecewise Hölder functions from inexact information
- Error analysis of randomized Runge-Kutta methods for differential equations with time-irregular coefficients
- Noisy Information and Computational Complexity
- Noisy information: optimality, complexity, tractability
- On the minimal cost of approximating linear problems based on information with deterministic noise
- On the optimal robust solution of IVPs with noisy information
- On the properties of the exceptional set for the randomized Euler and Runge-Kutta schemes
- On the randomized Euler schemes for ODEs under inexact information
- Optimal approximation of stochastic integrals in analytic noise model
- Optimal estimation theory for dynamic systems with set membership uncertainty: An overview
- Optimal pointwise approximation of SDE's from inexact information
- Randomized derivative-free Milstein algorithm for efficient approximation of solutions of SDEs under noisy information
- Strong approximation of solutions of stochastic differential equations with time-irregular coefficients via randomized Euler algorithm
- The complexity of definite elliptic problems with noisy data
- The complexity of indefinite elliptic problems with noisy data
Cited in
(1)
This page was built for publication: On the randomized Euler algorithm under inexact information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6894196)