Finding bifurcations for solutions of nonlinear equations by quadratic programming methods (Q2840268)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6188983
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding bifurcations for solutions of nonlinear equations by quadratic programming methods |
scientific article; zbMATH DE number 6188983 |
Statements
17 July 2013
0 references
bifurcation of solutions
0 references
minimax problem
0 references
steepest ascend direction
0 references
non linear elliptic equations
0 references
quadratic programming
0 references
Finding bifurcations for solutions of nonlinear equations by quadratic programming methods (English)
0 references
The authors study the solution of nonlinear equations bifurcation of the turn point type. Here, a method of extended functionals is used, and the bifurcation is found as a solution to variational problems of minimax type. An iteration algorithm is constructed on the ground of the steepest descend for the piecewise-smooth maps.
0 references
0.8343326449394226
0 references
0.8306170105934143
0 references
0.7901699542999268
0 references
0.7846440076828003
0 references
