Skip to main content
Log in

Matrix Inequalities in the Stability Theory: New Results Based on the Convolution Theorem

  • NONLINEAR SYSTEMS
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

Using Pyatnitskiy’s convolution theorem, the circle criterion of absolute stability for Lurie systems with several nonlinearities is obtained without use of the S-lemma. For connected systems with switching between three linear subsystems, a new criterion for the existence of a quadratic Lyapunov function is proposed. On the basis of the convolution theorem, two theorems are proved which lead to a substantial reduction in the dimensionality of connected systems of linear matrix inequalities. Issues of improving the circle criterion for Lurie systems with two nonlinearities are also discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Notes

  1. In [4], the term “circle criterion” was not used, and in [5], the circle criterion was formulated for both the stability problem and the instability problem.

REFERENCES

  1. Liberzon, D., Switching in Systems and Control, Boston: Birkhäuser, 2003.

    Book  MATH  Google Scholar 

  2. Fradkov, A., Early Ideas of the Absolute Stability Theory, Proc. European Control Conf., St. Petersburg, Russia, May 12–15, 2020, pp. 762–768.

  3. Polyak, B.T., Khlebnikov, M.V., and Shcherbakov, P.S., Linear Matrix Inequalities in Control Systems with Uncertainty, Autom. Remote Control., 2021, vol. 82, no. 1, pp. 1–40.

    Article  MathSciNet  MATH  Google Scholar 

  4. Yakubovich, V.A., Frequency Conditions for the Absolute Stability of Control Systems with Several Nonlinear or Linear Nonstationary Blocks, Autom. Remote Control, 1967, vol. 28, no. 6, part 1, pp. 857–880.

  5. Yakubovich, V.A., Absolute Instability of Nonlinear Control Systems. II, Autom. Remote Control, 1971, vol. 32, no. 6, part 1, pp. 876–884.

  6. Gusev, S.V. and Likhtarnikov, A.L., Kalman–Popov–Yakubovich Lemma and the S-Procedure: A Historical Essay, Autom. Remote Control, 2006, vol. 67, no. 11, pp. 1768–1810.

    Article  MathSciNet  MATH  Google Scholar 

  7. Skorodinskii, V.I., Absolute Stability and Absolute Instability of Control Systems with Two Nonlinear Nonstationary Elements. I, Autom. Remote Control, 1981, vol. 42, no. 9, part 1, pp. 1149–1157.

  8. Kamenetskii, V.A., Absolute Stability and Absolute Instability of Control Systems with Several Nonlinear Nonstationary Elements, Autom. Remote Control, 1983, vol. 44, no. 12, pp. 1543–1552.

    MathSciNet  MATH  Google Scholar 

  9. Kamenetskiy, V.A., Frequency-Domain Stability Conditions for Hybrid Systems, Autom. Remote Control, 2017, vol. 78, no. 12, pp. 2101–2119.

    Article  MathSciNet  MATH  Google Scholar 

  10. Gelig, A.Kh., Leonov, G.A., and Yakubovich, V.A., Ustoichivost’ nelineinykh sistem s needinstvennym sostoyaniem ravnovesiya (Stability of Nonlinear Systems with Non-unique Equilibrium), Moscow: Nauka, 1978.

  11. Kamenetskiy, V.A., Switched Systems, Lurie Systems, Absolute Stability, Aizerman Problem, Autom. Remote Control, 2019, vol. 80, no. 8, pp. 1375–1389.

    Article  MathSciNet  MATH  Google Scholar 

  12. Kamenetskiy, V.A., Discrete-Time Pairwise Connected Switched Systems and Lurie Systems. Tsypkin’s Criterion for Systems with Two Nonlinearities, Autom. Remote Control, 2022, vol. 83, no. 9, pp. 1371–1392.

    Article  MathSciNet  MATH  Google Scholar 

  13. Balandin, D.V. and Kogan, M.M., Sintez zakonov upravleniya na osnoe lineinykh matrichnykh neravenstv (Synthesis of Control Laws Based on Linear Matrix Inequalities), Moscow: Fizmatlit, 2007.

Download references

Funding

This work was financially supported by the Program of fundamental scientific research on priority directions determined by the Presidium of the Russian Academy of Sciences, no. 7 “New developments in prospective areas of energy, mechanics, and robotics”.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. A. Kamenetskiy.

Additional information

This paper was recommended for publication by P.V. Pakshin, a member of the Editorial Board

APPENDIX

APPENDIX

Proof of Theorem 5. Let N = 2m and let the MIs in (2.13) be numerated in such a way that the first 2m–1 inequalities Is < 0, s = \(\overline {{{{1,2}}^{{m - 1}}}} \), coincide with the inequalities in (2.13) for N = 2m–1, and the rest m– 1 inequalities Is < 0, s = \(\overline {{{2}^{{m - 1}}} + {{{1,2}}^{m}}} \), are numerated as follows:

$${{I}_{{s + {{2}^{{m - \,1}}}}}} = {{I}_{s}} + \left( {L{{b}_{m}}c_{m}^{{\text{T}}} + {{c}_{m}}b_{m}^{{\text{T}}}L} \right) < 0,\quad s = \overline {{{{1,2}}^{{m - 1}}}} .$$

