Attractor as a convex combination of a set of attractors
| dc.contributor.author | Danca, Marius-F. | |
| dc.contributor.author | Fĕckan, Michal | |
| dc.contributor.author | Kuznetsov, Nikolay | |
| dc.contributor.author | Chen, Guanrong | |
| dc.date.accessioned | 2021-01-27T08:40:44Z | |
| dc.date.available | 2021-01-27T08:40:44Z | |
| dc.date.issued | 2021 | |
| dc.identifier.citation | Danca, Marius-F., Fĕckan, M., Kuznetsov, N., & Chen, G. (2021). Attractor as a convex combination of a set of attractors. <i>Communications in Nonlinear Science and Numerical Simulation</i>, <i>96</i>, Article 105721. <a href="https://doi.org/10.1016/j.cnsns.2021.105721" target="_blank">https://doi.org/10.1016/j.cnsns.2021.105721</a> | |
| dc.identifier.other | CONVID_47803515 | |
| dc.identifier.uri | https://jyx.jyu.fi/handle/123456789/73843 | |
| dc.description.abstract | This paper presents an effective approach to constructing numerical attractors of a general class of continuous homogenous dynamical systems: decomposing an attractor as a convex combination of a set of other existing attractors. For this purpose, the convergent Parameter Switching (PS) numerical method is used to integrate the underlying dynamical system. The method is built on a convergent fixed step-size numerical method for ODEs. The paper shows that the PS algorithm, incorporating two binary operations, can be used to approximate any numerical attractor via a convex combination of some existing attractors. Several examples are presented to show the effectiveness of the proposed method. | en |
| dc.format.mimetype | application/pdf | |
| dc.language | eng | |
| dc.language.iso | eng | |
| dc.publisher | Elsevier | |
| dc.relation.ispartofseries | Communications in Nonlinear Science and Numerical Simulation | |
| dc.rights | CC BY-NC-ND 4.0 | |
| dc.subject.other | parameter switching | |
| dc.subject.other | continuous-time system | |
| dc.subject.other | numerical attractor | |
| dc.title | Attractor as a convex combination of a set of attractors | |
| dc.type | article | |
| dc.identifier.urn | URN:NBN:fi:jyu-202101271304 | |
| dc.contributor.laitos | Informaatioteknologian tiedekunta | fi |
| dc.contributor.laitos | Faculty of Information Technology | en |
| dc.contributor.oppiaine | Tietotekniikka | fi |
| dc.contributor.oppiaine | Mathematical Information Technology | en |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | |
| dc.type.coar | http://purl.org/coar/resource_type/c_2df8fbb1 | |
| dc.description.reviewstatus | peerReviewed | |
| dc.relation.issn | 1007-5704 | |
| dc.relation.volume | 96 | |
| dc.type.version | acceptedVersion | |
| dc.rights.copyright | © 2021 Elsevier B.V. All rights reserved. | |
| dc.rights.accesslevel | openAccess | fi |
| dc.subject.yso | dynaamiset systeemit | |
| dc.subject.yso | attraktorit | |
| dc.subject.yso | approksimointi | |
| dc.subject.yso | numeeriset menetelmät | |
| dc.format.content | fulltext | |
| jyx.subject.uri | http://www.yso.fi/onto/yso/p38899 | |
| jyx.subject.uri | http://www.yso.fi/onto/yso/p38900 | |
| jyx.subject.uri | http://www.yso.fi/onto/yso/p4982 | |
| jyx.subject.uri | http://www.yso.fi/onto/yso/p6588 | |
| dc.rights.url | https://creativecommons.org/licenses/by-nc-nd/4.0/ | |
| dc.relation.doi | 10.1016/j.cnsns.2021.105721 | |
| jyx.fundinginformation | M. Fĕckan is partially supported by the Slovak Research and Development Agency under the Contract No. APVV-18-0308, and the Slovak Grant Agency VEGA No. 1/0358/20 and No. 2/0127/20, N. Kuznetsov, G. Chen and M.-F. Danca are supported by the Russian Science Foundation project 19-41-02002 (Section 2 and dummyTXdummy-( 3). | |
| dc.type.okm | A1 |
Aineistoon kuuluvat tiedostot
Aineisto kuuluu seuraaviin kokoelmiin
Ellei muuten mainita, aineiston lisenssi on CC BY-NC-ND 4.0