Loading [a11y]/accessibility-menu.js
Computing the distance to instability for large-scale nonlinear eigenvalue problems | IEEE Conference Publication | IEEE Xplore
Scheduled Maintenance: On Tuesday, 25 February, IEEE Xplore will undergo scheduled maintenance from 1:00-5:00 PM ET (1800-2200 UTC). During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

Computing the distance to instability for large-scale nonlinear eigenvalue problems


Abstract:

A quadratically converging algorithm for the computation of the distance to instability of a broad class of nonlinear eigenvalue problems is presented, including the poly...Show More

Abstract:

A quadratically converging algorithm for the computation of the distance to instability of a broad class of nonlinear eigenvalue problems is presented, including the polynomial eigenvalue problem and the delay eigenvalue problem. The algorithm is grounded in a recently presented approach for computing the pseudospectral abscissa. The application of the algorithm only relies on the availability of a method to compute the rightmost eigenvalue of perturbed problems obtained by adding rank one perturbations to the coefficient matrices, for which, in case of large and sparse matrices, efficient iterative algorithms can be used.
Date of Conference: 17-19 July 2013
Date Added to IEEE Xplore: 02 December 2013
Electronic ISBN:978-3-033-03962-9
Conference Location: Zurich, Switzerland

References

References is not available for this document.