A continuous dynamical system is stable if all eigenvalues lie strictly in the left half of the complex plane. However, this is not a robust measure because stability is no longer guaranteed when the system parameters are slightly perturbed. Therefore, the pseudospectrum of a matrix and its pseudospectral abscissa are studied. Mostly, one is often interested in computing the distance to instability, because it is a robust measure for stability against perturbations.%As a first contribution, this paper presents two iterative methods for computing the distance to instability, considering complex perturbations. The first one is based on locating a zero of the pseudospectral abscissa function. This method is particularly suitable for large sparse matrices as it is based on repeated eigenvalue computations, where the original matrix is perturbed with a rank one matrix. The second method is based on a recently proposed global optimization technique. The advantages of both methods can be combined in a hybrid algorithm. As a second contribution we show that the methods apply to a broad class of nonlinear eigenvalue problems, in particular eigenvalue problems inferred from linear delay-differential equations, and, therefore, they are useful for a wide range of problems. In the numerical examples the standard eigenvalue problem, the quadratic eigenvalue problem and the delay eigenvalue problem are addressed.

Fast algorithms for computing the distance to instability of nonlinear eigenvalue problems, with application to time-delay systems.

Guglielmi N;
2014

Abstract

A continuous dynamical system is stable if all eigenvalues lie strictly in the left half of the complex plane. However, this is not a robust measure because stability is no longer guaranteed when the system parameters are slightly perturbed. Therefore, the pseudospectrum of a matrix and its pseudospectral abscissa are studied. Mostly, one is often interested in computing the distance to instability, because it is a robust measure for stability against perturbations.%As a first contribution, this paper presents two iterative methods for computing the distance to instability, considering complex perturbations. The first one is based on locating a zero of the pseudospectral abscissa function. This method is particularly suitable for large sparse matrices as it is based on repeated eigenvalue computations, where the original matrix is perturbed with a rank one matrix. The second method is based on a recently proposed global optimization technique. The advantages of both methods can be combined in a hybrid algorithm. As a second contribution we show that the methods apply to a broad class of nonlinear eigenvalue problems, in particular eigenvalue problems inferred from linear delay-differential equations, and, therefore, they are useful for a wide range of problems. In the numerical examples the standard eigenvalue problem, the quadratic eigenvalue problem and the delay eigenvalue problem are addressed.
pseudospectral abscissa; stability; nonlinear eigenvalue problems; distance to instability
File in questo prodotto:
File Dimensione Formato  
Postprint_2014_JDynControl_2_Verhees.pdf

accesso aperto

Tipologia: Documento in Post-print
Licenza: Accesso gratuito
Dimensione 184.89 kB
Formato Adobe PDF
184.89 kB Adobe PDF Visualizza/Apri
2014_JDynControl_2_Verhees.pdf.pdf

accesso aperto

Tipologia: Versione Editoriale (PDF)
Licenza: Accesso gratuito
Dimensione 223.42 kB
Formato Adobe PDF
223.42 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/20.500.12571/851
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? ND
social impact