Controllability of nonlinear stochastic fractional higher order dynamical systems

2019 ◽  
Vol 22 (4) ◽  
pp. 1063-1085
Author(s):  
R. Mabel Lizzy ◽  
K. Balachandran ◽  
Yong-Ki Ma
Keyword(s):  
Dynamical Systems ◽  
Sufficient Conditions ◽  
Banach Fixed Point Theorem ◽  
Necessary And Sufficient Condition ◽  
Bounded Operators ◽  
Semilinear Systems ◽  
Operator Functions ◽  
Fractional System ◽  
Necessary And Sufficient ◽  
The Given

Abstract This paper deals with the study of controllability of stochastic fractional dynamical systems with 1 < α ≤ 2. Necessary and sufficient condition for controllability of linear stochastic fractional system is obtained. Sufficient conditions for controllability of stochastic fractional semilinear systems, integrodifferential systems, systems with neutral term, systems with delays in control and systems with Lévy noise is formulated and established. The solution is obtained in terms of Mittag-Leffler operator functions by considering bounded operators. The Banach fixed point theorem is used to obtain the desired results from an equivalent nonlinear integral equation of the given system.

On the Existence of Mayer’s Potential

1997 ◽  
Vol 64 (3) ◽  
pp. 606-612 ◽  
Author(s):  
V. M. Cˇovic´ ◽  
M. M. Lukacˇevic´
Keyword(s):  
Dynamical Systems ◽  
Complete Solution ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Hamilton’S Principle ◽  
Hamilton's Principle ◽  
Nonconservative Systems ◽  
Necessary And Sufficient ◽  
The Given ◽  
Special Case

A complete solution of the well-known Mayer’s problem, which is concerned with the possibility of extending Hamilton’s principle expressed in the form valid for conservative dynamical systems to one special case of nonconservative systems (Appell, 1911), is obtained. Namely, the necessary and sufficient conditions which have to be satisfied by the coefficients of the given nonconservative generalized forces so that the Mayer’s potential (and, as a consequence, the descriptive function of the system) can be constructed, are established. This result is illustrated by an example.

Characterizations of nuclear pseudo-differential operators on ℤ with some applications

2018 ◽  
Vol 13 (4) ◽  
pp. 33
Author(s):  
Majid JamalpourBirgani
Keyword(s):  
Differential Operators ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Bounded Operators ◽  
Nuclear Operators ◽  
Pseudo Differential Operators ◽  
Necessary And Sufficient ◽  
Adjoint Operators

In this paper, we give necessary and sufficient conditions on the symbols σ, such that the corresponding pseudo-differential operators Tσ from Lp1(ℤ) into Lp2(ℤ), 1 ≤ p1,p2 < ∞, be nuclear. We show that the adjoint operators of the nuclear pseudo-differential operators from Lp′2(ℤ) into Lp′1(ℤ) are nuclear and present a necessary and sufficient condition on the symbols of the nuclear pseudo-differential operators from L2(ℤ) into L2(ℤ) to be self-adjoint. As applications, We get the symbol of the product of the nuclear operators with the bounded operators, and a necessary and sufficient condition on the symbols of nuclear operators is given to be normal.

scholarly journals Noetherian properties in composite generalized power series rings

2020 ◽  
Vol 18 (1) ◽  
pp. 1540-1551
Author(s):  
Jung Wook Lim ◽  
Dong Yeol Oh
Keyword(s):  
Necessary Conditions ◽  
Sufficient Conditions ◽  
Commutative Rings ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Generalized Power Series ◽  
Ordered Monoid ◽  
Power Series Rings ◽  
Necessary And Sufficient ◽  
Equivalent Conditions

