A comparative study of computation of Lyapunov spectra with different algorithms

In this paper we make a detailed numerical comparison between three algorithms for the computation of the full Lyapunov spectrum as well as the associated eigenvectors of general dynamical systems. They are: (a) the standard method, (b) a differential formulation of the standard method, and (c) a ne...

Full description

Saved in:
Bibliographic Details
Published in:Physica. D 2000-05, Vol.139 (1), p.72-86
Main Authors: Ramasubramanian, K., Sriram, M.S.
Format: Article
Language:English
Subjects:
CPU time
Dyanamical system
Lyapunov spectra
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we make a detailed numerical comparison between three algorithms for the computation of the full Lyapunov spectrum as well as the associated eigenvectors of general dynamical systems. They are: (a) the standard method, (b) a differential formulation of the standard method, and (c) a new algorithm which does not require rescaling and reorthogonalization. We also bring out the relations among these methods. Moreover, we give a simplified formulation of the new algorithm when the dimensionality of the system is 4. We find that there is reasonable agreement among the Lyapunov spectra obtained using the three algorithms in most cases. However the standard method seems to be the most efficient followed by the new method and the differential version of the standard method (in that order), as far as the CPU time for the computation of the Lyapunov spectra is concerned. The new method is hardly suitable for finding the eigenvectors, whereas the other procedures give nearly identical numerical results.
ISSN:0167-2789
1872-8022
DOI:10.1016/S0167-2789(99)00234-1