Ir al contenido

Documat


An iterative method for computing robustness of polynomial stability

  • Nicola Guglielmi [2] ; Manuela Manetta [1]
    1. [1] Georgia Institute of Technology

      Georgia Institute of Technology

      Estados Unidos

    2. [2] Università dell’Aquila, Italy
  • Localización: Journal of computational and applied mathematics, ISSN 0377-0427, Vol. 292, Nº 1 (15 January 2016), 2016, págs. 638-653
  • Idioma: inglés
  • DOI: 10.1016/j.cam.2015.06.012
  • Enlaces
  • Resumen
    • We propose a method for computing the distance of a stable polynomial to the set of unstable ones (both in the Hurwitz and in the Schur case). The method is based on the reformulation of the problem as the structured distance to instability of a companion matrix associated to a polynomial. We first introduce the structured εε-pseudospectrum of a companion matrix and write a system of ordinary differential equations which maximize the real part (or the absolute value) of elements of the structured εε-pseudospectrum and then exploit the knowledge of the derivative of the maximizers with respect to εε to devise a quadratically convergent iteration. Furthermore we use a variant of the same ODEs to compute the boundary of structured pseudospectra and compare them to unstructured ones. An extension to constrained perturbations is also considered.


Fundación Dialnet

Mi Documat

Opciones de artículo

Opciones de compartir

Opciones de entorno