Paper detail

On properties and numerical computation of critical points of eigencurves of bivariate matrix pencils

We investigate critical points of eigencurves of bivariate matrix pencils $A+λB +μC$. Points $(λ,μ)$ for which $\det(A+λB+μC)=0$ form algebraic curves in $\mathbb C^2$ and we focus on points where $μ'(λ)=0$. Such points are referred to as zero-group-velocity (ZGV) points, following terminology from engineering applications. We provide a general theory for the ZGV points and show that they form a subset (with equality in the generic case) of the 2D points $(λ_0,μ_0)$, where $λ_0$ is a multiple eigenvalue of the pencil $(A+μ_0 C)+λB$, or, equivalently, there exist nonzero $x$ and $y$ such that $(A+λ_0 B+μ_0 C)x=0$, $y^H(A+λ_0 B+μ_0 C)=0$, and $y^HBx=0$. We introduce three numerical methods for computing 2D and ZGV points. The first method calculates all 2D (ZGV) points from the eigenvalues of a related singular two-parameter eigenvalue problem. The second method employs a projected regular two-parameter eigenvalue problem to compute either all eigenvalues or only a subset of eigenvalues close to a given target. The third approach is a locally convergent Gauss--Newton-type method that computes a single 2D point from an inital approximation, the later can be provided for all 2D points via the method of fixed relative distance by Jarlebring, Kvaal, and Michiels. In our numerical examples we use these methods to compute 2D-eigenvalues, solve double eigenvalue problems, determine ZGV points of a parameter-dependent quadratic eigenvalue problem, evaluate the distance to instability of a stable matrix, and find critical points of eigencurves of a two-parameter Sturm-Liouville problem.