Abstract Let ({\mathrm{\Gamma}},\le ) be a strictly ordered monoid, and let {{\mathrm{\Gamma}}}^{\ast }\left={\mathrm{\Gamma}}\backslash \{0\} . Let D\subseteq E be an extension of commutative rings with identity, and let I be a nonzero proper ideal of D. Set \begin{array}{l}D+[\kern-2pt[ {E}^{{{\mathrm{\Gamma}}}^{\ast },\le }]\kern-2pt] := \left\{f\in [\kern-2pt[ {E}^{{\mathrm{\Gamma}},\le }]\kern-2pt] \hspace{0.15em}|\hspace{0.2em}f(0)\in D\right\}\hspace{.5em}\text{and}\\ \hspace{0.2em}D+[\kern-2pt[ {I}^{{\Gamma }^{\ast },\le }]\kern-2pt] := \left\{f\in [\kern-2pt[ {D}^{{\mathrm{\Gamma}},\le }]\kern-2pt] \hspace{0.15em}|\hspace{0.2em}f(\alpha )\in I,\hspace{.5em}\text{for}\hspace{.25em}\text{all}\hspace{.5em}\alpha \in {{\mathrm{\Gamma}}}^{\ast }\right\}.\end{array} In this paper, we give necessary conditions for the rings D+[\kern-2pt[ {E}^{{{\mathrm{\Gamma}}}^{\ast },\le }]\kern-2pt] to be Noetherian when ({\mathrm{\Gamma}},\le ) is positively ordered, and sufficient conditions for the rings D+[\kern-2pt[ {E}^{{{\mathrm{\Gamma}}}^{\ast },\le }]\kern-2pt] to be Noetherian when ({\mathrm{\Gamma}},\le ) is positively totally ordered. Moreover, we give a necessary and sufficient condition for the ring D+[\kern-2pt[ {I}^{{\Gamma }^{\ast },\le }]\kern-2pt] to be Noetherian when ({\mathrm{\Gamma}},\le ) is positively totally ordered. As corollaries, we give equivalent conditions for the rings D+({X}_{1},\ldots ,{X}_{n})E{[}{X}_{1},\ldots ,{X}_{n}] and D+({X}_{1},\ldots ,{X}_{n})I{[}{X}_{1},\ldots ,{X}_{n}] to be Noetherian.

SOME SUFFICIENT CONDITIONS OF LEARNABILITY IN THE LIMIT FROM POSITIVE DATA

2000 ◽  
Vol 11 (03) ◽  
pp. 515-524
Author(s):  
TAKESI OKADOME
Keyword(s):  
Sufficient Conditions ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Conditions For Learning ◽  
Positive Data ◽  
Necessary And Sufficient ◽  
Learning In The Limit

The paper deals with learning in the limit from positive data. After an introduction and overview of earlier results, we strengthen a result of Sato and Umayahara (1991) by establishing a necessary and sufficient condition for the satisfaction of Angluin's (1980) finite tell-tale condition. Our other two results show that two notions introduced here, the finite net property and the weak finite net property, lead to sufficient conditions for learning in the limit from positive data. Examples not solvable by earlier methods are also given.

scholarly journals Bipartite graphs with close domination and k-domination numbers

2020 ◽  
Vol 18 (1) ◽  
pp. 873-885
Author(s):  
Gülnaz Boruzanlı Ekinci ◽  
Csilla Bujtás
Keyword(s):  
Positive Integer ◽  
Dominating Set ◽  
Domination Number ◽  
Bipartite Graphs ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Minimum Cardinality ◽  
Vertex Set ◽  
Necessary And Sufficient ◽  
The Given

