The randomized complexity of initial value problems

14 years 4 months ago

Download www.uni-kl.de

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

Stefan Heinrich, Bernhard Milla

Real-time Traffic

Initial Value Problems | JC 2008 | N-th Minimal Error | Randomized |

claim paper

» On the randomized solution of initial value problems

» A Domain Theoretic Account of Eulers Method for Solving Initial Value Problems

» A Study on Initialization for BP Networks

» Query Complexity Lower Bounds for Reconstruction of Codes

» Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature

» A Probabilistic Algorithm for kSAT and Constraint Satisfaction Problems

» Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Paramete...

» Initializing Sensor Networks of Nonuniform Density in the Weak Sensor Model

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JC
Authors	Stefan Heinrich, Bernhard Milla

Comments (0)

Sciweavers

The randomized complexity of initial value problems

Initial Value Problems | JC 2008 | N-th Minimal Error | Randomized |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers