Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems

被引:57
|
作者
Higham, NJ [1 ]
Tisseur, F
Van Dooren, PM
机构
[1] Univ Manchester, Dept Math, Manchester M13 9PL, Lancs, England
[2] Catholic Univ Louvain, CESAME, Ctr Syst Engn & Appl Mech, B-1348 Louvain, Belgium
基金
美国国家科学基金会; 英国工程与自然科学研究理事会;
关键词
Hermitian generalized eigenvalue problem; definite pair; Crawford number; Hermitian quadratic eigenvalue problem; hyperbolic system; elliptic system; overdamped system; gyroscopic system; bisection algorithm; level set algorithm; nearness problems;
D O I
10.1016/S0024-3795(02)00281-1
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
An important class of generalized eigenvalue problems Ax = lambdaBx is those in which A and B are Hermitian and some real linear combination of them is definite. For the quadratic eigenvalue problem (QEP) (lambda(2)A +lambdaB + C)x = 0 with Hermitian A, B and C and positive definite A, particular interest focuses on problems in which (x*Bx)(2) - 4(x*Ax)(x*Cx) is one-signed for all non-zero x-for the positive sign these problems are called hyperbolic and for the negative sign elliptic. The important class of overdamped problems arising in mechanics is a sub-class of the hyperbolic problems. For each of these classes of generalized and quadratic eigenvalue problems we show how to check that a putative member has the required properties and we derive the distance to the nearest problem outside the class. For definite pairs (A, B) the distance is the Crawford number, and we derive bisection and level set algorithms both for testing its positivity and for computing it. Testing hyperbolicity of a QEP is shown to reduce to testing a related pair for definiteness. The distance to the nearest non-hyperbolic or non-elliptic n x n QEP is shown to be the solution of a global minimization problem with n - 1 dearees of freedom. Numerical results are given to illustrate the theory and algorithms. (C) 2002 Published by Elsevier Science Inc.
引用
收藏
页码:455 / 474
页数:20
相关论文
共 36 条