论文信息 - Computing Connecting Orbits via an Improved Algorithm for Continuing Invariant Subspaces

Computing Connecting Orbits via an Improved Algorithm for Continuing Invariant Subspaces

A successive continuation method for locating connecting orbits in parametrized systems of autonomous ODEs was considered in [Numer. Algorithms, 14 (1997), pp. 103--124]. In this paper we present an improved algorithm for locating and continuing connecting orbits, which includes a new algorithm for the continuation of invariant subspaces. The latter algorithm is of independent interest and can be used in contexts different than the present one.

[1] Luca Dieci,et al. Continuation of invariant subspaces , 2001, Numer. Linear Algebra Appl..

[2] J. H. Wilkinson,et al. IMPROVING THE ACCURACY OF COMPUTED EIGENVALUES AND EIGENVECTORS , 1983 .

[3] Mark J. Friedman,et al. Numerical computation and continuation of invariant manifolds connecting fixed points , 1991 .

[4] Gene H. Golub,et al. Matrix computations , 1983 .

[5] Thomas F. Fairgrieve,et al. AUTO 2000 : CONTINUATION AND BIFURCATION SOFTWARE FOR ORDINARY DIFFERENTIAL EQUATIONS (with HomCont) , 1997 .

[6] G. Stewart. Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems , 1973 .

[7] G. Moore,et al. Computation and parametrization of periodic and connecting orbits , 1995 .

[8] Wolf-Jürgen Beyn,et al. The Numerical Computation of Connecting Orbits in Dynamical Systems , 1990 .

[9] F. Chatelin. Simultaneous Newton’s Iteration for the Eigenproblem , 1984 .

[10] Timo Eirola,et al. On Smooth Decompositions of Matrices , 1999, SIAM J. Matrix Anal. Appl..

[11] Wolf-Jürgen Beyn. Global Bifurcations and their Numerical Computation , 1990 .

[12] Björn Sandstede,et al. A numerical toolbox for homoclinic bifurcation analysis , 1996 .