<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0 plus SVG 1.1//EN" "http://www.w3.org/2002/04/xhtml-math-svg/xhtml-math-svg.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
  <head>
    <meta http-equiv="Content-Type" content="application/xhtml+xml; charset=utf-8"/>
    <title>Project-Team:DISCO</title>
    <link rel="stylesheet" href="../static/css/raweb.css" type="text/css"/>
    <meta name="description" content="New Results - Tracking the Algebraic Multiplicity of&#10;Crossing Imaginary Roots for Generic Quasipolynomials: A&#10;Vandermonde-Based Approach"/>
    <meta name="dc.title" content="New Results - Tracking the Algebraic Multiplicity of&#10;Crossing Imaginary Roots for Generic Quasipolynomials: A&#10;Vandermonde-Based Approach"/>
    <meta name="dc.creator" content="Islam Boussaada"/>
    <meta name="dc.creator" content="Silviu-Iulian Niculescu"/>
    <meta name="dc.subject" content=""/>
    <meta name="dc.publisher" content="INRIA"/>
    <meta name="dc.date" content="(SCHEME=ISO8601) 2016-01"/>
    <meta name="dc.type" content="Report"/>
    <meta name="dc.language" content="(SCHEME=ISO639-1) en"/>
    <meta name="projet" content="DISCO"/>
    <script type="text/javascript" src="https://raweb.inria.fr/rapportsactivite/RA2016/static/MathJax/MathJax.js?config=TeX-MML-AM_CHTML">
      <!--MathJax-->
    </script>
  </head>
  <body>
    <div class="tdmdiv">
      <div class="logo">
        <a href="http://www.inria.fr">
          <img style="align:bottom; border:none" src="../static/img/icons/logo_INRIA-coul.jpg" alt="Inria"/>
        </a>
      </div>
      <div class="TdmEntry">
        <div class="tdmentete">
          <a href="uid0.html">Project-Team Disco</a>
        </div>
        <span>
          <a href="uid1.html">Members</a>
        </span>
      </div>
      <div class="TdmEntry">Overall Objectives<ul><li><a href="./uid3.html">Objectives</a></li></ul></div>
      <div class="TdmEntry">Research Program<ul><li><a href="uid5.html&#10;&#9;&#9;  ">Modeling of complex environment</a></li><li><a href="uid6.html&#10;&#9;&#9;  ">Analysis of interconnected systems</a></li><li><a href="uid9.html&#10;&#9;&#9;  ">Stabilization of interconnected systems</a></li><li><a href="uid13.html&#10;&#9;&#9;  ">Synthesis of reduced complexity controllers</a></li></ul></div>
      <div class="TdmEntry">Application Domains<ul><li><a href="uid17.html&#10;&#9;&#9;  ">Analysis and Control of life sciences systems </a></li><li><a href="uid18.html&#10;&#9;&#9;  ">Energy Management</a></li></ul></div>
      <div class="TdmEntry">New Results<ul><li><a href="uid20.html&#10;&#9;&#9;  ">Characterizing the Codimension of Zero Singularities for Time-Delay Systems: A Link with Vandermonde and Birkhoff Incidence Matrices</a></li><li class="tdmActPage"><a href="uid21.html&#10;&#9;&#9;  ">Tracking the Algebraic Multiplicity of