Then, Pyatnitskiy’s theorem is applicable to the pairs of inequalities

$${{I}_{s}} < 0,\quad {{I}_{{s + {{2}^{{m - \,1}}}}}} < 0,\quad s = \overline {{{{1,2}}^{{m - 1}}}} .$$
(A.1)

As a result, the system of inequalities (2.13) is equivalent to the set of MIs

$${{I}_{s}} + \frac{{\varepsilon _{s}^{2}}}{2}\left( {L{{b}_{m}} + \frac{1}{{\varepsilon _{s}^{2}}}{{c}_{m}}} \right){{\left( {L{{b}_{m}} + \frac{1}{{\varepsilon _{s}^{2}}}{{c}_{m}}} \right)}^{{\text{T}}}} < 0,\quad s = \overline {{{{1,2}}^{{m - 1}}}} ,$$
(A.2)

with 2m–1 additional parameters εs > 0. Letting εs = εm > 0, s = \(\overline {{{{1,2}}^{{m - 1}}}} \), in (A.2), we arrive at yet another proof, by induction, of the transition from (2.13) to the MICC (2.16). Application of Theorem 4 to every pair of inequalities (A.1) provides the equivalence of the set of MIs (2.13) to the set of MIs (4.2) with 2m–1 extra parameters τs \(\mathop = \limits^\Delta \) 2/\(\varepsilon _{s}^{2}\). Theorem 5 is proved.

Proof of Theorem 7. We show that the fulfilment of the MICC (5.9) implies the existence of τ4 such that the MI (5.10) holds. Similarly to [12], to determine the conditions of negative definiteness of a parameter-dependent matrix Ib(ν), given the negative definiteness of the matrix Ia(ν), we use the following obvious sufficient condition: if Ia(ν) < 0 and Ib(ν) ≤ Ia(ν), then Ib(ν) < 0.

To simplify derivations, we return to the notation used in the proof of Theorem 2 and transform the MI (5.10) (see Lemma A4 [13, p. 253]) as follows:

$$\begin{gathered} {{{\tilde {\bar {\bar {I}}}}}_{1}} = \left( {\begin{array}{*{20}{c}} {{{I}_{1}}}&{u_{1}^{ + }}&{u_{3}^{ + } - u_{1}^{ + }} \\ {{{{( \bullet )}}^{{\text{T}}}}}&{ - {{\tau }_{1}}}&{{{\delta }_{1}}} \\ {{{{( \bullet )}}^{{\text{T}}}}}& \bullet &{ - {{\tau }_{4}}} \end{array}} \right) < 0 \cong {{{\hat {I}}}_{1}} = \left( {\begin{array}{*{20}{c}} {{{I}_{1}}}&{u_{3}^{ + } - u_{1}^{ + }} \\ {{{{( \bullet )}}^{{\text{T}}}}}&{ - {{\tau }_{4}}} \end{array}} \right) + \frac{1}{{{{\tau }_{1}}}}\left( \begin{gathered} u_{1}^{ + } \\ {{\delta }_{1}} \\ \end{gathered} \right){{\left( \begin{gathered} u_{1}^{ + } \\ {{\delta }_{1}} \\ \end{gathered} \right)}^{{\text{T}}}} \\ = \left( {\begin{array}{*{20}{c}} {{{I}_{1}}}&{u_{3}^{ + } - u_{1}^{ + }} \\ {{{{( \bullet )}}^{{\text{T}}}}}&{ - {{\tau }_{4}}} \end{array}} \right) + \frac{1}{{{{\tau }_{1}}}}\left( {\begin{array}{*{20}{c}} {u_{1}^{ + }{{{(u_{1}^{ + })}}^{{\text{T}}}}}&{{{\delta }_{1}}u_{1}^{ + }} \\ {{{{( \bullet )}}^{{\text{T}}}}}&{\delta _{1}^{2}} \end{array}} \right) = \left( {\begin{array}{*{20}{c}} {{{I}_{1}} + \frac{1}{{{{\tau }_{1}}}}u_{1}^{ + }{{{(u_{1}^{ + })}}^{ \top }}}&{\frac{{{{\delta }_{1}} - {{\tau }_{1}}}}{{{{\tau }_{1}}}}u_{1}^{ + } + u_{3}^{ + }} \\ {{{{( \bullet )}}^{{\text{T}}}}}&{\frac{{\delta _{1}^{2}}}{{{{\tau }_{1}}}} - {{\tau }_{4}}} \end{array}} \right) < 0, \\ \end{gathered} $$

where, for brevity, the notation δ1 \(\mathop = \limits^\Delta \)1 – τ3 + τ4)/2 is introduced and the arguments of the vectors \(u_{j}^{ \pm }\) = \(u_{j}^{ \pm }\)j) are omitted. Adopting yet another simplifying notations α1 \(\mathop = \limits^\Delta \)1 – τ1)/τ1 and β1 \(\mathop = \limits^\Delta \) τ1/(τ1τ4\(\delta _{1}^{2}\)), we arrive at

