{'fraction_non_alphanumeric': 0.024226110363391656, 'fraction_numerical': 0.010767160161507403, 'mean_word_length': 5.642857142857143, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Validated computation of the local truncation error of Runge–Kutta methods with automatic differentiation

A novel approach to bound the local truncation error of explicit and implicit Runge–Kutta methods is presented. This approach takes its roots in the modern theory of Runge–Kutta methods, namely the order condition theorem, defined by John Butcher in the 1960s. More precisely, our work is an instance, for Runge–Kutta methods, of the generic algorithm defined by Ferenc Bartha and Hans Munthe-Kaas in 2014 which computes B-series with automatic differentiation techniques. In particular, this specialized algorithm is combined with set-membership framework to define validated numerical integration methods based on Runge–Kutta methods.