Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems (Q1611915): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: mctoolbox / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: testmatrix / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Overdamped and Gyroscopic Vibrating Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nearest definite pair for the Hermitian generalized eigenvalue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a positive definite linear combination of two Hermitian matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3230107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rayleigh-Ritz method for dissipative or gyroscopic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4110164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5523899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric matrix pencils / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4895203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation bounds for the definite generalized eigenvalue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backward error and condition of polynomial eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quadratic Eigenvalue Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Jacobi eigenreduction algorithm for definite matrix pairs / rank
 
Normal rank

Latest revision as of 16:14, 4 June 2024

scientific article
Language Label Description Also known as
English
Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems
scientific article

    Statements

    Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems (English)
    0 references
    0 references
    0 references
    0 references
    28 August 2002
    0 references
    The paper concerns definite generalized eigenvalue problems and hyperbolic quadratic eigenvalue problems (QEPs) having the property that all eigenvalues are real. It also concerns elliptic QEPs which have eigenvalues that are all non-real. There are two aims: to determine for a given generalized eigenvalue problem or QEP, whether the property of interest holds, and, if it does, to compute the distance to the nearest problem without that property. The second section, showing that the distance from a definite generalized eigenvalue problem to the nearest non-definite one is given by the Crawford number \[ \gamma(A,B)= \min_{\substack{ z\in \mathbb{C}^n\\ \|z\|_2=1}} \sqrt{(z^*Az)^2+ (z^*Bz)^2}, \] \(A,B\in \mathbb{C}^{n\times n}\) two Hermitian matrices, contains two methods for the computation of that number and for testing the definiteness. The first one, based on the bisection algorithm, detects definiteness and produces a bracket for \(\gamma(A,B)\), that shrinks to zero. The second one, more efficient and rapidly convergent is obtained by applying the level set algorithm derived for stability radii computations. The procedure enables us to test for definiteness and produces only a monotonically lower bound. The third section contains definitions and characterizations of hyperbolic (including the subclass of overdamped QEPs) and elliptic QEPs. It shows that testing for hyperbolicity can be reduced to testing for definiteness of an associated generalized eigenvalue problem, which can be done using one of the algorithms presented above. It is proved that the distance from a hyperbolic (elliptic) problem to the nearest non-hyperbolic (non-elliptic) one, given by \[ \begin{multlined} d(A,B,C)= \min\{f(\Delta A,\Delta B,\Delta C): \text{det}(W(x, A+\Delta A, B+\Delta B,C+\Delta C))= 0,\\ \text{for some }x\neq 0\},\end{multlined} \] where \(f\) is some nonnegative function of the perturbation matrices \(\Delta A\), \(\Delta B\), \(\Delta C\), can be expressed in terms of a global minimization problem over the unit ball. Finally, to illustrate the results, the paper presents three numerical examples each with a different type of QEPs: a damped mass-spring system which is real and overdamped, a moving wirsaw which is complex and hyperbolic but not overdamped and a wave equation which is real and elliptic.
    0 references
    0 references
    definite Hermitian pair
    0 references
    definite generalized eigenvalue problems
    0 references
    hyperbolic quadratic eigenvalue problems
    0 references
    Crawford number
    0 references
    bisection algorithm
    0 references
    level set algorithm
    0 references
    0 references
    0 references
    0 references
    0 references