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

DOI10.1006/JCPH.1997.5844MaRDI QIDQ1383040zbMATH OpenOpenAlexFDO

Authors Jos L. M. van Dorsselaer

Publication date 27 October 1998

Published in Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcph.1997.5844

zbMATH Keywords

bifurcation pointscontinuation methodsdifferential systemeigenvalue problemJacobi-Davidson QZ algorithmlinear stabilitystationary solutions

Mathematics Subject Classification ID

Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Review text

The paper is concerned with the computation of stationary solutions of a differential system, involving one or more physical parameters, using a technique called ``continuation method. In order to determine whether a stationary solution is stable and to find the bifurcation points of the system, the rightmost eigenvalues of a related generalized eigenvalue problem are computed. The QZ method of Jacobi-Davidson, recently developed [SIAM J. Sci. Comput., to appear, or Preprint No. 941 Dept. Math., Utrecht Univ., Netherland] is used for computing the eigenvalues. As an application, the 2D Rayleigh-Bernard problem is considered. Numerical examples are performed for illustrate the performance of the Jacobi-Davidson QZ method.

Recommendations

• A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• Computational Science - ICCS 2004
• A Jacobi-Davidson type method for computing real eigenvalues of the quadratic eigenvalue problem
• scientific article; zbMATH DE number 2152750
• Jacobi-Davidson methods for polynomial two-parameter eigenvalue problems
• A new justification of the Jacobi-Davidson method for large eigenproblems
• Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
• Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method
• Accurate Eigensystem Computations by Jacobi Methods

Cites work

• A Simultaneous Iteration Algorithm for Real Matrices
• An efficient code to compute non-parallel steady flows and their linear stability
• An incomplete-factorization preconditioning using repeated red-black ordering
• BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 3930251 (Why is no real title available?)
• scientific article; zbMATH DE number 1068079 (Why is no real title available?)
• scientific article; zbMATH DE number 1069173 (Why is no real title available?)
• Hybrid Krylov Methods for Nonlinear Systems of Equations
• Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
• Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
• Practical bifurcation and stability analysis: from equilibrium to chaos.

Cited in

(6)

• The Jacobi-Davidson method
• scientific article; zbMATH DE number 2152750 (Why is no real title available?)
• Application of the Jacobi-Davidson method to accurate analysis of singular linear hydrodynamic stability problems
• Linear stability of flow in a differentially heated cavity via large‐scale eigenvalue calculations
• A fully implicit model of the three-dimensional thermohaline ocean circulation
• JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices

Describes a project that uses

Uses Software

• JDQZ
• JDQR

This page was built for publication: Computing eigenvalues occurring in continuation methods with the Jacobi-Davidson QZ method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383040)