|
This article is cited in 1 scientific paper (total in 1 paper)
A reduced graph algorithm to investigate bifurcations
Yu. V. Troshchiev M. V. Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics
Abstract:
An algorithm of construction of some subgraph of bifurcation graph for symmetrical systems of equations is reported in the paper. It is proved also that the subgraph contains one and only one representative from every equivalence class of complete bifurcation routes. One more algorithm is developed which is more effectively deletes conjugate structures.
Received: 11.03.2004
Citation:
Yu. V. Troshchiev, “A reduced graph algorithm to investigate bifurcations”, Matem. Mod., 17:1 (2005), 10–18
Linking options:
https://www.mathnet.ru/eng/mm139 https://www.mathnet.ru/eng/mm/v17/i1/p10
|
Statistics & downloads: |
Abstract page: | 445 | Full-text PDF : | 413 | References: | 1 | First page: | 1 |
|