skip to main content
10.1145/3613347.3613365acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicomsConference Proceedingsconference-collections
research-article

Bernstein Coefficients for Computing Rational Lyapunov and Control Functions of Dynamical Systems

Published:13 December 2023Publication History

ABSTRACT

In this paper, we address the Bernstein expansion of rational polynomial continuous dynamical systems over simplices. We consider rational Lyapunov functions and controllers both expanded into rational Bernstein form. Rational control functions are optimized by the smallest and largest rational Bernstein coefficients of maximum degree. Bounds for certifying the existence of rational functions in the monomial and Bernstein forms are given. Subsequently, the maximum degree of Bernstein basis is sufficiently optimized.

Skip Supplemental Material Section

Supplemental Material

References

  1. Mohamed Amin Ben Sassi, Sriram Sankaranarayanan, Xin Chen, and Erika Ábrahám. 2015. Linear relaxations of polynomial positivity for polynomial lyapunov function synthesis. IMA Journal of Mathematical Control and Information 33, 3 (2015), 723–756.Google ScholarGoogle ScholarCross RefCross Ref
  2. Fatima Boudaoud, Fabrizio Caruso, and Marie-Françoise Roy. 2008. Certificates of positivity in the Bernstein basis. Discrete & Computational Geometry 39, 4 (2008), 639–655.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Tareq Hamadneh, Ibraheem Abu-Falahah, and Mohammad AlQudah. 2022. Numerical optimization and positivity certificates for polynomials and rationals over simplices. J. Comput. Appl. Math. (2022), 114430.Google ScholarGoogle Scholar
  4. Tareq Hamadneh, Nikolaos Athanasopoulos, and Mohammed Ali. 2019. Minimization and Positivity of the Tensorial Rational Bernstein Form. In 2019 IEEE Jordan International Joint Conference on Electrical Engineering and Information Technology (JEEIT). IEEE, 474–479.Google ScholarGoogle Scholar
  5. Tareq Hamadneh, Nikolaos Athanasopoulos, and Rafael Wisniewski. 2020. Control design and Lyapunov Functions via Bernstein Approximations: Exact Results. IFAC-PapersOnLine 53, 2 (2020), 6459–6464.Google ScholarGoogle ScholarCross RefCross Ref
  6. Tareq Hamadneh and Rafael Wisniewski. 2018. Algorithm for Bernstein Polynomial Control Design. IFAC-PapersOnLine 51, 16 (2018), 283–289.Google ScholarGoogle ScholarCross RefCross Ref
  7. Jeffrey M Lane and Richard F Riesenfeld. 1981. Bounds on a polynomial. BIT Numerical Mathematics 21, 1 (1981), 112–117.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Richard Leroy. 2008. Certificats de positivité et minimisation polynomiale dans la base de Bernstein multivariée. Ph. D. Dissertation. Université Rennes 1.Google ScholarGoogle Scholar
  9. Richard Leroy. 2009. Certificates of positivity in the simplicial Bernstein basis. (2009). https://hal.archives-ouvertes.fr/hal-00589945 working paper or preprint.Google ScholarGoogle Scholar
  10. Richard Leroy. Springer, 2012. Convergence under subdivision and complexity of polynomial minimization in the simplicial Bernstein basis. Reliable Computing 17 (Springer, 2012), 11–21.Google ScholarGoogle Scholar
  11. Anthony Narkawicz, Jürgen Garloff, Andrew P Smith, and César A Munoz. 2012. Bounding the Range of a Rational Functiom over a Box. Reliable Computing 17(2012) (2012), 34–39.Google ScholarGoogle Scholar
  12. Paulo Tabuada. 2009. Verification and control of hybrid systems: a symbolic approach. Springer Science & Business Media.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Jihad Titi, Tareq Hamadneh, and Jürgen Garloff. 2015. Convergence of the Simplicial Rational Bernstein Form. In Modelling, Computation and Optimization in Information Systems and Management Sciences. Springer, 433–441.Google ScholarGoogle Scholar

Index Terms

  1. Bernstein Coefficients for Computing Rational Lyapunov and Control Functions of Dynamical Systems

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Other conferences
            ICoMS '23: Proceedings of the 2023 6th International Conference on Mathematics and Statistics
            July 2023
            160 pages
            ISBN:9798400700187
            DOI:10.1145/3613347

            Copyright © 2023 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 13 December 2023

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article
            • Research
            • Refereed limited
          • Article Metrics

            • Downloads (Last 12 months)10
            • Downloads (Last 6 weeks)3

            Other Metrics

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader

          HTML Format

          View this article in HTML Format .

          View HTML Format