{'fraction_non_alphanumeric': 0.0257201646090535, 'fraction_numerical': 0.0, 'mean_word_length': 5.08125, '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}}
University of Cambridge Complexity Theory for Lie-group Solvers Complexity Theory for Lie-group Solvers

Commencing with a brief survey of Lie-group theory and diierential equations evolving on Lie groups, we describe a number of numerical algorithms designed to respect Lie-group structure: Runge{Kutta{Munthe-Kaas schemes, Fer and Magnus expansions. This is followed by complexity analysis of Fer and Magnus expansions, whose conclusion is that for order four, six and eight an appropriately discretized Magnus method is always cheaper than a Fer method of the same order. Each Lie-group method of the kind surveyed in this paper requires the computation of a matrix exponential. Classical methods, e.g. Krylov-subspace and rational approximants, may fail to map elements in a Lie algebra to a Lie group. Therefore we survey a number of approximants based on the splitting approach and demonstrate that their cost is compatible (and often superior) to classical methods.