Computing simple bifurcation points using a minimally extended system of nonlinear equations
From MaRDI portal
Publication:1060814
DOI10.1007/BF02240195zbMath0569.65041MaRDI QIDQ1060814
Publication date: 1985
Published in: Computing (Search for Journal in Brave)
Newton-like methodlocal convergencebifurcation pointsbranch pointsextended systemnonlinear parameterdependent equations
Related Items
A relation between Newton and Gauss-Newton steps for singular nonlinear equations, Computation of a simple bifurcation point using one singular value decomposition nearby, A numerical approximation for the simple bifurcation problems, Nonlinear computation, Computing multiple pitchfork bifurcation points, A note on computing simple bifurcation points, An efficient algorithm for a class of equality-constrained optimization problems, On a class of bifurcation test functions, Numerical Liapunov-Schmidt spectral method for \(k\)-determined problems, Minimally extended defining conditions for singularities of codim≤2, Splitting iteration method for simple singular points and simple bifurcation points, Multilevel methods for the approximation of singular solutions of completely continuous operator equations, Computing hysteresis points of nonlinear equations depending on two parameters, Nonlinear Computation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing turning points of curves implicitly defined by nonlinear equations depending on a parameter
- Evaluation of limit and bifurcation points for algebraic equations and nonlinear boundary-value problems
- Bifurcation from simple eigenvalues
- Characterization and Computation of Generalized Turning Points
- The Role of the Tangent Mapping in Analyzing Bifurcation Behaviour
- The numerical treatment of non-trivial bifurcation points