scholarly journals Amplitude Independent Frequency Synchroniser for a Cubic Planar Polynomial System

2012 ◽  
Vol 7 (2) ◽  
Author(s):  
Islam Boussaada

The problem of local linearizability of the planar linear center perturbed by cubic non- linearities in all generalities on the system parameters (14 parameters) is far from being solved. The synchronization problem (as noted in Pikovsky, A., Rosenblum, M., and Kurths, J., 2003, Synchronization: A Universal Concept in Nonlinear Sciences, Cambridge Nonlinear Science Series, Cambridge University Press, UK, and Blekhman, I. I., 1988, Synchronisation in Science and Technology, ASME Press Translations, New York) consists in bringing appropriate modifications on a given system to obtain a desired dynamic. The desired phase portrait along this paper contains a compact region around a singular point at the origin in which lie periodic orbits with the same period (independently from the chosen initial conditions). In this paper, starting from a five parameters non isochronous Chouikha cubic system (Chouikha, A. R., 2007, “Isochronous Centers of Lienard Type Equations and Applications,” J. Math. Anal. Appl., 331, pp. 358–376) we identify all possible monomial perturbations of degree d ∈ {2, 3} insuring local linearizability of the perturbed system. The necessary conditions are obtained by the Normal Forms method. These conditions are real algebraic equations (multivariate polynomials) in the parameters of the studied ordinary differential system. The efficient algorithm FGb (J. C. Faugère, “FGb Salsa Software,” http://fgbrs.lip6.fr) for computing the Gröbner basis is used. For the family studied in this paper, an exhaustive list of possible parameters values insuring local linearizability is established. All the found cases are already known in the literature but the contexts are different since our object is the synchronisation rather than the classification. This paper can be seen as a direct continuation of several new works concerned with the hinting of cubic isochronous centers, (in particular Bardet, M., and Boussaada, I., 2011, “Compexity Reduction of C-algorithm,” App. Math. Comp., in press; Boussaada, I., Chouikha, A. R., and Strelcyn, J.-M., 2011, “Isochronicity Conditions for some Planar Polynomial Systems,” Bull. Sci. Math, 135(1), pp. 89–112; Bardet, M., Boussaada, I., Chouikha, A. R., and Strelcyn, J.-M., 2011, “Isochronicity Conditions for some Planar Polynomial Systems,” Bull. Sci. Math, 135(2), pp. 230–249; and furthermore, it can be considered as an adaptation of a qualitative theory method to a synchronization problem.

2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
Author(s):  
Jiamei Zhou ◽  
Na Li ◽  
Maoan Han

We study the problem of bifurcation of critical periods of a time-reversible polynomial system of degreen. We first present a new method to find the number of zeros of the period function. Then applying our results, we study the number of critical periods for some polynomial systems and obtain new results.


2013 ◽  
Vol 23 (09) ◽  
pp. 1350154 ◽  
Author(s):  
CHANGBO CHEN ◽  
ROBERT M. CORLESS ◽  
MARC MORENO MAZA ◽  
PEI YU ◽  
YIMING ZHANG

In this paper, the theory of regular chains and a triangular decomposition method relying on modular computations are presented in order to symbolically solve multivariate polynomial systems. Based on the focus values for dynamic systems obtained by using normal form theory, this method is applied to compute the limit cycles bifurcating from Hopf critical points. In particular, a quadratic planar polynomial system is used to demonstrate the solving process and to show how to obtain center conditions. The modular computations based on regular chains are applied to a cubic planar polynomial system to show the computation efficiency of this method, and to obtain all real solutions of nine limit cycles around a singular point. To the authors' best knowledge, this is the first article to simultaneously provide a complete, rigorous proof for the existence of nine limit cycles in a cubic system and all real solutions for these limit cycles.


Author(s):  
Keisuke Arikawa

Many kinematic problems of mechanisms can be expressed in the form of polynomial systems. Gröbner Bases computation is effective for algebraically analyzing such systems. In this research, we discuss the cases in which the parameters are included in the polynomial systems. The parameters are used to express the link lengths, the displacements of active joints, hand positions, and so on. By calculating Gröbner Cover of the parametric polynomial system that expresses kinematic constraints, we obtain segmentation of the parameter space and valid Gröbner Bases for each segment. In the application examples, we use planar linkages to interpret the meanings of the algebraic equations that define the segments and the Gröbner Bases. Using these interpretations, we confirmed that it was possible to enumerate the assembly and working modes and to identify the geometrical conditions that enable overconstrained motions.


2001 ◽  
Vol 95 (4) ◽  
pp. 1005-1006
Author(s):  
Paul J. Weber

Laura Olson is one of a small but energetic and influential group of Christian political scientists determined to bring the debate politically legitimate called it either racist or sexist. Yet, somewhat surprisingly, African American pastors held the most consistently conservative views on family values, although they also saw the connections among crime, violence, and the deterioration of the family. Within the authorÕs intentionally limited scope, this is an excellent study, but one should be cautious about generalizing.


Sign in / Sign up

Export Citation Format

Share Document