scholarly journals Normal forms for the Laplace resonance

2021 ◽  
Vol 133 (3) ◽  
Author(s):  
Giuseppe Pucacco
Keyword(s):  
Normal Form ◽  
Normal Forms ◽  
Stable Equilibrium ◽  
Planetary System ◽  
Dynamical Structure ◽  
Comprehensive Model ◽  
Resonant Coupling ◽  
Keplerian Problem ◽  
Stable Equilibria ◽  
Galilean System

AbstractWe describe a comprehensive model for systems locked in the Laplace resonance. The framework is based on the simplest possible dynamical structure provided by the Keplerian problem perturbed by the resonant coupling truncated at second order in the eccentricities. The reduced Hamiltonian, constructed by a transformation to resonant coordinates, is then submitted to a suitable ordering of the terms and to the study of its equilibria. Henceforth, resonant normal forms are computed. The main result is the identification of two different classes of equilibria. In the first class, only one kind of stable equilibrium is present: the paradigmatic case is that of the Galilean system. In the second class, three kinds of stable equilibria are possible and at least one of them is characterised by a high value of the forced eccentricity for the ‘first planet’: here, the paradigmatic case is the exo-planetary system GJ-876, in which the combination of libration centres admits triple conjunctions otherwise not possible in the Galilean case. The normal form obtained by averaging with respect to the free eccentricity oscillations describes the libration of the Laplace argument for arbitrary amplitudes and allows us to determine the libration width of the resonance. The agreement of the analytic predictions with the numerical integration of the toy models is very good.

METHODS OF REDUCING OF LARGE BOOLEAN FORMULAS REPRESENTED IN A CONJUNCTIVE NORMAL FORM FOR DETERMINING THEIR SATISFIABILITY

2020 ◽  
Author(s):  
N.I. Gdansky ◽  
◽  
A.A. Denisov ◽  
Keyword(s):  
Normal Form ◽  
Normal Forms ◽  
Conjunctive Normal Form ◽  
Boolean Formulas

The article explores the satisfiability of conjunctive normal forms used in modeling systems.The problems of CNF preprocessing are considered.The analysis of particular methods for reducing this formulas, which have polynomial input complexity is given.

scholarly journals Normal form approach in the motion planning of space robots: a case study

2021 ◽  
Author(s):  
Krzysztof Tchoń ◽  
Katarzyna Zadarnowska
Keyword(s):  
Normal Form ◽  
Motion Planning ◽  
Normal Forms ◽  
Inverse Dynamics ◽  
Planning Problem ◽  
Inverse Dynamics Problem ◽  
Velocity Level ◽  
Form Approach ◽  
Space Approach

AbstractWe examine applicability of normal forms of non-holonomic robotic systems to the problem of motion planning. A case study is analyzed of a planar, free-floating space robot consisting of a mobile base equipped with an on-board manipulator. It is assumed that during the robot’s motion its conserved angular momentum is zero. The motion planning problem is first solved at velocity level, and then torques at the joints are found as a solution of an inverse dynamics problem. A novelty of this paper lies in using the chained normal form of the robot’s dynamics and corresponding feedback transformations for motion planning at the velocity level. Two basic cases are studied, depending on the position of mounting point of the on-board manipulator. Comprehensive computational results are presented, and compared with the results provided by the Endogenous Configuration Space Approach. Advantages and limitations of applying normal forms for robot motion planning are discussed.

NORMAL FORMS FOR FUZZY LOGIC — AN APPLICATION OF KOLMOGOROV’S THEOREM

1996 ◽  
Vol 04 (04) ◽  
pp. 331-349 ◽  
Author(s):  
VLADIK KREINOVICH ◽  
HUNG T. NGUYEN ◽  
DAVID A. SPRECHER
Keyword(s):  
Neural Networks ◽  
Fuzzy Logic ◽  
Normal Form ◽  
Normal Forms ◽  
Approximation Property ◽  
Universal Approximation ◽  
Approximation Result ◽  
Logical Operations ◽  
Kolmogorov's Theorem

