scholarly journals The parameterization method for one- dimensional invariant manifolds of higher dimensional parabolic fixed points

2007 ◽  
Vol 17 (4) ◽  
pp. 835-865 ◽  
Author(s):  
Inmaculada Baldomá ◽  
◽  
Ernest Fontich ◽  
Rafael de la Llave ◽  
Pau Martín ◽  
...  
Keyword(s):  
Fixed Points ◽  
Invariant Manifolds ◽  
One Dimensional ◽  
Parameterization Method ◽  
Higher Dimensional

scholarly journals Gevrey estimates for one dimensional parabolic invariant manifolds of non-hyperbolic fixed points

2017 ◽  
Vol 37 (8) ◽  
pp. 4159-4190 ◽  
Author(s):  
Inmaculada Baldomá ◽  
◽  
Ernest Fontich ◽  
Pau Martín ◽  
◽  
...  
Keyword(s):  
Fixed Points ◽  
Invariant Manifolds ◽  
One Dimensional ◽  
Hyperbolic Fixed Points ◽  
Gevrey Estimates

scholarly journals Higher Dimensional Holonomy Map for Rules Submanifolds in Graded Manifolds

2020 ◽  
Vol 8 (1) ◽  
pp. 68-91
Author(s):  
Gianmarco Giovannardi
Keyword(s):  
Characteristic Direction ◽  
Fixed Degree ◽  
One Dimensional ◽  
First Order ◽  
Natural Choice ◽  
Higher Dimensional ◽  
Graded Manifold ◽  
The One ◽  
Graded Manifolds ◽  
Holonomy Map

AbstractThe deformability condition for submanifolds of fixed degree immersed in a graded manifold can be expressed as a system of first order PDEs. In the particular but important case of ruled submanifolds, we introduce a natural choice of coordinates, which allows to deeply simplify the formal expression of the system, and to reduce it to a system of ODEs along a characteristic direction. We introduce a notion of higher dimensional holonomy map in analogy with the one-dimensional case [29], and we provide a characterization for singularities as well as a deformability criterion.

scholarly journals Classification of one-dimensional superattracting germs in positive characteristic

2014 ◽  
Vol 35 (7) ◽  
pp. 2242-2268 ◽  
Author(s):  
MATTEO RUGGIERO
Keyword(s):  
Positive Characteristic ◽  
Closed Field ◽  
Algebraically Closed Field ◽  
One Dimensional ◽  
Higher Dimensional ◽  
Dimensional Version

We give a classification of superattracting germs in dimension $1$ over a complete normed algebraically closed field $\mathbb{K}$ of positive characteristic up to conjugacy. In particular, we show that formal and analytic classifications coincide for these germs. We also give a higher-dimensional version of some of these results.

Discrete-Time Memristor Model for Enhancing Chaotic Complexity and Application in Secure Communication

2022 ◽  
Author(s):  
Wenhao Yan ◽  
Zijing Jiang ◽  
Qun Ding
Keyword(s):  
Fixed Points ◽  
Discrete Time ◽  
Dynamic Characteristics ◽  
Secure Communication ◽  
Chaotic Systems ◽  
Two Dimensional ◽  
Initial State ◽  
One Dimensional ◽  
Backward Euler ◽  
Short Period

Abstract The physical implementation of continuoustime memristor makes it widely used in chaotic circuits, whereas discrete-time memristor has not received much attention. In this paper, the backward-Euler method is used to discretize TiO2 memristor model, and the discretized model also meets the three fingerprinter characteristics of the generalized memristor. The short period phenomenon and uneven output distribution of one-dimensional chaotic systems affect their applications in some fields, so it is necessary to improve the dynamic characteristics of one-dimensional chaotic systems. In this paper, a two-dimensional discrete-time memristor model is obtained by linear coupling the proposed TiO2 memristor model and one-dimensional chaotic systems. Since the two-dimensional model has infinite fixed points, the stability of these fixed points depends on the coupling parameters and the initial state of the discrete TiO2 memristor model. Furthermore, the dynamic characteristics of one-dimensional chaotic systems can be enhanced by the proposed method. Finally, we apply the generated chaotic sequence to secure communication.

scholarly journals A Fast Elitism Gaussian Estimation of Distribution Algorithm and Application for PID Optimization

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Qingyang Xu ◽  
Chengjin Zhang ◽  
Li Zhang
Keyword(s):  
Probability Model ◽  
Learning Rule ◽  
Estimation Of Distribution Algorithm ◽  
Model Learning ◽  
One Dimensional ◽  
Fast Learning ◽  
Higher Dimensional ◽  
Intelligent Optimization Algorithm ◽  
Estimation Of Distribution ◽  
Gaussian Estimation

