Krylov integrators for Hamiltonian systems

  title={Krylov integrators for Hamiltonian systems},
  author={Timo Eirola and Antti Koskela},
  journal={BIT Numerical Mathematics},
We consider Arnoldi-like processes to obtain symplectic subspaces for Hamiltonian systems. Large dimensional systems are locally approximated by ones living in low dimensional subspaces, and we especially consider Krylov subspaces and some of their extensions. These subspaces can be utilized in two ways: by solving numerically local small dimensional systems and then mapping back to the large dimension, or by using them for the approximation of necessary functions in exponential integrators… 

Figures from this paper

Global symplectic Lanczos method with application to matrix exponential approximation
It is well-known that the symplectic Lanczos method is an efficient tool for computing a few eigenvalues of large and sparse Hamiltonian matrices. A variety of block Krylov subspace methods were
A block J-Lanczos method for Hamiltonian matrices
This work aims to present a structure-preserving block Lanczos-like method. The Lanczos-like algorithm is an effective way to solve large sparse Hamiltonian eigenvalue problems. It can also be used
Krylov projection methods for linear Hamiltonian systems
The connection to structure preserving model reduction is discussed and the performance of Krylov projection methods is illustrated by applying them to Hamiltonian PDEs.


Geometric Numerical Integration: Structure Preserving Algorithms for Ordinary Differential Equations
Numerical methods that preserve properties of Hamiltonian systems, reversible systems, differential equations on manifolds and problems with highly oscillatory solutions are the subject of this book.
Exponential integrators
The main intention in this article is to present the mathematics behind these methods, and derive error bounds that are independent of stiffness or highest frequencies in the system.
Exponential Integrators for Large Systems of Differential Equations
This work studies the numerical integration of large stiff systems of differential equations by methods that use matrix--vector products with the exponential or a related function of the Jacobian, and derives methods up to order 4 which are exact for linear constant-coefficient equations.
On Krylov Subspace Approximations to the Matrix Exponential Operator
Krylov subspace methods for approximating the action of matrix exponentials are analyzed in this paper. We derive error bounds via a functional calculus of Arnoldi and Lanczos methods that reduces
On Hamiltonian and symplectic Lanczos processes
Abstract Large sparse Hamiltonian eigenvalue problems arise in a variety of contexts. These problems can be attacked directly, or they can first be transformed to problems having some related
Efficient Solution of Parabolic Equations by Krylov Approximation Methods
This paper takes a new look at numerical techniques for solving parabolic equations by the method of lines by approximate the action of the evolution operator on a given state vector by means of a projection process onto a Krylov subspace.
Analysis of some Krylov subspace approximations to the matrix exponential operator
In this note a theoretical analysis of some Krylov subspace approximations to the matrix exponential operation $\exp (A)v$ is presented, and a priori and a posteriors error estimates are established.
Preserving energy resp. dissipation in numerical PDEs using the "Average Vector Field" method
We give a systematic method for discretizing Hamiltonian partial differential equations (PDEs) with constant symplectic structure, while preserving their energy exactly. The same method, applied to
An Implicitly Restarted Symplectic Lanczos Method for the Hamiltonian Eigenvalue Problem
Abstract An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem is presented. The Lanczos vectors are constructed to form a symplectic basis. The inherent numerical
Structure-Preserving Methods for Computing Eigenpairs of Large Sparse Skew-Hamiltonian/Hamiltonian Pencils
This work develops a structure-preserving skew-Hamiltonian, isotropic, implicitly restarted shift-and-invert Arnoldi algorithm (SHIRA), and several numerical examples demonstrate the superiority of SHIRA over a competing unstructured method.