#### Filter Results:

#### Publication Year

2008

2011

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We study the complexity of randomized solution of initial value problems for systems of ordinary differential equations (ODE). The input data are assumed to be γ-smooth (γ = r + : the r-th derivatives satisfy a-Hölder condition). Recently, the following almost sharp estimate of the order of the n-th minimal error was given by Kacewicz (Almost optimal… (More)

We show that for functions f ∈ L p ([0, 1] d), where 1 ≤ p ≤ ∞, the family of integrals [0,x] f (t)dt (x = (x 1 ,. .. , x d) ∈ [0, 1] d) can be approximated by a randomized algorithm uniformly over x ∈ [0, 1] d with the same rate n −1+1/ min(p,2) as the optimal rate for a single integral, where n is the number of samples. We present two algorithms, one… (More)

- Bernhard Milla
- 2011

- ‹
- 1
- ›