Estimation of distribution algorithm (EDA) is an intelligent optimization algorithm based on the probability statistics theory. A fast elitism Gaussian estimation of distribution algorithm (FEGEDA) is proposed in this paper. The Gaussian probability model is used to model the solution distribution. The parameters of Gaussian come from the statistical information of the best individuals by fast learning rule. A fast learning rule is used to enhance the efficiency of the algorithm, and an elitism strategy is used to maintain the convergent performance. The performances of the algorithm are examined based upon several benchmarks. In the simulations, a one-dimensional benchmark is used to visualize the optimization process and probability model learning process during the evolution, and several two-dimensional and higher dimensional benchmarks are used to testify the performance of FEGEDA. The experimental results indicate the capability of FEGEDA, especially in the higher dimensional problems, and the FEGEDA exhibits a better performance than some other algorithms and EDAs. Finally, FEGEDA is used in PID controller optimization of PMSM and compared with the classical-PID and GA.

A Graphical Exposition of the Ising Problem

1971 ◽  
Vol 12 (3) ◽  
pp. 365-377 ◽  
Author(s):  
Frank Harary
Keyword(s):  
Dimensional Case ◽  
Two Dimensional ◽  
One Dimensional ◽  
Higher Dimensional ◽  
The One

Ising [1] proposed the problem which now bears his name and solved it for the one-dimensional case only, leaving the higher dimensional cases as unsolved problems. The first solution to the two dimensional Ising problem was obtained by Onsager [6]. Onsager's method was subsequently explained more clearly by Kaufman [3]. More recently, Kac and Ward [2] discovered a simpler procedure involving determinants which is not logically complete.

scholarly journals Quasi-Periodic Bifurcations of Higher-Dimensional Tori

2016 ◽  
Vol 26 (07) ◽  
pp. 1630016 ◽  
Author(s):  
Motomasa Komuro ◽  
Kyohei Kamiyama ◽  
Tetsuro Endo ◽  
Kazuyuki Aihara
Keyword(s):  
Periodic Solutions ◽  
Phase Locking ◽  
Period Doubling ◽  
Double Covering ◽  
Heteroclinic Cycle ◽  
One Dimensional ◽  
Local Bifurcations ◽  
Saddle Node ◽  
Higher Dimensional ◽  
The Relationship

We classify the local bifurcations of quasi-periodic [Formula: see text]-dimensional tori in maps (abbr. MT[Formula: see text]) and in flows (abbr. FT[Formula: see text]) for [Formula: see text]. It is convenient to classify these bifurcations into normal bifurcations and resonance bifurcations. Normal bifurcations of MT[Formula: see text] can be classified into four classes: namely, saddle-node, period doubling, double covering, and Neimark–Sacker bifurcations. Furthermore, normal bifurcations of FT[Formula: see text] can be classified into three classes: saddle-node, double covering, and Neimark–Sacker bifurcations. These bifurcations are determined by the type of the dominant Lyapunov bundle. Resonance bifurcations are well known as phase locking of quasi-periodic solutions. These bifurcations are classified into two classes for both MT[Formula: see text] and FT[Formula: see text]: namely, saddle-node cycle and heteroclinic cycle bifurcations of the [Formula: see text]-dimensional tori. The former is reversible, while the latter is irreversible. In addition, we propose a method for analyzing higher-dimensional tori, which uses one-dimensional tori in sections (abbr. ST[Formula: see text]) and zero-dimensional tori in sections (abbr. ST[Formula: see text]). The bifurcations of ST[Formula: see text] can be classified into five classes: saddle-node, period doubling, component doubling, double covering, and Neimark–Sacker bifurcations. The bifurcations of ST[Formula: see text] can be classified into four classes: saddle-node, period doubling, component doubling, and Neimark–Sacker bifurcations. Furthermore, we clarify the relationship between the bifurcations of ST[Formula: see text]/ST[Formula: see text] and the bifurcations of MT[Formula: see text]/FT[Formula: see text]. We present examples of all of these bifurcations.

FAULT TOLERANCE AND DETECTION IN CHAOTIC COMPUTERS

2007 ◽  
Vol 17 (06) ◽  
pp. 1955-1968 ◽  
Author(s):  
MOHAMMAD R. JAHED-MOTLAGH ◽  
BEHNAM KIA ◽  
WILLIAM L. DITTO ◽  
SUDESHNA SINHA
Keyword(s):  
Chaotic Systems ◽  
Chaotic Maps ◽  
Structural Testing ◽  
Testing Time ◽  
Computing Device ◽  
One Dimensional ◽  
Testing Method ◽  
Higher Dimensional ◽  
Parameter Variations ◽  
Logic Blocks

We introduce a structural testing method for a dynamics based computing device. Our scheme detects different physical defects, manifesting themselves as parameter variations in the chaotic system at the core of the logic blocks. Since this testing method exploits the dynamical properties of chaotic systems to detect damaged logic blocks, the damaged elements can be detected by very few testing inputs, leading to very low testing time. Further the method does not entail dedicated or extra hardware for testing. Specifically, we demonstrate the method on one-dimensional unimodal chaotic maps. Some ideas for testing higher dimensional maps and flows are also presented.

Sign in / Sign up

Export Citation Format

Share Document