next up previous
Next: About this document ...

Complexity theory of Lie-group solvers

S.P. Nørsett

Department of Mathematical Sciences, NTNU, N-7491 Trondheim, Norway
norsett@math.ntnu.no
http://www.math.ntnu.no/~norsett/
Contributed talk


We commence with a brief summary of Lie-group theory, we describe a number of numerical algorithms designed to respect Lie-group structure: Runge-Kutta-Munthe Kaas, Fer and Magnus expansions.

The complexity for classical ODE methods is normally mesured in terms of function calls. For Lie group methods we need also to count the number of commutators and the number of exponential evaluations.




Ernst Hairer
2002-05-27