Crossing Imaginary Roots for Generic Quasipolynomials: A
Vandermonde-Based Approach</a></li><li><a href="uid22.html&#10;&#9;&#9;  ">Coprimeness of fractional representations</a></li><li><a href="uid23.html&#10;&#9;&#9;  ">Output-feddback control design for
time-delay systems</a></li><li><a href="uid24.html&#10;&#9;&#9;  ">Backstepping control design through
the introduction of delays</a></li><li><a href="uid25.html&#10;&#9;&#9;  ">Switched Nonlinear Systems</a></li><li><a href="uid26.html&#10;&#9;&#9;  ">Studies of systems with long delays</a></li><li><a href="uid27.html&#10;&#9;&#9;  ">Extension of the Razumikhin's theorem</a></li><li><a href="uid28.html&#10;&#9;&#9;  ">Observer design for nonlinear systems</a></li><li><a href="uid29.html&#10;&#9;&#9;  ">Set invariance for discrete-time delay systems</a></li><li><a href="uid30.html&#10;&#9;&#9;  ">Interpolation-based design for constrained dynamical systems</a></li><li><a href="uid31.html&#10;&#9;&#9;  ">Inverse optimality results for constrained control</a></li><li><a href="uid32.html&#10;&#9;&#9;  ">Robustness and fragility of Piecewise affine control laws</a></li><li><a href="uid33.html&#10;&#9;&#9;  ">Distributed robust model predictive control</a></li><li><a href="uid34.html&#10;&#9;&#9;  ">Algebraic Analysis Approach to Linear Functional Systems</a></li><li><a href="uid35.html&#10;&#9;&#9;  ">Attitude dynamics, control and observation</a></li><li><a href="uid36.html&#10;&#9;&#9;  ">Estimation for vehicle application</a></li><li><a href="uid37.html&#10;&#9;&#9;  ">Observer-based stabilization for lateral vehicle control</a></li><li><a href="uid38.html&#10;&#9;&#9;  "> Unified model for low-cost high-performance AC drives: the equivalent flux concept</a></li><li><a href="uid39.html&#10;&#9;&#9;  "> Supervision and rescheduling of a mixed CBTC traffic on a suburban railway line</a></li><li><a href="uid40.html&#10;&#9;&#9;  ">Combined Feedback Linearization and MPC for Wind Turbine Power Tracking</a></li><li><a href="uid41.html&#10;&#9;&#9;  ">Hierarchical Control of a Wind Farm for Wake Interaction Minimization</a></li><li><a href="uid42.html&#10;&#9;&#9;  ">Control of a model of chemostat with delay</a></li><li><a href="uid43.html&#10;&#9;&#9;  ">Mathematical Modelling of Acute
Myeloid Leukemia</a></li><li><a href="uid44.html&#10;&#9;&#9;  ">Ananlysis of Dengue Fever SIR Model with time-varying parameters</a></li></ul></div>
      <div class="TdmEntry">Bilateral Contracts and Grants with Industry<ul><li><a href="uid46.html&#10;&#9;&#9;  ">Bilateral Contracts with Industry</a></li></ul></div>
      <div class="TdmEntry">Partnerships and Cooperations<ul><li><a href="uid48.html&#10;&#9;&#9;  ">Regional Initiatives</a></li><li><a href="uid50.html&#10;&#9;&#9;  ">National Initiatives</a></li><li><a href="uid52.html&#10;&#9;&#9;  ">European Initiatives</a></li><li><a href="uid85.html&#10;&#9;&#9;  ">International Initiatives</a></li><li><a href="uid99.html&#10;&#9;&#9;  ">International Research Visitors</a></li></ul></div>
      <div class="TdmEntry">Dissemination<ul><li><a href="uid104.html&#10;&#9;&#9;  ">Promoting Scientific Activities</a></li><li><a href="uid117.html&#10;&#9;&#9;  ">Teaching - Supervision - Juries</a></li></ul></div>
      <div class="TdmEntry">
        <div>Bibliography</div>
      </div>
      <div class="TdmEntry">
        <ul>
          <li>
            <a id="tdmbibentmajor" href="bibliography.html">Major publications</a>
          </li>
          <li>
            <a id="tdmbibentyear" href="bibliography.html#year">Publications of the year</a>
          </li>
          <li>
            <a id="tdmbibentfoot" href="bibliography.html#References">References in notes</a>
          </li>
        </ul>
      </div>
    </div>
    <div id="main">
      <div class="mainentete">
        <div id="head_agauche">
          <small><a href="http://www.inria.fr">
	    
	    Inria
	  </a> | <a href="../index.html">
	    
	    Raweb 
	    2016</a> | <a href="http://www.inria.fr/en/teams/disco">Presentation of the Project-Team DISCO</a> | <a href="http://team.inria.fr/disco/">DISCO Web Site
	  </a></small>
        </div>
        <div id="head_adroite">
          <table class="qrcode">
            <tr>
              <td>
                <a href="disco.xml">
                  <img style="align:bottom; border:none" alt="XML" src="../static/img/icons/xml_motif.png"/>
                </a>
              </td>
              <td>
                <a href="disco.pdf">
                  <img style="align:bottom; border:none" alt="PDF" src="IMG/qrcode-disco-pdf.png"/>
                </a>
              </td>
              <td>
                <a href="../disco/disco.epub">
                  <img style="align:bottom; border:none" alt="e-pub" src="IMG/qrcode-disco-epub.png"/>
                </a>
              </td>
            </tr>
            <tr>
              <td/>
              <td>PDF
