A bisection-like algorithm for branch switching at a simple branch point
From MaRDI portal
Publication:618494
Recommendations
- scientific article; zbMATH DE number 3858312
- scientific article; zbMATH DE number 1425050
- MULTIPARAMETER PARALLEL SEARCH BRANCH SWITCHING
- A homotopy method of switching solution branches at the pitchfork bifurcation point
- The unfolding technique for switching solution branches in bifurcation problems
Cites work
- scientific article; zbMATH DE number 1787315 (Why is no real title available?)
- A General View of Minimally Extended Systems for Simple Bifurcation Points
- Characterization and Computation of Generalized Turning Points
- Computational Science – ICCS 2005
- Computational Science – ICCS 2005
- Computing Connecting Orbits via an Improved Algorithm for Continuing Invariant Subspaces
- Continuation of Invariant Subspaces in Large Bifurcation Problems
- Continuation of invariant subspaces
- Elements of applied bifurcation theory
- MATCONT
- Numerical Continuation at Double Bifurcation Points of a Reaction–Diffusion Problem
Cited in
(7)- A homotopy method of switching solution branches at the pitchfork bifurcation point
- MULTIPARAMETER PARALLEL SEARCH BRANCH SWITCHING
- A method of piecewise‐smooth numerical branching
- Detecting and switching methods for simple bifurcation points
- Numerical computation of bifurcations in large equilibrium systems in \textsc{Matlab}
- scientific article; zbMATH DE number 1425050 (Why is no real title available?)
- The unfolding technique for switching solution branches in bifurcation problems
This page was built for publication: A bisection-like algorithm for branch switching at a simple branch point
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q618494)