Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
