arXiv (OAI Expanded)
open access
An Efficient Symbolic Algorithm for Computing Lyapunov Constants in Planar Switching Systems
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Elementary Flight Dynamics with an Introduction to Bifurcation and Continuation Methods#466000
- A Tree-Based Localized Reduced Basis Method for Parametrized Parabolic PDEs#1130983
- Modeling of Inter-Turn Short Circuits in a Multiphase Synchronous Motor Using Power Sharing Capability#284303
- Numerical bifurcation analysis of turing and symmetry broken patterns of a PDE model for vegetation dynamics#5650
- Geometric Structure of the Solution Space of the Yamabe#96238
Record · ID 1123320
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive