Search

We solve the problem of regulating the output of the Pan system (2010), which is one of the recently discovered three-dimensional chaotic attractors. Pan system has many interesting complex dynamical behaviours, and it has potential applications in secure communication. In this paper, we construct explicit state feedback control laws for regulating the output of the Pan system so as to track constant reference signals. The state feedback control laws are derived using the regulator equations of Byrnes and Isidori (1990). The simulation results are provided to illustrate the effectiveness of the regulation schemes derived for the output regulation of the Pan system. [ABSTRACT FROM AUTHOR]

This paper provides some relations between the idempotent operators and the solutions to operator equations and A B A = A² and B A B = B². [ABSTRACT FROM AUTHOR]

This paper presents a general and comprehensive description of Optimization Methods, and Algorithms from a novel viewpoint. It is shown, in particular, that Direct Methods, Iterative Methods, and Computer Science Algorithms belong to a well-defined general class of both Finite and Infinite Procedures, characterized by suitable descent directions. [ABSTRACT FROM AUTHOR]

The aim of this paper is to introduce the concept of regional exponential observability in connection with the strategic sensors. Then, we give characterization of such sensors in order that regional exponential observability can be achieved. The obtained results are applied to two-dimensional systems, and various cases of sensors are considered. We also show that there exists a dynamical system for diffusion system which is not exponentially observable in the usual sense but it may be regionally exponentially observable. [ABSTRACT FROM AUTHOR]

We establish several sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems from a view point of generalized convexity. Subsequently, these optimality criteria are utilized as a basis for constructing dual models, and certain duality results have been derived in the framework of generalized convex functions. Our results extend and unify some known results on minimax fractional programming problems. [ABSTRACT FROM AUTHOR]

A simple and efficient algorithm for finding the GCD of a pair of univariate polynomials is derived. The process requires only successive subtraction of two monic polynomials. Amazingly, this approach gives the desired GCD for a pair of test polynomials of very high degree, such as (x + 1)⋀ 1000 and its derivative. [ABSTRACT FROM AUTHOR]

It is often said that Brouwer's fixed point theorem cannot be constructively proved. On the other hand, Sperner's lemma, which is used to prove Brouwer's theorem, can be constructively proved. Some authors have presented a constructive (or an approximate) version of Brouwer's fixed point theorem using Sperner's lemma. They, however, assume uniform continuity of functions. We consider uniform sequential continuity of functions. In classical mathematics, uniform continuity and uniform sequential continuity are equivalent. In constructive mathematics a la Bishop, however, uniform sequential continuity is weaker than uniform continuity. We will prove a constructive version of Brouwer's fixed point theorem in an n-dimensional simplex for uniformly sequentially continuous functions. We follow the Bishop style constructive mathematics. [ABSTRACT FROM AUTHOR]

If G is a simple connected graph with vertex V (G), then the eccentric distance sum of G, denoted by ξd (G), is defined as ∑v∈V(G)ecG(v)DG(v), where ecG(v) is the eccentricity of the vertex v and DG(v) is the sum of all distances from the vertex v. Let n ≥ 8.We determine the n-vertex trees with, respectively, the maximum, second-maximum, third-maximum, and fourth-maximum eccentric distance sums. We also characterize the extremal unicyclic graphs on n vertices with respectively, the maximal, second maximal, and third maximal eccentric distance sums. [ABSTRACT FROM AUTHOR]

The sine-cosine method and the extended tanh method are used to construct exact solitary patterns solution and compactons solutions of the generalized (2+1)-dimensional Boussinesq equation. The compactons solutions and solitary patterns solutions of the generalized 21- dimensional Boussinesq equation are successfully obtained. These solutions may be important and of significance for the explanation of some practical physical problems. It is shown that the sine-cosine and the extended tanh methods provide a powerful mathematical tool for solving great many nonlinear partial differential equations in mathematical physics. [ABSTRACT FROM AUTHOR]