Metraipolis › archive › dc_01f972645e33

Explicit Second-Order Bounds on the Domain of Validity for Lyapunov-Schmidt Reduction — arXiv:2609.24717

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.24717
License (as archived)
CC0-1.0
Archived
2026-10-10T00:57:35.173Z
SHA-256 of the archived text
730f4409f3b48195fbf1ec75151ac396b3ee009159e6a55dffc3dba0f4034c2e
Stable URL of this page
https://metraipolis.com/documento/dc_01f972645e33

How to cite

Explicit Second-Order Bounds on the Domain of Validity for Lyapunov-Schmidt Reduction — arXiv:2609.24717 — arXiv (en), https://arxiv.org/abs/2609.24717 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_01f972645e33 (Metraipolis archive dc_01f972645e33, sha256 730f4409f3b48195fbf1ec75151ac396b3ee009159e6a55dffc3dba0f4034c2e)
BibTeX
@misc{dc01f972645e33,
  title = {Explicit Second-Order Bounds on the Domain of Validity for Lyapunov-Schmidt Reduction — arXiv:2609.24717},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.24717},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_01f972645e33; sha256 730f4409f3b48195fbf1ec75151ac396b3ee009159e6a55dffc3dba0f4034c2e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.24717. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Lyapunov-Schmidt reduction is a widely used dimensionality reduction technique for bifurcation analysis in high-dimensional systems. While classical formulations guarantee the local existence of reduced-order equations, they typically lack explicit quantitative estimates on the size of the neighbourhoods in which these representations faithfully capture the full bifurcation structure. In recent work, we have addressed this limitation by deriving bounds on the domain of validity of this reduction using first-order conditions on the vector field together with a quantitative result for the implicit function theorem. In this article we explore beyond, and adopt second-order conditions that incorporate the Hessians of the vector field to develop these bounds, and obtain a new set of results. We then investigate the applicability of these newly derived bounds to Hopfield-like networked dynamical systems, evaluate these bounds for pitchfork bifurcations on connected regular graphs, and finally examine the relationship between the two certified domains for this class of systems.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-22 in eess.SY).
Categorie arXiv: Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2609.24717 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T23:57:37.648Z dalla pagina https://arxiv.org/catchup/eess.SY/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).