Abstract Let k be a positive integer and let G be a graph with vertex set V(G) . A subset D\subseteq V(G) is a k -dominating set if every vertex outside D is adjacent to at least k vertices in D . The k -domination number {\gamma }_{k}(G) is the minimum cardinality of a k -dominating set in G . For any graph G , we know that {\gamma }_{k}(G)\ge \gamma (G)+k-2 where \text{&#x0394;}(G)\ge k\ge 2 and this bound is sharp for every k\ge 2 . In this paper, we characterize bipartite graphs satisfying the equality for k\ge 3 and present a necessary and sufficient condition for a bipartite graph to satisfy the equality hereditarily when k=3 . We also prove that the problem of deciding whether a graph satisfies the given equality is NP-hard in general.

scholarly journals Equipartitioning and balancing points of polygons

Pythagoras ◽  
2010 ◽  
Vol 0 (71) ◽  
Author(s):  
Shunmugam Pillay ◽  
Poobhalan Pillay
Keyword(s):  
General Theorem ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
The Other ◽  
Sufficient Condition ◽  
Centre Of Mass ◽  
Necessary And Sufficient Condition ◽  
Necessary And Sufficient

The centre of mass G of a triangle has the property that the rays to the vertices from G sweep out triangles having equal areas. We show that such points, termed equipartitioning points in this paper, need not exist in other polygons. A necessary and sufficient condition for a quadrilateral to have an equipartitioning point is that one of its diagonals bisects the other. The general theorem, namely, necessary and sufficient conditions for equipartitioning points for arbitrary polygons to exist, is also stated and proved. When this happens, they are in general, distinct from the centre of mass. In parallelograms, and only in them, do the two points coincide.

scholarly journals Solvability of a Bounded Parametric System in Max-Łukasiewicz Algebra

Mathematics ◽  
2020 ◽  
Vol 8 (6) ◽  
pp. 1026 ◽  
Author(s):  
Martin Gavalec ◽  
Zuzana Němcová
Keyword(s):  
Linear System ◽  
Fuzzy Systems ◽  
Polynomial Algorithm ◽  
Sufficient Conditions ◽  
Recognition Algorithm ◽  
Triangular Norm ◽  
Binary Operations ◽  
Interval Coefficients ◽  
Necessary And Sufficient ◽  
The Given

The max-Łukasiewicz algebra describes fuzzy systems working in discrete time which are based on two binary operations: the maximum and the Łukasiewicz triangular norm. The behavior of such a system in time depends on the solvability of the corresponding bounded parametric max-linear system. The aim of this study is to describe an algorithm recognizing for which values of the parameter the given bounded parametric max-linear system has a solution—represented by an appropriate state of the fuzzy system in consideration. Necessary and sufficient conditions of the solvability have been found and a polynomial recognition algorithm has been described. The correctness of the algorithm has been verified. The presented polynomial algorithm consists of three parts depending on the entries of the transition matrix and the required state vector. The results are illustrated by numerical examples. The presented results can be also applied in the study of the max-Łukasiewicz systems with interval coefficients. Furthermore, Łukasiewicz arithmetical conjunction can be used in various types of models, for example, in cash-flow system.

scholarly journals Sufficient conditions for matchings

1972 ◽  
Vol 18 (2) ◽  
pp. 129-136 ◽  
Author(s):  
Ian Anderson
Keyword(s):  
Simple Proof ◽  
Perfect Matching ◽  
Sufficient Conditions ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Number Of Components ◽  
Image Position ◽  
Necessary And Sufficient

A graph G is said to possess a perfect matching if there is a subgraph of G consisting of disjoint edges which together cover all the vertices of G. Clearly G must then have an even number of vertices. A necessary and sufficient condition for G to possess a perfect matching was obtained by Tutte (3). If S is any set of vertices of G, let p(S) denote the number of components of the graph G – S with an odd number of vertices. Then the conditionis both necessary and sufficient for the existence of a perfect matching. A simple proof of this result is given in (1).

scholarly journals Impulsive controllability of linear dynamical systems with applications to maneuvers of spacecraft

1996 ◽  
Vol 2 (4) ◽  
pp. 277-299 ◽  
Author(s):  
Xinzhi Liu ◽  
Allan R. Willms
Keyword(s):  
Dynamical Systems ◽  
Discrete Time ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Linear Dynamical Systems ◽  
Novel Approach ◽  
Necessary And Sufficient

Necessary and sufficient conditions for impulsive controllability of linear dynamical systems are obtained, which provide a novel approach to problems that are basically defined by continuous dynamical systems, but on which only discrete-time actions are exercised. As an application, impulsive maneuvering of a spacecraft is discussed.

Sign in / Sign up

Export Citation Format

Share Document