Hans Z. Munthe-Kaas

NA
4papers
62citations
Novelty18%
AI Score15

4 Papers

NAFeb 14, 2013
Symmetric spaces and Lie triple systems in numerical analysis of differential equations

Hans Z. Munthe-Kaas, Gilles Reinout W. Quispel, Antonella Zanna

A remarkable number of different numerical algorithms can be understood and analyzed using the concepts of symmetric spaces and Lie triple systems, which are well known in differential geometry from the study of spaces of constant curvature and their tangents. This theory can be used to unify a range of different topics, such as polar-type matrix decompositions, splitting methods for computation of the matrix exponential, composition of selfadjoint numerical integrators and dynamical systems with symmetries and reversing symmetries. The thread of this paper is the following: involutive automorphisms on groups induce a factorization at a group level, and a splitting at the algebra level. In this paper we will give an introduction to the mathematical theory behind these constructions, and review recent results. Furthermore, we present a new Yoshida-like technique, for self-adjoint numerical schemes, that allows to increase the order of preservation of symmetries by two units. Since all the time-steps are positive, the technique is particularly suited to stiff problems, where a negative time-step can cause instabilities.

DGMar 24, 2019
Invariant connections, Lie algebra actions, and foundations of numerical integration on manifolds

Hans Z. Munthe-Kaas, Ari Stern, Olivier Verdier

Motivated by numerical integration on manifolds, we relate the algebraic properties of invariant connections to their geometric properties. Using this perspective, we generalize some classical results of Cartan and Nomizu to invariant connections on algebroids. This has fundamental consequences for the theory of numerical integrators, giving a characterization of the spaces on which Butcher and Lie-Butcher series methods, which generalize Runge-Kutta methods, may be applied.

NAJan 4, 2013
On algebraic structures of numerical integration on vector spaces and manifolds

Alexander Lundervold, Hans Z. Munthe-Kaas

Numerical analysis of time-integration algorithms has been applying advanced algebraic techniques for more than fourty years. An explicit description of the group of characters in the Butcher-Connes-Kreimer Hopf algebra first appeared in Butcher's work on composition of integration methods in 1972. In more recent years, the analysis of structure preserving algorithms, geometric integration techniques and integration algorithms on manifolds have motivated the incorporation of other algebraic structures in numerical analysis. In this paper we will survey structures that have found applications within these areas. This includes pre-Lie structures for the geometry of flat and torsion free connections appearing in the analysis of numerical flows on vector spaces. The much more recent post-Lie and D-algebras appear in the analysis of flows on manifolds with flat connections with constant torsion. Dynkin and Eulerian idempotents appear in the analysis of non-autonomous flows and in backward error analysis. Non-commutative Bell polynomials and a non-commutative Faà di Bruno Hopf algebra are other examples of structures appearing naturally in the numerical analysis of integration on manifolds.

NAOct 27, 2017
Lie-Butcher series, Geometry, Algebra and Computation

Hans Z. Munthe-Kaas, Kristoffer K. Føllesdal

Lie-Butcher (LB) series are formal power series expressed in terms of trees and forests. On the geometric side LB-series generalizes classical B-series from Euclidean spaces to Lie groups and homogeneous manifolds. On the algebraic side, B-series are based on pre-Lie algebras and the Butcher-Connes-Kreimer Hopf algebra. The LB-series are instead based on post-Lie algebras and their enveloping algebras. Over the last decade the algebraic theory of LB-series has matured. The purpose of this paper is twofold. First, we aim at presenting the algebraic structures underlying LB series in a concise and self contained manner. Secondly, we review a number of algebraic operations on LB-series found in the literature, and reformulate these as recursive formulae. This is part of an ongoing effort to create an extensive software library for computations in LB-series and B-series in the programming language Haskell.