A numerical approximation for the simple bifurcation problems
From MaRDI portal
Publication:3470059
DOI10.1080/01630568908816309zbMath0694.65025OpenAlexW2034632315MaRDI QIDQ3470059
Publication date: 1989
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630568908816309
numerical examplessolution branchsplitting iteration methodcomputational costsimple bifurcation pointPath followingEuler-Newton method
Iterative procedures involving nonlinear operators (47J25) Equations involving nonlinear operators (general) (47J05) Numerical solutions to equations with nonlinear operators (65J15)
Related Items (3)
Path following around corank-2 bifurcation points of a semi-linear elliptic problem with symmetry ⋮ Tracing the buckling of a rectangular plate with the block GMRES method ⋮ Bifurcations of a simplified buckling problem and the effect of discretizations
Uses Software
Cites Work
- Rang revealing QR factorizations
- Branch switching in bifurcation problems for ordinary differential equations
- A quadratically convergent method for computing simple singular roots and its application to determining simple bifurcation points
- Computing simple bifurcation points using a minimally extended system of nonlinear equations
- Computation of bifurcation branches using projection methods
- Factorizing symmetric indefinite matrices
- Bifurcation from simple eigenvalues
- On Solving Nonlinear Equations with Simple Singularities or Nearly Singular Solutions
- Efficient Numerical Pathfollowing Beyond Critical Points
- The numerical treatment of non-trivial bifurcation points
- Path following near bifurcation
- Solution of Sparse Indefinite Systems of Linear Equations
- Numerical Methods for a Class of Finite Dimensional Bifurcation Problems
- Convergence Cones Near Bifurcation
This page was built for publication: A numerical approximation for the simple bifurcation problems