2014
DOI: 10.1007/978-3-319-09570-7
|View full text |Cite
|
Sign up to set email alerts
|

Singular Perturbations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
4

Relationship

1
7

Authors

Journals

citations
Cited by 72 publications
(18 citation statements)
references
References 0 publications
0
18
0
Order By: Relevance
“…In [19], it is shown that the dynamics of system (2.2) must be considered on different time scales. Before analysing the dynamical behaviour on the tippedisk in the framework of slow-fast systems, we introduce the basics of singular perturbation theory [24][25][26]. where ε 1 is identified as small fixed perturbation parameter and • := d dt • denotes the derivative with respect to 'slow' time t. The system…”
Section: (B) Singularly Perturbed Dynamicsmentioning
confidence: 99%
“…In [19], it is shown that the dynamics of system (2.2) must be considered on different time scales. Before analysing the dynamical behaviour on the tippedisk in the framework of slow-fast systems, we introduce the basics of singular perturbation theory [24][25][26]. where ε 1 is identified as small fixed perturbation parameter and • := d dt • denotes the derivative with respect to 'slow' time t. The system…”
Section: (B) Singularly Perturbed Dynamicsmentioning
confidence: 99%
“…We now investigate the case 1 in more detail. The equations (63) possess a slow manifold for > 0 sufficiently small [19,16]. To leading order, solutions on the slow manifold satisfy…”
Section: 1mentioning
confidence: 99%
“…with > 0 sufficiently small and A a symmetric positive definite matrix, there exists a smooth manifold M which is exponentially attractive and invariant under the dynamics of (97). See, for example, [19,16] for details. Approximations of the slow manifold can be found by utilising the principle of bounded derivatives, that is,…”
Section: 12mentioning
confidence: 99%
“…◻ Proof of Lemma 6.1: We construct P = [P 1 P 2 ...P n ] ∈ R n 2 ×n 2 as an orthogonal matrix, where P 1 = θ1 n 2 ×n , θ > 0, and rewrite P = [P 1 P ∆ ]. We also define a new vectorŝ 1 b ∈ R n 2 asŝ 1 = Pŝ 1 b , then the system (27), which is recalled as the boundary-layer model for (23a), becomes…”
Section: Appendix Bmentioning
confidence: 99%
“…In contrast with the previous work [18], this work considers different convergence rates toward dynamic agreement under the LCA, hereby seeking the NE at each player's own pace. Our work herein is also related to SPS comprised of slow and fast motions, which often occur when we mathematically model some natural processes, for example, biochemistry, fluid dynamics, nonlinear kinetics, and so on [27]. We design algorithms in the form of SPS to seek NE of the game (1).…”
mentioning
confidence: 99%