On the random generation of Butcher trees

Abstract

The main goal of this paper is to provide an algorithm for the random sampling of Butcher trees and the probabilistic numerical solution of ordinary differential equations (ODEs). This approach complements and simplifies a recent approach to the probabilistic representation of ODE solutions, by removing the need to generate random branching times. The random sampling of trees is compared to the finite order truncation of Butcher series in numerical experiments.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…