This paper addresses mathematical aspects of fuzzy logic. The main results obtained in this paper are: 1. the introduction of a concept of normal form in fuzzy logic using hedges; 2. using Kolmogorov’s theorem, we prove that all logical operations in fuzzy logic have normal forms; 3. for min-max operators, we obtain an approximation result similar to the universal approximation property of neural networks.

scholarly journals Stability and Hopf Bifurcation Analysis of Coupled Optoelectronic Feedback Loops

2013 ◽  
Vol 2013 ◽  
pp. 1-11
Author(s):  
Gang Zhu ◽  
Junjie Wei
Keyword(s):  
Hopf Bifurcation ◽  
Normal Form ◽  
Center Manifold ◽  
Stable Equilibrium ◽  
Feedback Loops ◽  
Asymptotically Stable ◽  
Center Manifold Theorem ◽  
Feedback Strength ◽  
Coupling Parameters ◽  
Normal Form Method

The dynamics of a coupled optoelectronic feedback loops are investigated. Depending on the coupling parameters and the feedback strength, the system exhibits synchronized asymptotically stable equilibrium and Hopf bifurcation. Employing the center manifold theorem and normal form method introduced by Hassard et al. (1981), we give an algorithm for determining the Hopf bifurcation properties.

scholarly journals On the structure of least common multiple matrices from some class of matrices

2018 ◽  
Vol 10 (1) ◽  
pp. 179-184
Author(s):  
A.M. Romaniv
Keyword(s):  
Normal Form ◽  
Normal Forms ◽  
Smith Normal Form ◽  
Least Common Multiple ◽  
The Matrix ◽  
Singular Matrices ◽  
Class Of Matrices ◽  
Smith Normal Forms ◽  
Invertible Matrices ◽  
Principal Ideal Domains

For non-singular matrices with some restrictions, we establish the relationships between Smith normal forms and transforming matrices (a invertible matrices that transform the matrix to its Smith normal form) of two matrices with corresponding matrices of their least common right multiple over a commutative principal ideal domains. Thus, for such a class of matrices, given answer to the well-known task of M. Newman. Moreover, for such matrices, received a new method for finding their least common right multiple which is based on the search for its Smith normal form and transforming matrices.

scholarly journals A combinatory account of internal structure

2011 ◽  
Vol 76 (3) ◽  
pp. 807-826 ◽  
Author(s):  
Barry Jay ◽  
Thomas Given-Wilson
Keyword(s):  
Normal Form ◽  
Internal Structure ◽  
Pattern Matching ◽  
Normal Forms ◽  
Expressive Power ◽  
Combinatory Logic ◽  
Natural Numbers ◽  
Type Information ◽  
Computable Functions

AbstractTraditional combinatory logic uses combinators S and K to represent all Turing-computable functions on natural numbers, but there are Turing-computable functions on the combinators themselves that cannot be so represented, because they access internal structure in ways that S and K cannot. Much of this expressive power is captured by adding a factorisation combinator F. The resulting SF-calculus is structure complete, in that it supports all pattern-matching functions whose patterns are in normal form, including a function that decides structural equality of arbitrary normal forms. A general characterisation of the structure complete, confluent combinatory calculi is given along with some examples. These are able to represent all their Turing-computable functions whose domain is limited to normal forms. The combinator F can be typed using an existential type to represent internal type information.

A SUFFICIENT CONDITION FOR THE UNIQUENESS OF NORMAL FORMS AND UNIQUE NORMAL FORMS OF GENERALIZED HOPF SINGULARITIES

2004 ◽  
Vol 14 (09) ◽  
pp. 3337-3345 ◽  
Author(s):  
JIANPING PENG ◽  
DUO WANG
Keyword(s):  
Normal Form ◽  
Normal Forms ◽  
Sufficient Condition ◽  
First Order ◽  
Recursive Formulas ◽  
Unique Normal Forms

A sufficient condition for the uniqueness of the Nth order normal form is provided. A new grading function is proposed and used to prove the uniqueness of the first-order normal forms of generalized Hopf singularities. Recursive formulas for computation of coefficients of unique normal forms of generalized Hopf singularities are also presented.

