Computing multiple pitchfork bifurcation points (Q1377277): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02684441 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968629662 / rank
 
Normal rank

Latest revision as of 11:43, 30 July 2024

scientific article
Language Label Description Also known as
English
Computing multiple pitchfork bifurcation points
scientific article

    Statements

    Computing multiple pitchfork bifurcation points (English)
    0 references
    0 references
    0 references
    6 July 1998
    0 references
    For the parameter dependent nonlinear equation \(F(x,\lambda) =0\), \(F: \mathbb{R}^n \times \mathbb{R}^1 \to\mathbb{R}^n\), the generically important case \(\text{rank} \partial_x E(x^*, \lambda^*) =n-1\) is investigated. In a neighborhood of such pitchfork bifurcation point \((x^*, \lambda^*)\) of multiplicity \(p\geq 1\) the Lyapunov-Schmidt branching equation has the normal form \(g(\xi,\mu) =\pm \xi^{2+p} \pm \mu \xi=0\). It is shown that such points satisfy a minimally extended system \(G(y) =0\), \(G: \mathbb{R}^{n+2} \to \mathbb{R}^{n+2}\), where the dimension \(n+2\) is independent of \(p\). For solving this system a two-stage Newton-type method is suggested. The method is illustrated by numerical experiments.
    0 references
    0 references
    singular points
    0 references
    minimally extended systems
    0 references
    parameter dependent nonlinear equation
    0 references
    pitchfork bifurcation point
    0 references
    Lyapunov-Schmidt branching equation
    0 references
    two-stage Newton-type method
    0 references
    numerical experiments
    0 references
    0 references
    0 references
    0 references
    0 references