A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Two important classes of quadratic eigenvalue problems are composed of elliptic and hyperbolic problems. In [Linear Algebra Appl., 351-352 (2002) 455], the distance to the nearest non-hyperbolic or non-elliptic quadratic eigenvalue problem is obtained using a global minimization problem. This paper proposes explicit formulas to compute these distances and the optimal perturbations. The problem of computing the nearest elliptic or hyperbolic quadratic eigenvalue problem is also solved. Numerical results are given to illustrate the theory.doi:10.1016/s0024-3795(03)00489-0 fatcat:mkrkfjrumvbtjj4tjdhytt27ne