Computing eigenvalues occuring in continuation methods with the Jacobi-Davidson QZ method

Continuation methods are well-known techniques for computing several stationary solutions of problems involving one or more physical parameters. In order to determine whether a stationary solution is stable, and to detect the bifurcation points of the problem, one has to compute the rightmost eigenvalues of a related, generalized eigenvalue problem. The recently developed Jacobi?Davidson QZ method can be very effective for computing several eigenvalues of a given generalized eigenvalue problem. In this paper we will explain how the Jacobi?Davidson QZ method can be used to compute the eigenvalues needed in the application of continuation methods. As an illustration, the two-dimensional Rayleigh?Benard problem has been studied, with the Rayleigh number as a physical parameter. We investigated the stability of stationary solutions, and several bifurcation points have been detected. The Jacobi?Davidson QZ method turns out to be very efficient for this problem.

[1]  William J. Stewart,et al.  A Simultaneous Iteration Algorithm for Real Matrices , 1981, TOMS.

[2]  Y. Saad,et al.  GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .

[3]  R. Seydel.  Practical Bifurcation and Stability Analysis , 1994 .

[4]  G. Tiesinga.  Block preconditioned BiCGstab(2) for solving the Navier-Stokes equations , 1996 .

[5]  H. V. D. Vorst,et al.  Jacobi-Davidson style QR and QZ algorithms for the partial reduction of matrix pencils , 1996 .

[6]  G. Golub,et al.  150 years old and still alive: eigenproblems , 1997 .

[7]  H. V. D. Vorst,et al.  Jacobi-davidson type methods for generalized eigenproblems and polynomial eigenproblems , 1995 .

[8]  A. Ploeg,et al.  An efficient code to compute non-parallel steady flows and their linear stability , 1995 .

[9]  C. Brand.  An incomplete-factorization preconditioning using repeated red-black ordering , 1992 .

[10]  H. V. D. Vorst,et al.  Years old and still alive : eigenproblems , 2022 .

[11]  Yousef Saad,et al.  Hybrid Krylov Methods for Nonlinear Systems of Equations , 1990, SIAM J. Sci. Comput..

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

[13]  Gerard L. G. Sleijpen,et al.  Accelerated Inexact Newton Schemes for Large Systems of Nonlinear Equations , 1998, SIAM J. Sci. Comput..

[14]  Gerard L. G. Sleijpen,et al.  Jacobi-Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils , 1998, SIAM J. Sci. Comput..

[15]  D. R. Fokkema,et al.  BICGSTAB( L ) FOR LINEAR EQUATIONS INVOLVING UNSYMMETRIC MATRICES WITH COMPLEX , 1993 .

[16]  David A. H. Jacobs,et al.  The State of the Art in Numerical Analysis. , 1978 .