2000 character limit reached
On the randomized Euler schemes for ODEs under inexact information
Published 30 Apr 2021 in math.NA and cs.NA | (2104.15071v1)
Abstract: We analyse errors of randomized explicit and implicit Euler schemes for approximate solving of ordinary differential equations (ODEs). We consider classes of ODEs for which the right-hand side functions satisfy Lipschitz condition globally or only locally. Moreover, we assume that only inexact discrete information, corrupted by some noise, about the right-hand side function is available. Optimality and stability of explicit and implicit randomized Euler algorithms are also investigated.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.