Numerical detection of bifurcation point in the curve

Jacek Gulgowski. "Numerical detection of bifurcation point in the curve." Mathematica Applicanda 43.1 (2015): null. <http://eudml.org/doc/292794>.

@article{JacekGulgowski2015,
abstract = {We are presenting a numerical method which detects the presence and position of a  bifurcation simplex, the regular $(k+1)$-dimensional simplex, which may be considered as “fat bifurcation point”, in the curve of zeroes of the $C^1$ map $f:\{\mathbb \{R\}\}^\{k+1\}\rightarrow \{\mathbb \{R\}\}^k$. On the other hand the bifurcation simplex appears in the neighbourhood of the bifurcation point, meaning that we have the method to locate the bifurcation point as well. The method does not require any estimation of the derivative of the function $f$ and refers to the values of the map $f$ only in the vertices of certain triangulation. The bifurcation simplex is detected by change of the Brouwer degree value of the restriction of the map $f$ to the appropriate $k$-simplex.This publication is co-financed by the European Union as part of the European Social Fund within the project Center for Applications of Mathematics.},
author = {Jacek Gulgowski},
journal = {Mathematica Applicanda},
keywords = {path following algorithm; bifurcation point; bifurcation simplex},
language = {eng},
number = {1},
pages = {null},
title = {Numerical detection of bifurcation point in the curve},
url = {http://eudml.org/doc/292794},
volume = {43},
year = {2015},
}

TY - JOUR
AU - Jacek Gulgowski
TI - Numerical detection of bifurcation point in the curve
JO - Mathematica Applicanda
PY - 2015
VL - 43
IS - 1
SP - null
AB - We are presenting a numerical method which detects the presence and position of a  bifurcation simplex, the regular $(k+1)$-dimensional simplex, which may be considered as “fat bifurcation point”, in the curve of zeroes of the $C^1$ map $f:{\mathbb {R}}^{k+1}\rightarrow {\mathbb {R}}^k$. On the other hand the bifurcation simplex appears in the neighbourhood of the bifurcation point, meaning that we have the method to locate the bifurcation point as well. The method does not require any estimation of the derivative of the function $f$ and refers to the values of the map $f$ only in the vertices of certain triangulation. The bifurcation simplex is detected by change of the Brouwer degree value of the restriction of the map $f$ to the appropriate $k$-simplex.This publication is co-financed by the European Union as part of the European Social Fund within the project Center for Applications of Mathematics.
LA - eng
KW - path following algorithm; bifurcation point; bifurcation simplex
UR - http://eudml.org/doc/292794
ER -