Skip to main content

Optimal Monomial Quadratization for ODE Systems

  • Conference paper
  • First Online:
Combinatorial Algorithms (IWOCA 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12757))

Included in the following conference series:

Abstract

Quadratization is a transform of a system of ODEs with polynomial right-hand side into a system of ODEs with at most quadratic right-hand side via the introduction of new variables. Quadratization problem is, given a system of ODEs with polynomial right-hand side, transform the system to a system with quadratic right-hand side by introducing new variables. Such transformations have been used, for example, as a preprocessing step by model order reduction methods and for transforming chemical reaction networks.

We present an algorithm that, given a system of polynomial ODEs, finds a transformation into a quadratic ODE system by introducing new variables which are monomials in the original variables. The algorithm is guaranteed to produce an optimal transformation of this form (that is, the number of new variables is as small as possible), and it is the first algorithm with such a guarantee we are aware of. Its performance compares favorably with the existing software, and it is capable to tackle problems that were out of reach before.

The article was prepared within the framework of the HSE University Basic Research Program. GP was partially supported by NSF grants DMS-1853482, DMS-1760448, DMS-1853650, CCF-1564132, and CCF-1563942 and by the Paris Ile-de-France region. The authors are grateful to Mathieu Hemery, François Fages, and Sylvain Soliman for helpful discussions. The work has started when G. Pogudin worked at the Higher School of Economics, Moscow. The authors would like to thank the referees for their comments, which helped us improve the manuscript.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Abreu, M., Balbuena, C., Labbate, D.: Adjacency matrices of polarity graphs and of other C4-free graphs of large size. Des. Codes Crypt. 55(2–3), 221–233 (2010). https://doi.org/10.1007/s10623-010-9364-1

    Article  MATH  Google Scholar 

  2. Alauddin, F.: Quadratization of ODEs: monomial vs. non-monomial. SIAM Undergraduate Res. Online 14 (2021). https://doi.org/10.1137/20s1360578

  3. Bulteau, L., Fertin, G., Rizzi, R., Vialette, S.: Some algorithmic results for [2]-sumset covers. Inf. Process. Lett. 115(1), 1–5 (2015). https://doi.org/10.1016/j.ipl.2014.07.008

    Article  MathSciNet  MATH  Google Scholar 

  4. Carothers, D.C., Parker, G.E., Sochacki, J.S., Warne, P.G.: Some properties of solutions to polynomial systems of differential equations. Electron. J. Diff. Eqns. 2005(40), 1–17 (2005). http://emis.impa.br/EMIS/journals/EJDE/Volumes/2005/40/carothers.pdf

  5. Clapham, C.R.J., Flockhart, A., Sheehan, J.: Graphs without four-cycles. J. Graph Theor. 13(1), 29–47 (1989). https://doi.org/10.1002/jgt.3190130107

    Article  MathSciNet  MATH  Google Scholar 

  6. Cochelin, B., Vergez, C.: A high order purely frequency-based harmonic balance formulation for continuation of periodic solutions. J. Sound Vib. 324(1–2), 243–262 (2009). https://doi.org/10.1016/j.jsv.2009.01.054

    Article  Google Scholar 

  7. Erdös, P., Rényi, A., Sós, V.: On a problem of graph theory. Studia Sci. Math. Hungar. 1, 215–235 (1966)

    MathSciNet  MATH  Google Scholar 

  8. Fagnot, I., Fertin, G., Vialette, S.: On finding small 2-generating sets. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol. 5609, pp. 378–387. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02882-3_38

    Chapter  Google Scholar 

  9. Füredi, Z.: On the number of edges of quadrilateral-free graphs. J. Comb. Theor. Ser. B 68(1), 1–6 (1996). https://doi.org/10.1006/jctb.1996.0052

    Article  MathSciNet  MATH  Google Scholar 

  10. Graham, R., Grotschel, M., Lovász, L.: Handbook of Combinatorics, vol. 2. North Holland (1995)

    Google Scholar 

  11. Gu, C.: QLMOR: a projection-based nonlinear model order reduction approach using quadratic-linear representation of nonlinear systems. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 30(9), 1307–1320 (2011). https://doi.org/10.1109/TCAD.2011.2142184

    Article  Google Scholar 

  12. Guillot, L., Cochelin, B., Vergez, C.: A Taylor series-based continuation method for solutions of dynamical systems. Nonlinear Dyn. 98(4), 2827–2845 (2019). https://doi.org/10.1007/s11071-019-04989-5

    Article  MATH  Google Scholar 

  13. Hemery, M., Fages, F., Soliman, S.: On the complexity of quadratization for polynomial differential equations. In: Abate, A., Petrov, T., Wolf, V. (eds.) CMSB 2020. LNCS, vol. 12314, pp. 120–140. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-60327-4_7

    Chapter  Google Scholar 

  14. Karkar, S., Cochelin, B., Vergez, C.: A high-order, purely frequency based harmonic balance formulation for continuation of periodic solutions: the case of non-polynomial nonlinearities. J. Sound Vib. 332(4), 968–977 (2013). https://doi.org/10.1016/j.jsv.2012.09.033

    Article  Google Scholar 

  15. Kramer, B., Willcox, K.E.: Balanced truncation model reduction for lifted nonlinear systems (2019). https://arxiv.org/abs/1907.12084

  16. Kramer, B., Willcox, K.E.: Nonlinear model order reduction via lifting transformations and proper orthogonal decomposition. AIAA J. 57(6), 2297–2307 (2019). https://doi.org/10.2514/1.J057791

    Article  Google Scholar 

  17. Morrison, D.R., Jacobson, S.H., Sauppe, J.J., Sewell, E.C.: Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning. Discret. Optim. 19, 79–102 (2016). https://doi.org/10.1016/j.disopt.2016.01.005

    Article  MathSciNet  MATH  Google Scholar 

  18. OEIS Foundation Inc.: The on-line encyclopedia of integer sequences. http://oeis.org

  19. Rabinovich, M.I., Fabrikant, A.L.: Stochastic self-modulation of waves in nonequilibrium media. J. Exp. Theor. Phys. 77, 617–629 (1979)

    Google Scholar 

  20. Ritschel, T.K., Weiß, F., Baumann, M., Grundel, S.: Nonlinear model reduction of dynamical power grid models using quadratization and balanced truncation. at-Automatisierungstechnik 68(12), 1022–1034 (2020). https://doi.org/10.1515/auto-2020-0070

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gleb Pogudin .

Editor information

Editors and Affiliations

Appendix: Benchmark Systems

Appendix: Benchmark Systems

Most of the benchmark systems used in this paper (in Tables 2 and 3) are described in [13]. Here we show additional benchmarks we have introduced:

  1. 1.

    Cubic Cycle(n). For every integer \(n > 1\), we define a system in variables \(x_1, \ldots , x_n\) by

    $$ x_1' = x_2^3,\; x_2' = x_3^3,\;\ldots ,\; x_n' = x_1^3. $$
  2. 2.

    Cubic Bicycle(n). For every integer \(n > 1\), we define a system in variables \(x_1, \ldots , x_n\) by

    $$ x_1' = x_n^3 + x_2^3,\; x_2' = x_1^3 + x_3^3,\;\ldots ,\; x_n' = x_{n - 1}^3 + x_1^3. $$

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bychkov, A., Pogudin, G. (2021). Optimal Monomial Quadratization for ODE Systems. In: Flocchini, P., Moura, L. (eds) Combinatorial Algorithms. IWOCA 2021. Lecture Notes in Computer Science(), vol 12757. Springer, Cham. https://doi.org/10.1007/978-3-030-79987-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-79987-8_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-79986-1

  • Online ISBN: 978-3-030-79987-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics