Computing eigenvalues occurring in continuation methods with the Jacobi-Davidson QZ method
type: Item
instance of: scholarly article
title: Computing eigenvalues occurring in continuation methods with the Jacobi-Davidson QZ method
zbMATH Open document ID: 0899.65033
author: Jos L. M. van Dorsselaer
published in: Journal of Computational Physics
publication date: 1998-10-27T00:00:00Z
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.
Mathematics Subject Classification ID: 65H17
Mathematics Subject Classification ID: 65H20
zbMATH DE Number: 1138386
zbMATH Keywords: stationary solutions
zbMATH Keywords: linear stability
zbMATH Keywords: bifurcation points
zbMATH Keywords: continuation methods
zbMATH Keywords: eigenvalue problem
zbMATH Keywords: Jacobi-Davidson QZ algorithm
zbMATH Keywords: differential system
reviewed by: Iulian Coroian
describes a project that uses: JDQZ
describes a project that uses: JDQR
MaRDI profile type: Publication
full work available at URL: jcph.1997.5844
OpenAlex ID: W2103502297
cites work: An incomplete-factorization preconditioning using repeated red-black ordering
cites work: Hybrid Krylov Methods for Nonlinear Systems of Equations
cites work: An efficient code to compute non-parallel steady flows and their linear stability
cites work: Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
cites work: Q3359644
cites work: Q4358702
cites work: Q3703206
cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
cites work: Practical bifurcation and stability analysis: from equilibrium to chaos.
cites work: Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
cites work: BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
cites work: A Simultaneous Iteration Algorithm for Real Matrices
cites work: Q4358533
DOI: 10.1006/JCPH.1997.5844
Recommended article: A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
Recommended article: A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
Recommended article: Computational Science - ICCS 2004
Recommended article: A Jacobi-Davidson type method for computing real eigenvalues of the quadratic eigenvalue problem
Recommended article: Q4664331
Recommended article: Jacobi-Davidson methods for polynomial two-parameter eigenvalue problems
Recommended article: A new justification of the Jacobi-Davidson method for large eigenproblems
Recommended article: Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
Recommended article: Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method
Recommended article: Accurate Eigensystem Computations by Jacobi Methods
description: scientific article; zbMATH DE number 1138386