Computing multiple pitchfork bifurcation points
From MaRDI portal
Publication:1377277
DOI10.1007/BF02684441zbMath0890.65050OpenAlexW1968629662MaRDI QIDQ1377277
Gerd Poenisch, Uwe Schnabel, Hubert Schwetlick
Publication date: 6 July 1998
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02684441
singular pointsnumerical experimentsparameter dependent nonlinear equationpitchfork bifurcation pointLyapunov-Schmidt branching equationminimally extended systemstwo-stage Newton-type method
Related Items (2)
Computing multiple turning points by using simple extended systems and computational differentiation ⋮ Iterative computation of the smallest singular value and the corresponding singular vectors of a matrix.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical computation of nonsimple turning points and cusps
- Computing simple bifurcation points using a minimally extended system of nonlinear equations
- Singularities and groups in bifurcation theory. Volume I
- Computing turning points of curves implicitly defined by nonlinear equations depending on a parameter
- Practical bifurcation and stability analysis: from equilibrium to chaos.
- Computing hysteresis points of nonlinear equations depending on two parameters
- Characterization and Computation of Generalized Turning Points
- Minimally extended defining conditions for singularities of codim≤2
- A General View of Minimally Extended Systems for Simple Bifurcation Points
- BORDERED MATRICES AND SINGULARITIES OF LARGE NONLINEAR SYSTEMS
This page was built for publication: Computing multiple pitchfork bifurcation points