Equational Logic Programming

1998 ◽  
Author(s):  
Michael J. O’Donnell
Keyword(s):  
Normal Form ◽  
Logic Programming ◽  
Programming Languages ◽  
Question Answering ◽  
Normal Forms ◽  
Equational Logic ◽  
Consequence Relation ◽  
Logic Programming Languages ◽  
Semantic Consequence

Sections 2.3.4 and 2.3.5 of the chapter ‘Introduction: Logic and Logic Programming Languages’ are crucial prerequisites to this chapter. I summarize their relevance below, but do not repeat their content. Logic programming languages in general are those that compute by deriving semantic consequences of given formulae in order to answer questions. In equational logic programming languages, the formulae are all equations expressing postulated properties of certain functions, and the questions ask for equivalent normal forms for given terms. Section 2.3.4 of the ‘Introduction . . .’ chapter gives definitions of the models of equational logic, the semantic consequence relation . . . T |=≐(t1 ≐ t2) . . . (t1 ≐ t2 is a semantic consequence of the set T of equations, see Definition 2.3.14), and the question answering relation . . . (norm t1,…,ti : t) ?- ≐ (t ≐ s) . . . (t ≐ s asserts the equality of t to the normal form s, which contains no instances of t1, . . . , ti, see Definition 2.3.16).

Jacobi analysis for an unusual 3D autonomous system

2020 ◽  
Vol 17 (04) ◽  
pp. 2050062 ◽  
Author(s):  
Chunsheng Feng ◽  
Qiujian Huang ◽  
Yongjian Liu
Keyword(s):  
Chaotic System ◽  
Stable Equilibrium ◽  
Equilibrium Points ◽  
Dynamical Behavior ◽  
Three Dimensional ◽  
Chen System ◽  
Parameter Region ◽  
Stable Equilibria ◽  
The Lorenz System ◽  
Deviation Vector

Little seems to be known about the study of the chaotic system with only Lyapunov stable equilibria from the perspective of differential geometry. Therefore, this paper presents Jacobi analysis of an unusual three-dimensional (3D) autonomous chaotic system. Under certain parameter conditions, this system has positive Lyapunov exponents and only two linear stable equilibrium points, which means that chaotic attractor and Lyapunov stable equilibria coexist. The dynamical behavior of the deviation vector near the whole trajectories (including all equilibrium points) is analyzed in detail. The results show that the value of the deviation curvature tensor at equilibrium points is only related to parameters; the two equilibrium points of the system are Jacobi stable if the parameters satisfy certain conditions. Particularly, for a specific set of parameters, the linear stable equilibrium points of the system are always Jacobi unstable. A periodic orbit that is Lyapunov stable is also proven to be always Jacobi unstable. Next, Jacobi-stable regions of the Lorenz system, the Chen system and the system under study are compared for specific parameters. It can be found that although these three chaotic systems are very similar, their regions of Jacobi stable parameters are much different. Finally, by comparing Jacobi stability with Lyapunov stability, the obtained results demonstrate that the Jacobi stable parameter region is basically symmetric with the Lyapunov stable parameter region.

Normal Forms for Codimension One Planar Piecewise Smooth Vector Fields

2014 ◽  
Vol 24 (07) ◽  
pp. 1450090 ◽  
Author(s):  
Tiago de Carvalho ◽  
Durval José Tonon
Keyword(s):  
Vector Field ◽  
Normal Form ◽  
Vector Fields ◽  
Normal Forms ◽  
Piecewise Smooth ◽  
Topological Equivalence ◽  
Smooth Vector ◽  
Codimension One ◽  
Piecewise Smooth Vector Fields ◽  
Piecewise Smooth Vector Field

In this paper, we are dealing with piecewise smooth vector fields in a 2D-manifold. In such a scenario, the main goal of this paper is to exhibit the homeomorphism that gives the topological equivalence between a codimension one piecewise smooth vector field and the respective C0-normal form.

Sign in / Sign up

Export Citation Format

Share Document