An algorithm to approach invariant curves
| dc.citation.epage | 42 | en_US |
| dc.citation.issue | 1-2 | en_US |
| dc.citation.spage | 30 | en_US |
| dc.citation.volume | 149 | en_US |
| dc.citation.woscount | 3 | |
| dc.contributor.author | Yu, CJ | en_US |
| dc.contributor.author | Lee, JE | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:44:17Z | |
| dc.date.available | 2014-12-08T15:44:17Z | |
| dc.date.issued | 2001-02-01 | en_US |
| dc.description.abstract | We develop an algorithm to identify invariant curves efficiently. In dynamical systems, it helps do continuations of branches of quasi-periodic solutions smoothly in bifurcation diagrams. Several examples are demonstrated to provide the numerical evidence for the versatility of the algorithm. (C) 2001 Elsevier Science B.V. All rights reserved. | en_US |
| dc.identifier.doi | 10.1016/S0167-2789(00)00181-0 | en_US |
| dc.identifier.issn | 0167-2789 | en_US |
| dc.identifier.journal | PHYSICA D | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1016/S0167-2789(00)00181-0 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/29894 | |
| dc.identifier.wosnumber | WOS:000166682700003 | |
| dc.language.iso | en_US | en_US |
| dc.subject | quasi-periodic | en_US |
| dc.subject | invariant | en_US |
| dc.subject | tori | en_US |
| dc.subject | numerical | en_US |
| dc.subject | algorithm | en_US |
| dc.title | An algorithm to approach invariant curves | en_US |
| dc.type | Article | en_US |