</td>
              <td>e-Pub
</td>
            </tr>
          </table>
        </div>
      </div>
      <!--FIN du corps du module-->
      <br/>
      <div class="bottomNavigation">
        <div class="tail_aucentre">
          <a href="./uid20.html" accesskey="P"><img style="align:bottom; border:none" alt="previous" src="../static/img/icons/previous_motif.jpg"/> Previous | </a>
          <a href="./uid0.html" accesskey="U"><img style="align:bottom; border:none" alt="up" src="../static/img/icons/up_motif.jpg"/>  Home</a>
          <a href="./uid22.html" accesskey="N"> | Next <img style="align:bottom; border:none" alt="next" src="../static/img/icons/next_motif.jpg"/></a>
        </div>
        <br/>
      </div>
      <div id="textepage">
        <!--DEBUT2 du corps du module-->
        <h2>Section: 
      New Results</h2>
        <h3 class="titre3">Tracking the Algebraic Multiplicity of
Crossing Imaginary Roots for Generic Quasipolynomials: A
Vandermonde-Based Approach</h3>
        <p class="participants"><span class="part">Participants</span> :
	Islam Boussaada, Silviu-Iulian Niculescu.</p>
        <p>A standard approach in analyzing dynamical systems consists in
identifying and understanding the eigenvalues bifurcations when
crossing the imaginary axis. Efficient methods for crossing imaginary
roots identification exist. However, to the best of the author's
knowledge, the multiplicity of such roots was not deeply
investigated. We have emphasized <a href="./bibliography.html#disco-2016-bid11">[12]</a> that the multiplicity of the zero spectral value can exceed
the number of the coupled scalar delay-differential equations and a
constructive approach Vandermonde-based allowing to an adaptive bound
for such a multiplicity is provided. Namely, it is shown that the zero
spectral value multiplicity depends on the system structure (number of
delays and number of non zero coefficients of the associated
quasipolynomial) rather than the degree of the associated
quasipolynomial. We have extended the constructive
approach in investigating the multiplicity of crossing imaginary roots
<span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mi>j</mi><mi>ω</mi></mrow></math></span> where <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mi>ω</mi><mo>≠</mo><mn>0</mn></mrow></math></span> and establishes a link with a new class of
functional confluent Vandermonde matrices. A symbolic algorithm for
computing the LU-factorization for such matrices is provided. As a
byproduct of the proposed approach, a bound sharper than the
Polya-Szegö generic bound arising from the principle argument is
established.
</p>
      </div>
      <!--FIN du corps du module-->
      <br/>
      <div class="bottomNavigation">
        <div class="tail_aucentre">
          <a href="./uid20.html" accesskey="P"><img style="align:bottom; border:none" alt="previous" src="../static/img/icons/previous_motif.jpg"/> Previous | </a>
          <a href="./uid0.html" accesskey="U"><img style="align:bottom; border:none" alt="up" src="../static/img/icons/up_motif.jpg"/>  Home</a>
          <a href="./uid22.html" accesskey="N"> | Next <img style="align:bottom; border:none" alt="next" src="../static/img/icons/next_motif.jpg"/></a>
        </div>
        <br/>
      </div>
    </div>
  </body>
</html>
