Abstract
During the computation of a one-parameter set of steady solutions to a time dependent problem, it is often of great interest to know when periodic behaviour can occur. This Hopf bifurcation is characterised by the linearisation about a steady state solution possessing a purely imaginary pair of eigenvalues. The cheap and reliable detection of such bifurcation is not however straightforward. The present paper examines the problem and suggests various strategies for solving it.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L. V. Ahlfors. Complex Analysis. McGraw Hill, New York, 1966.
E. J. Doedel, J. P. Kernevez. AUTO: software for continuation and bifurcation problems in ordinary differential equations. Appl. Math. Tech. Rep., Cal. Tech., 1986.
P. J. Eberlein. A Jacobi-like method for the automatic computation of eigenvalues and eigenvectors of an abitrary matrix. J. Soc. Ind. Appl. Math., 10, pages 74–88, 1962.
J.N. Franklin. Matrix Theory. Prentice-Hall, New Jersey, 1968.
F. R. Gantmacher . Matrix Theory Vol. II. Chelsea Publishing Co., New York, 1959.
P. Henrici. Bounds for iterates, inverses, spectral variation and fields of values of non-normal matrices. Numer. Math., 4, pages 24–40, 1962.
P. Henrici. Applied and Computational Complex Analysis Vol. 1. Wiley-Inter science, New York, 1974.
D. Ho, F. Chatelin,, M. Bennani. Arnoldi-Tchebyshev procedure for large scale nonsymmetric matrices. Math. Mod. Num. Anal., 24, pages 53–65, 1990.
A. S. Householder. The Numerical Treatment of a Single Nonlinear Equation. McGraw Hill, New York, 1970.
W. Kahan, B.N. Parlett, E. Jiang. Residual bounds on approximate eigensystems of non-normal matrices. SIAM J. Numer. Anal., 19, pages 470–484, 1982.
P. Lancaster. Theory of Matrices. Academic, New York, 1969.
T.A. Manteuffel. The Tchebyshev iteration for nonsymmetric linear systems. Numer. Math., 28, pages 307–327, 1977.
T.A. Manteuffel. Adaptive procedure for estimation of parameter for the non-symmetric Tschebyshev iteration. Numer. Math., 31, pages 183–208, 1978.
B. Nour-Omid, B.N. Parlett, R. Taylor. Lanczoz versus subspace iteration for the solution of eigenvalue problems. Int. J. Numer. Meth. Eng., pages 859–871, 1983.
D. O’Leary, G.W. Stewart, J.S. Vandergraft. Estimating the largest eigenvalue of a positive definite matrix. Math. Comp., 33, pages 1289–1292, 1979.
B.N. Parlett. The Symmetric Eigenvalue Problem. Prentice Hall, New Jersey, 1980.
B.N. Parlett. Laguerre’s method applied to the matrix eigenvalue problem. Math. Comp., 18, pages 464–487, 1964.
B.N. Parlett, H. Simon, L.M. Stringer. On estimating the largest eigenvalue with the Lanczos algorithm. Math. Comp., 33, pages 153–165, 1982.
B.N. Parlett, D.R. Taylor, Z.A. Liu. A look-ahead Lanzcos algorithm for unsym-metric matrices. Math. Comp., 44 pages 105–124, 1985.
A. Ruhe. On the quadratic convergence of a generalisation of the Jacobi method to arbitrary matrices. BIT, 8, pages 210–231, 1968.
H. Rutishauser. Solution of eigenvalue problems with the LR transformation. Nat. Bur. Stand. Appl. Math., Ser. 49, pages 47–81, 1958.
H. Rutishauser. Une methóde pour le calcul des valeurs propres des matrices non- symétriques. Comptes Rendus, 259, page 2758, 1964.
Y. Saad. Variations of Arnoldi’s method for computing eigenelements of large unsym- metric matrices. Lin. Alg. & Appl., 34, pages 269–295, 1980.
Y. Saad. Least squares polynomials in the complex plane with applications to solving sparse non-symmetric matrix problems. Research Report YALEU/DCS/RR-276, 1983.
Y. Saad. Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems. Math. Comp., 42, pages 567–588, 1984.
G.W. Stewart . Simultaneous iteration for computing invariant subspaces of non- hermitian matrices. Numer. Math 25, pages 123–136, 1976.
F. Tibor. Normal equivalent to an arbitrary diagonalisable matrix. Lin. Alg. & Appl., 51, pages 153–162, 1983.
K. Veselic. On a class of Jacobi-like procedures for diagonalising arbitrary real matrices. Numer. Math., 33, pages 157–172, 1979.
J. H. Wilkinson. The Algebraic Eigenvalue Problem. Oxford Univ. Press, Oxford, 1965.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Kluwer Academic Publishers
About this chapter
Cite this chapter
Moore, G., Garratt, T.J., Spence, A. (1990). The Numerical Detection of Hopf Bifurcation Points. In: Roose, D., Dier, B.D., Spence, A. (eds) Continuation and Bifurcations: Numerical Techniques and Applications. NATO ASI Series, vol 313. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-0659-4_15
Download citation
DOI: https://doi.org/10.1007/978-94-009-0659-4_15
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-6781-2
Online ISBN: 978-94-009-0659-4
eBook Packages: Springer Book Archive