An Efficient Symbolic Algorithm for Computing Lyapunov Constants in Planar Switching Systems

Abstract

Lyapunov constants are a crucial tool for analyzing bifurcation behavior in switching systems. This paper proposes an efficient algebraic symbolic algorithm for computing Lyapunov constants in planar switching systems. By mapping the vector fields into the complex domain, we construct a normal form algorithm based on Laurent poly?nomials. The classical Poincaré map method requires repeated symbolic integration, which may lead to substantial computational difficulties at high orders. Our ap?proach improves computational efficiency by replacing continuous integration with direct algebraic operations. We apply this approach to investigate two switching models. For a generalized switching quartic Liénard system, the algebraic method extracts the center conditions and proves the existence of 10 small-amplitude limit cycles, establishing a new lower bound for its cyclicity. Furthermore, a physically motivated circuit-level modification of the Alpazur oscillator is investigated. We show that at most one small-amplitude limit cycle can bifurcate from the center and that this upper bound is attainable, illustrating the applicability of the proposed algorithm to a practical switching circuit. This application shows that our method provides a systematic framework for analyzing and interpreting complex dynamical phenomena arising in practical piecewise smooth systems.

Exponential Convergence of the Sinkhorn Algorithm for the Schrödinger Bridge with Regime Switching
Katharina Eichinger, Anna Kazeykina, Zhenjie Ren +1
HAL21 Jul 2026PreprintLicence not statedGeneral mathematicsHAL
Fractal Dimension Analysis of Constants π and e Using Pseudo-Optimized Maximum Window Selection for the Higuchi Algorithm
Gang Gyoo Jin, Kwangcheol Shin, Jongkap Ahn
Fractal and Fractional15 Oct 2026Peer-reviewedCC BY 4.0Analysis & PDEsCrossref
Digital Transformer for Fracture Classification: SYM-Fractron, a Physics-Driven Hybrid Binary–Symbolic Computing Ecosystem
Klaudia Oleshko, María de Jesús Correa López, Andrey Khrennikov +6
Fractal and Fractional8 Oct 2026Peer-reviewedCC BY 4.0Analysis & PDEsCrossref
An Exact Combinatorial Branch-and-Bound Algorithm for the Job Sequencing and Tool Switching Problem
Alberto Locatelli, Jean-François Côté, Leandro C. Coelho
arXiv2 Sep 2026PreprintarXiv licenceFull textCombinatorics & discrete mathematics Optimisation & controlarXiv
A Fast and High-Accuracy Finite-Time Sliding-Mode Algorithm for Computing Local Stackelberg Equilibria in Nonlinear Bilevel Games
Abdelhafid Zenati, Dave D Muir, Kamal Youcef-Toumi
arXiv8 Oct 2026PreprintarXiv licenceFull textDynamical systems Optimisation & controlarXiv

Cite

BibTeX RIS

BibTeX

@misc{zheng2026efficient,
  title = {{An Efficient Symbolic Algorithm for Computing Lyapunov Constants in Planar Switching Systems}},
  author = {Cheng Zheng and Laigang Guo and Xiangyu Wang},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.16908},
  eprint = {2609.16908},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.16908},
  note = {CC BY 4.0},
}

RIS

TY  - UNPB
TI  - An Efficient Symbolic Algorithm for Computing Lyapunov Constants in Planar Switching Systems
AU  - Cheng Zheng
AU  - Laigang Guo
AU  - Xiangyu Wang
PY  - 2026
DA  - 2026/09/15
PB  - arXiv
DO  - 10.48550/arxiv.2609.16908
UR  - https://arxiv.org/abs/2609.16908
AB  - Lyapunov constants are a crucial tool for analyzing bifurcation behavior in switching systems. This paper proposes an efficient algebraic symbolic algorithm for computing Lyapunov constants in planar switching systems. By mapping the vector fields into the complex domain, we construct a normal form algorithm based on Laurent poly?nomials. The classical Poincaré map method requires repeated symbolic integration, which may lead to substantial computational difficulties at high orders. Our ap?proach improves computational efficiency by replacing continuous integration with direct algebraic operations. We apply this approach to investigate two switching models. For a generalized switching quartic Liénard system, the algebraic method extracts the center conditions and proves the existence of 10 small-amplitude limit cycles, establishing a new lower bound for its cyclicity. Furthermore, a physically motivated circuit-level modification of the Alpazur oscillator is investigated. We show that at most one small-amplitude limit cycle can bifurcate from the center and that this upper bound is attainable, illustrating the applicability of the proposed algorithm to a practical switching circuit. This application shows that our method provides a systematic framework for analyzing and interpreting complex dynamical phenomena arising in practical piecewise smooth systems.
ER  -

Abstract

Related

Cite