Results 1  10
of
29
Liegroup methods
 ACTA NUMERICA
, 2000
"... Many differential equations of practical interest evolve on Lie groups or on manifolds acted upon by Lie groups. The retention of Liegroup structure under discretization is often vital in the recovery of qualitatively correct geometry and dynamics and in the minimization of numerical error. Having ..."
Abstract

Cited by 149 (24 self)
 Add to MetaCart
Many differential equations of practical interest evolve on Lie groups or on manifolds acted upon by Lie groups. The retention of Liegroup structure under discretization is often vital in the recovery of qualitatively correct geometry and dynamics and in the minimization of numerical error. Having introduced requisite elements of differential geometry, this paper surveys the novel theory of numerical integrators that respect Liegroup structure, highlighting theory, algorithmic issues and a number of applications.
On Magnus Integrators for TimeDependent Schrödinger Equations
 SIAM J. Numer. Anal
, 2002
"... Numerical methods based on the Magnus expansion are an ecient class of integrators for Schrodinger equations with timedependent Hamiltonian. Though their derivation assumes an unreasonably small time step size as would be required for a standard explicit integrator, the methods perform well even f ..."
Abstract

Cited by 34 (2 self)
 Add to MetaCart
Numerical methods based on the Magnus expansion are an ecient class of integrators for Schrodinger equations with timedependent Hamiltonian. Though their derivation assumes an unreasonably small time step size as would be required for a standard explicit integrator, the methods perform well even for much larger step sizes. This favorable behavior is explained, and optimalorder error bounds are derived which require no or only mild restrictions of the step size. In contrast to standard integrators, the error does not depend on higher time derivatives of the solution, which is in general highly oscillatory.
On the Global Error of Discretization Methods for HighlyOscillatory Ordinary Differential Equations
, 2000
"... Commencing from a globalerror formula, originally due to Henrici, we investigate the accumulation of global error in the numerical solution of linear highlyoscillating systems of the form y 00 + g(t)y = 0, where g(t) t!1 \Gamma! 1. Using WKB analysis we derive an explicit form of the globalerror ..."
Abstract

Cited by 30 (6 self)
 Add to MetaCart
Commencing from a globalerror formula, originally due to Henrici, we investigate the accumulation of global error in the numerical solution of linear highlyoscillating systems of the form y 00 + g(t)y = 0, where g(t) t!1 \Gamma! 1. Using WKB analysis we derive an explicit form of the globalerror envelope for RungeKutta and Magnus methods. Our results are closely matched by numerical experiments. Motivated by the superior performance of Liegroup methods, we present a modification of the Magnus expansion which displays even better longterm behaviour in the presence of oscillations.
High order optimized geometric integrators for linear differential equations
, 2000
"... In this paper new integration algorithms for linear differential equations up to eighth order are obtained. Starting from Magnus expansion, methods based on Cayley transformation and Fer expansion are also built. The structure of the exact solution is retained while the computational cost is reduced ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
(Show Context)
In this paper new integration algorithms for linear differential equations up to eighth order are obtained. Starting from Magnus expansion, methods based on Cayley transformation and Fer expansion are also built. The structure of the exact solution is retained while the computational cost is reduced compared to similar methods. Their relative performance is tested on some illustrative examples.
Explicit Magnus expansions for nonlinear equations
 J. Physics A: Math. General
"... ..."
(Show Context)
Complexity theory for Liegroup solvers
, 1999
"... Commencing with a brief survey of Liegroup theory and differential equations evolving on Lie groups, we describe a number of numerical algorithms designed to respect Liegroup structure: RungeKuttaMuntheKaas schemes, Fer and Magnus expansions. This is followed by complexity analysis of Fer and M ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Commencing with a brief survey of Liegroup theory and differential equations evolving on Lie groups, we describe a number of numerical algorithms designed to respect Liegroup structure: RungeKuttaMuntheKaas 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 Liegroup method of the kind surveyed in this paper requires the computation of a matrix exponential. Classical methods, e.g. Krylovsubspace 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.
A Higher Order Local Linearization Method for Solving Ordinary Differential Equations
"... The Local Linearization (LL) method for the integration of ordinary differential equations is an explicit onestep method that has a number of suitable dynamical properties. However, a major drawback of the LL integrator is that its order of convergence is only two. The present paper overcomes this ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
The Local Linearization (LL) method for the integration of ordinary differential equations is an explicit onestep method that has a number of suitable dynamical properties. However, a major drawback of the LL integrator is that its order of convergence is only two. The present paper overcomes this limitation by introducing a new class of numerical integrators, called the LLT method, that is based on the addition of a correction term to the LL approximation. In this way an arbitrary order of convergence can be achieved while retaining the dynamic properties of the LL method. In particular, it is proved that the LLT method reproduces correctly the phase portrait of a dynamical system near hyperbolic stationary points to the order of convergence. The performance of the introduced method is further illustrated through computer simulations.
Splitting methods for nonautonomous separable dynamical systems
 J. Phys. A: Math. Gen
, 2006
"... A large number of splitting methods for autonomous separable systems exist in the literature which have been designed for many different structures of the vector field. However, the performance of most of these methods is diminished and their orders of accuracy are frequently reduced when applied to ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
(Show Context)
A large number of splitting methods for autonomous separable systems exist in the literature which have been designed for many different structures of the vector field. However, the performance of most of these methods is diminished and their orders of accuracy are frequently reduced when applied to nonautonomous problems. Based on the formal solution obtained from the Magnus series expansion, we show how to modify a standard splitting method for autonomous problems to treat nonautonomous systems with similar or better efficiency. We illustrate this technique to build new fourth and sixthorder schemes whose performance is then illustrated on several numerical examples.
Global error control of the timepropagation for the Schrödinger equation with an explicitly timedependent Hamiltonian
, 2009
"... We use a posteriori error estimation theory to derive a relation between local and global error in the propagation for the timedependent Schrödinger equation. Based on this result, we design a class of h, padaptive Magnus–Lanczos propagators capable of controlling the global error of the timestep ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
(Show Context)
We use a posteriori error estimation theory to derive a relation between local and global error in the propagation for the timedependent Schrödinger equation. Based on this result, we design a class of h, padaptive Magnus–Lanczos propagators capable of controlling the global error of the timestepping scheme by only solving the equation once. We provide results for models of several different small molecules including bounded and dissociative states, illustrating the efficiency and wide applicability of the new methods. Key words global error control·h, padaptivity · Magnus–Lanczos propagator · timedependent Schrödinger equation 1