Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/41859
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | DE MAESSCHALCK, Peter | - |
dc.contributor.author | DUMORTIER, Freddy | - |
dc.contributor.author | Roussarie, Robert | - |
dc.date.accessioned | 2023-11-21T09:40:17Z | - |
dc.date.available | 2023-11-21T09:40:17Z | - |
dc.date.issued | 2023 | - |
dc.date.submitted | 2023-11-20T13:52:39Z | - |
dc.identifier.citation | REGULAR & CHAOTIC DYNAMICS, 28 (4) , p. 763 -780 | - |
dc.identifier.uri | http://hdl.handle.net/1942/41859 | - |
dc.description.abstract | The paper deals with multi-layer canard cycles, extending the results of [1]. As a practical tool we introduce the connection diagram of a canard cycle and we show how to determine it in an easy way. This connection diagram presents in a clear way all available information that is necessary to formulate the main system of equations used in the study of the bifurcating limit cycles. In a forthcoming paper we will show that both the type of the layers and the nature of the connections between the layers play an essential role in determining the number and the bifurcations of the limit cycles that can be created from a canard cycle. | - |
dc.description.sponsorship | We thank the anonymous referees for their detailed remarks and suggestions, which helped us in improving the presentation of this article. | - |
dc.language.iso | en | - |
dc.publisher | PLEIADES PUBLISHING INC | - |
dc.rights | Pleiades Publishing, Ltd., 2023 | - |
dc.subject.other | multi-layer canard cycles | - |
dc.subject.other | multi-layer canard cycles | - |
dc.subject.other | orientation of SF and FS passages | - |
dc.subject.other | orientation of SF and F S passages | - |
dc.subject.other | side-comparison at a canard connection | - |
dc.subject.other | side-comparison at a canard connection | - |
dc.subject.other | connection diagram | - |
dc.subject.other | connection diagram | - |
dc.subject.other | equations for limit cycles | - |
dc.subject.other | equations for limit cycles | - |
dc.title | Side-Comparison for Transition Maps in Multi-Layer Canard Problems | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 780 | - |
dc.identifier.issue | 4 | - |
dc.identifier.spage | 763 | - |
dc.identifier.volume | 28 | - |
local.format.pages | 18 | - |
local.bibliographicCitation.jcat | A1 | - |
dc.description.notes | Maesschalck, PD (corresponding author), Hasselt Univ, Agoralaan Gebouw D, B-3590 Diepenbeek, Belgium. | - |
dc.description.notes | peter.demaesschalck@uhasselt.be; freddy.dumortier@uhasselt.be; | - |
dc.description.notes | robert.roussarie@u-bourgogne.fr | - |
local.publisher.place | PLEIADES HOUSE, 7 W 54 ST, NEW YORK, NY, UNITED STATES | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.identifier.doi | 10.1134/S1560354723040159 | - |
dc.identifier.isi | 001087501700021 | - |
local.provider.type | wosris | - |
local.description.affiliation | [Maesschalck, Peter De; Dumortier, Freddy] Hasselt Univ, Agoralaan Gebouw D, B-3590 Diepenbeek, Belgium. | - |
local.description.affiliation | [Roussarie, Robert] Univ Bourgogne, Inst Math Bourgogne, BP 47 870, F-21078 Dijon, France. | - |
local.uhasselt.international | yes | - |
item.contributor | DE MAESSCHALCK, Peter | - |
item.contributor | DUMORTIER, Freddy | - |
item.contributor | Roussarie, Robert | - |
item.fulltext | With Fulltext | - |
item.accessRights | Restricted Access | - |
item.fullcitation | DE MAESSCHALCK, Peter; DUMORTIER, Freddy & Roussarie, Robert (2023) Side-Comparison for Transition Maps in Multi-Layer Canard Problems. In: REGULAR & CHAOTIC DYNAMICS, 28 (4) , p. 763 -780. | - |
crisitem.journal.issn | 1560-3547 | - |
crisitem.journal.eissn | 1468-4845 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
RCD_04-05_23.dvi.pdf Restricted Access | Published version | 779.66 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.