$${{\hat {I}}_{1}} < 0 \cong {{\hat {\hat {I}}}_{1}} = {{I}_{1}} + \frac{1}{{{{\tau }_{1}}}}u_{1}^{ + }{{(u_{1}^{ + })}^{{^{{\text{T}}}}}} + {{\beta }_{1}}\left( {{{\alpha }_{1}}u_{1}^{ + } + u_{3}^{ + }} \right){{\left( {{{\alpha }_{1}}u_{1}^{ + } + u_{3}^{ + }} \right)}^{{^{{\text{T}}}}}} < 0$$
(A.3)

via use of the Schur complement.

For τ1 = 2/\(\varepsilon _{{1{\text{cir}}}}^{2}\) and τ3 = 2/\(\varepsilon _{{2{\text{cir}}}}^{2}\), the difference between the quadratic forms associated with the matrices Icir in (5.9) and \({{\hat {\hat {I}}}_{1}}\) in (A.3) is the difference of squares

$${{\hat {\hat {I}}}_{1}} - {{I}_{{{\text{cir}}}}}\mathop {\,\, = }\limits^\Delta \,\,{{\Delta }_{1}} = {{\beta }_{1}}\left( {{{\alpha }_{1}}u_{1}^{ + } + u_{3}^{ + }} \right){{\left( {{{\alpha }_{1}}u_{1}^{ + } + u_{3}^{ + }} \right)}^{{\text{T}}}} - \frac{1}{{{{\tau }_{3}}}}u_{3}^{ + }{{(u_{3}^{ + })}^{{\text{T}}}}.$$

Inequality Δ1 ≤ 0 for the difference of squares is valid if the corresponding (squared) linear forms are proportional; i.e., α1\(u_{1}^{ + }\) + \(u_{3}^{ + }\) = λ1\(u_{3}^{ + }\), which is only possible if α1 = 0 or τ4 = τ1 + τ3. In that case, Δ1 = 0.

We next determine the values of τ5 which guarantee the feasibility of (5.11) provided that the MICC (5.9) is feasible. To this end, we perform the manipulations with the MI (5.11) similar to those performed above with the MI (5.10). As a result, we obtain

$${{\tilde {\bar {\bar {I}}}}_{2}} < 0 \cong {{\hat {\hat {I}}}_{2}} = {{I}_{3}} + \frac{1}{{{{\tau }_{2}}}}u_{2}^{ + }{{(u_{2}^{ + })}^{{\text{T}}}} + {{\beta }_{2}}\left( {{{\alpha }_{2}}u_{2}^{ + } + u_{3}^{ - }} \right){{\left( {{{\alpha }_{2}}u_{2}^{ + } + u_{3}^{ - }} \right)}^{{\text{T}}}} < 0,$$
(A.4)

where δ2 \(\mathop = \limits^\Delta \)2 – τ3 + τ5)/2, α2 \(\mathop = \limits^\Delta \)2 – τ2)/τ2, and β2 \(\mathop = \limits^\Delta \) τ2/(τ2τ5\(\delta _{2}^{2}\)). With account for \(u_{2}^{ + }\)(τ) = \(u_{1}^{ + }\)(τ) and using the relation I1 + \(\frac{1}{{{{\tau }_{3}}}}u_{3}^{ + }{{(u_{3}^{ + })}^{{\text{T}}}}\)3) = I3 + \(\frac{1}{{{{\tau }_{3}}}}u_{3}^{ - }{{(u_{3}^{ - })}^{{\text{T}}}}\)3), we arrive at the conclusion that, for τ2 = 2/\(\varepsilon _{{1{\text{cir}}}}^{2}\) and τ3 = 2/\(\varepsilon _{{2{\text{cir}}}}^{2}\), the difference between the quadratic forms associated with the matrices Icir in (5.9) and \({{\hat {\hat {I}}}_{2}}\) in (A.4) is nothing but the difference of squares

$${{\hat {\hat {I}}}_{2}} - {{I}_{{{\text{cir}}}}}\mathop = \limits^\Delta {{\Delta }_{2}} = {{\beta }_{2}}\left( {{{\alpha }_{2}}u_{2}^{ + } + u_{3}^{ - }} \right){{\left( {{{\alpha }_{2}}u_{2}^{ + } + u_{3}^{ - }} \right)}^{{\text{T}}}} - \frac{1}{{{{\tau }_{3}}}}u_{3}^{ - }{{(u_{3}^{ - })}^{{\text{T}}}}.$$

The inequality Δ2 ≤ 0 for the difference of squares is valid if the corresponding linear forms are proportional; i.e.,

$${{\alpha }_{2}}u_{2}^{ + } + u_{3}^{ - } = {{\lambda }_{2}}u_{3}^{ - };$$

this takes place only if α2 = 0 or τ5 = τ2 + τ3. In that case Δ2 = 0. Theorem 7 is proved.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kamenetskiy, V.A. Matrix Inequalities in the Stability Theory: New Results Based on the Convolution Theorem. Autom Remote Control 84, 240–252 (2023). https://doi.org/10.1134/S0005117923030074

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117923030074

Keywords:

Navigation