All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Robust Root-Clustering of a Matrix in Intersections or Unions of Regions

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F04%3A00101427" target="_blank" >RIV/68407700:21230/04:00101427 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1137/S0363012903432365" target="_blank" >http://dx.doi.org/10.1137/S0363012903432365</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1137/S0363012903432365" target="_blank" >10.1137/S0363012903432365</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Robust Root-Clustering of a Matrix in Intersections or Unions of Regions

  • Original language description

    This paper considers robust stability analysis for a matrix affected by unstructured complex uncertainty. A method is proposed to compute a bound on the amount of uncertainty ensuring robust root-clustering in a combination (intersection and/or union) ofseveral possibly nonsymmetric half planes, discs, and outsides of discs. In some cases to be detailed, this bound is not conservative. The conditions are expressed in terms of linear matrix inequalities (LMIs) and derived through Lyapunov's second method. As a distinctive feature of the approach, the Lyapunov matrices proving robust root-clustering (one per subregion) are not necessarily positive definite but have prescribed inertias depending on the number of roots in the corresponding subregions.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BC - Theory and management systems

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/ME%20698" target="_blank" >ME 698: Computer analysis and suggestion of discreet gigital filters in telecomunication by means of modern polynominal methods.</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2004

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    SIAM Journal on Control and Optimization

  • ISSN

    0363-0129

  • e-ISSN

  • Volume of the periodical

    43

  • Issue of the periodical within the volume

    3

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    16

  • Pages from-to

    1078-1093

  • UT code for WoS article

    000225642700016

  • EID of the result in the Scopus database