The problem of robust Schur stability of a polynomial matrix family is considered as that of discovering the structure of the stability domain in parameter space. The algorithms are proposed for establishing whether or not any given box in the parameter space belongs to this domain, and for finding the distance to instability from any internal point of the domain to its boundary. The treatment is performed in the ideology of analytical algorithm for elimination of variables and localization of zeros of algebraic systems. Some examples are given.

Original languageEnglish
Title of host publicationComputer Algebra in Scientific Computing - 21st International Workshop, CASC 2019, Proceedings
EditorsMatthew England, Timur M. Sadykov, Werner M. Seiler, Wolfram Koepf, Evgenii V. Vorozhtsov
PublisherSpringer Nature
Pages262-279
Number of pages18
ISBN (Print)9783030268305
DOIs
StatePublished - 1 Aug 2019
Event21st International Workshop on Computer Algebra in Scientific Computing, CASC 2019 - Moscow, Russian Federation
Duration: 26 Aug 201930 Aug 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11661 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference21st International Workshop on Computer Algebra in Scientific Computing, CASC 2019
Country/TerritoryRussian Federation
CityMoscow
Period26/08/1930/08/19

    Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

    Research areas

  • Discriminant, Matrix polynomials, Parameters, Robust schur stability

ID: 47471735