Continuation of invariant subspaces via the Recursive Projection Method

Applications of Mathematics

Volumn 48, Issue 4, 2003, Pages 241-255

  Janovsky V ^a   Liberda, O ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

pathfollowing; stability exchange; steady states; unstable invariant subspace

Indexed keywords

EID: 84867962765     PISSN: 08627940     EISSN: 15729109     Source Type: Journal    
DOI: 10.1023/A:1026058514236     Document Type: Article

References (11)

1. E. L. Allgower. K. Georg: Numerical Continuation Methods. Springer Verlag, New York, 1990.
2. J. Bošek, V. Janovský: A note on the recursive projection method. Proceedings of GAMM96. Z. Angew. Math. Mech. (1977), 437-440.
3. B. D. Davidson 1997 Large-scale continuation and numerical bifurcation for partial differential equations SIAM J. Numer. Anal. 34 2001 2027
4. T. J. Garratt, G. Moore and A. Spence: A generalised Cayley transform for the numerical detection of Hopf bifurcation points in large systems. Contributions in numerical mathematics, World Sci. Ser. Appl. Anal. (1993), 177-195.
5. G. H. Golub, Ch. F. van Loan: Matrix Computations. The Johns Hopkins University Press, Baltimore, 1996.
6. V. Janovský, O. Liberda: Recursive Projection Method for detecting bifurcation points. Proceedings SANM'99. Union of Czech Mathematicians and Physicists, 1999, pp. 121-124.
7. V. Janovský, O. Liberda: Projected version of the Recursive Projection Method algorithm. Proceedings of 3rd Scientific Colloquium. Institute of Chemical Technology, Prague, 2001, pp. 89-100.
8. M. Kubíček, M. Marek: Computational Methods in Bifurcation Theory and Dissipative Structures. Springer, 1983.
9. J. Kurzweil: Ordinary Differential Equations. Elsevier, 1986.
10. K. Lust, D. Roose: Computation and bifurcation analysis of periodic solutions of large-scale systems. IMA Preprint Series #1536, Feb. 1998, IMA, University of Minnesota.
11. G. M. Shroff H. B. Keller 1993 Stabilization of unstable procedures: the Recursive Projection Method SIAM J. Numer. Anal. 30 1099 1120