Algorithm of robust stability region for interval plant with time delay using fractional order PID controller

By using PI^λD^μ controller, we investigate the problem of computing the robust stability region for interval plant with time delay. The fractional order interval quasi-polynomial is decomposed into several vertex characteristic quasi-polynomials by the lower and upper bounds, in which the value set of the characteristic quasi-polynomial for vertex quasi-polynomials in the complex plane is a polygon. The D-decomposition technique is used to characterize the stability boundaries of each vertex characteristic quasi-polynomial in the space of controller parameters. We investigate how the fractional integrator order λ and the derivative order μ in the range (0, 2) affect the stabilizability of each vertex characteristic quasi-polynomial. The stability region of interval characteristic quasi-polynomial is determined by intersecting the stability region of each quasi-polynomial. The parameters of PI^λD^μ controller are obtained by selecting the control parameters from the stability region. Using the value set together with zero exclusion principle, the robust stability is tested and the algorithm of robust stability region is also proposed. The algorithm proposed here is useful in analyzing and designing the robust PI^λD^μ controller for interval plant. An example is given to show how the presented algorithm can be used to compute all the parameters of a PI^λD^μ controller which stabilize a interval plant family.     

On Symmetric Cubature Formulae for Planar Regions

This paper is concerned with , D_m-symmetric, cubature formulaefor D_m-symmetric planar regions of integration, D_m being thedihedral group of order 2m, that is, the symmetry group of aregular polygon with m edges. A unified theory for the analysisof this kind of formula set is introduced. This theory arisesfrom the identification of the space of all polynomials thatare invariant with respect to the symmetry group D_m. The typeof analysis used leads to a simple method for constructing thiskind of cubature formula set, even when a high degree of polynomialprecision is required.     

A Class of Pencils of Matrices

A linear machine is one in which the time dependent input yis related to the output z by P(D). z = S(D). y where P andS are polynomials in D = d/dt with constant coefficients. Fornumerical computation it is necessary to replace this relationby a set of simultaneous first order differential equationsand this paper shows how to construct such equations by methodswhich extend the results of Gilder (1961). Attention is restrictedto those sets of equations that are of a special form (see (1))which is characterized by the matrix operating on the dependentvariables. This matrix forms a pencil, being linear in D, andthree theorems are given to show how such matrix pencils maybe constructed from the polynomials. The theorems also statethat any matrix pencil with the required properties can be transformedinto the canonical forms given in the theorems by pre- and post-multiplicationby suitable constant non-singular matrices. Thus the variablesof any set of equations having the required properties are linearcombinations of the variables of the equations given by thetheorems. In the paper it is assumed that the degree of P(D)is greater than that of S(D), as otherwise z would be replacedby z₁+Q(D) . y, where Q is the quotient of S(D)/P(D). Also,as the algebriac manipulations are independent of the natureof the polynomials, D is replaced by an indeterminate x andthe coefficients considered to be from an arbitrary field. Fortechnical reasons we rename y and z, y_o and y_n–_m respectively.     

An Upper Bound for List T-Colourings

Erds, Rubin and Taylor showed in 1979 that for any connectedgraph G which is not a complete graph or an odd cycle, ch(G) , where is the maximum degree of a vertex in G and ch(G) isthe choice number of the graph (also proved by Vizing in 1976).They also gave a characterisation of D-choosability. A graphG is D-choosable if, when we assign to each vertex v of G alist containing d(v) elements, where d(v) is the degree of vertexv, we can always choose a proper vertex colouring from theselists, however the lists were chosen. In this paper we shallgeneralise their results on the choice number of G and D-choosabilityto the case where we have T-colourings.     

Zero-Mean Cosine Polynomials which are Non-Negative for as Long as Possible

For a given integer n, all zero-mean cosine polynomials of orderat most n which are non-negative on [0,(n/(n+1))] are found,and it is shown that this is the longest interval [0,] on whichsuch cosine polynomials exist. Also, the longest interval [0,]on which there is a non-negative zero-mean cosine polynomialwith non-negative coefficients is found. As an immediate consequence of these results, the correspondingproblems of the longest intervals [,] on which there are non-positivecosine polynomials of degree n are solved. For both of these problems, all extremal polynomials are found.Applications of these polynomials to Diophantine approximationare suggested.     

A discrete Galerkin method for a hyperslngular boundary integral equation

Received on 14 August 1995. Revised on 20 August 1996. Consider solving the interior Neumann problem with D a simply-connected planar region and S=D a smooth curve.A double-layer potential is used to represent the solution,and it leads to the problem of solving a hypersingular integralequation. This integral equation is reformulated as a Cauchysingular integral equation. A discrete Galerkin method withtrigonometric polynomials is then given for its solution. Anerror analysis is given, and numerical examples complete thepaper.     

Stable multivariate W-Eulerian polynomials

We prove a multivariate strengthening of Brenti?s result that every root of the Eulerian polynomial of type B is real. Our proof combines a refinement of the descent statistic for signed permutations with the notion of real stability—a generalization of real-rootedness to polynomials in multiple variables. The key is that our refined multivariate Eulerian polynomials satisfy a recurrence given by a stability-preserving linear operator.Our results extend naturally to colored permutations, and we also give stable generalizations of recent real-rootedness results due to Dilks, Petersen, and Stembridge on affine Eulerian polynomials of types A and C. Finally, although we are not able to settle Brenti?s real-rootedness conjecture for Eulerian polynomials of type D, nor prove a companion conjecture of Dilks, Petersen, and Stembridge for affine Eulerian polynomials of types B and D, we indicate some methods of attack and pose some related open problems.     

Similarity Solutions of a Non-linear Diffusion Equation

In several physical contexts the equations for the dispersionof a buoyant contaminant can be approximated by the Erdogan-Chatwin(1967) equation {dot}c = {dot}_y{[D_o + ({dot}_yc)²D₂]{dot}_yc}. Here it is shown that in the limit of strong non-linearity (i.e.D_o = 0) there are similarity solutions for a concentration jumpand for a finite discharge. A stability analysis for the latterproblem involves a new family of orthogonal polynomials Y_n(z)where (1 – z⁴)Y – 6z³Y + n(n + 5)z² Y_n = 0 and the degree n is restricted to the values 0, 1, 4, 5, 8,9,.... A numerical solution of the Erdogan-Chatwin equationis given which describes the transition between the non-linearand linear (Gaussian) similarity solutions.     

Determinative Vertices of Interval Family with Ωθ-Stability

In this article, we pay attention to the stability of interval polynomials with regard to the Ω_θ region. An analysis on how to generate the finite set, whose stability implies robust stability of the entire family, is given. Those results are intuitive and convenient to operate.     

结构摄动下多项式的鲁棒稳定性

本文对与Ｋｈａｒｉｔｏｎｏｖ多项多族相对偶的菱形族式项式的一类结构摄动下的鲁棒稳定性进行了详细的研究，提出了在此结构摄动下，菱形族形族多项式稳定当且仅当检验有限个顶点多项式或有限个边多项式的稳定性定理，而菱形族定量只是本定理的推论，另外，对低阶多项式族进行了讨论。     

Some results related to Hurwitz stability of combinatorial polynomials

Many important problems are closely related to the zeros of certain polynomials derived from combinatorial objects. The aim of this paper is to observe some results and applications for the Hurwitz stability of polynomials in combinatorics and study other related problems.We first present a criterion for the Hurwitz stability of the Turán expressions of recursive polynomials. In particular, it implies the q-log-convexity or q-log-concavity of the original polynomials. We also give a criterion for the Hurwitz stability of recursive polynomials and prove that the Hurwitz stability of any palindromic polynomial implies its semi-γ-positivity, which illustrates that the original polynomial with odd degree is unimodal. In particular, we get that the semi-γ-positivity of polynomials implies their parity-unimodality and the Hurwitz stability of polynomials implies their parity-log-concavity. Those results generalize the connections between real-rootedness, γ-positivity, log-concavity and unimodality to Hurwitz stability, semi-γ-positivity, parity-log-concavity and parity-unimodality (unimodality). As applications of these criteria, we derive some Hurwitz stability results occurred in the literature in a unified manner. In addition, we obtain the Hurwitz stability of Turán expressions for alternating run polynomials of types A and B and the Hurwitz stability for alternating run polynomials defined on a dual set of Stirling permutations.Finally, we study a class of recursive palindromic polynomials and derive many nice properties including Hurwitz stability, semi-γ-positivity, non-γ-positivity, unimodality, strong q-log-convexity, the Jacobi continued fraction expansion and the relation with derivative polynomials. In particular, these properties of the alternating descents polynomials of types A and B can be implied in a unified approach.     

Seifert surfaces in open books, and a new coding algorithm for links

We show that for any link L, there exists a Seifert surfacefor L that is obtained by successively plumbing flat annulito a disk D, where the gluing regions are all in D. This furnishesa new way of coding links. We also present an algorithm to readthe code directly from a braid presentation.     

Some Characterizations of Commutative Subspace Lattices

Let H be a not necessarily separable Hilbert space, and letBH denote the space of all bounded linear operators on H. Itis proved that a commutative lattice D of self-adjoint projectionsin H that contains 0 and I is spatially complete if and onlyif it is a closed subset of BH in the strong operator topology.Some related results are obtained concerning commutative lattice-orderedcones of self-adjoint operators that contain D. 2000 MathematicsSubject Classification 47D03, 47L35, 47L07, 46L10, 54F05, 54G05,46E05.     

Strong Asymmetric Digraphs with Prescribed Interior and Annulus

The directed distance d(u,v) from u to v in a strong digraph D is the length of a shortest u-v path in D. The eccentricity e(v) of a vertex v in D is the directed distance from v to a vertex furthest from v in D. The center and periphery of a strong digraph are two well known subdigraphs induced by those vertices of minimum and maximum eccentricities, respectively. We introduce the interior and annulus of a digraph which are two induced subdigraphs involving the remaining vertices. Several results concerning the interior and annulus of a digraph are presented.     

Fixed and Minimal Order Compensators

Given a time-invariant linear plant, the authors consider aminimal (or fixed) order compensator such that the (unity feedback)closed loop is stable with respect to a given region in thecomplex plane. The so-called critical constraint is used tofind points in the (parameter space) stability region. Thisenables some practical constraints to be added in the compensatordesign.     

The density of prime divisors in the arithmetic dynamics of quadratic polynomials

Let f [x], and consider the recurrence given by a_n = f(a_{n –1}), with a₀ . Denote by P(f, a₀) the set of prime divisorsof this recurrence, that is, the set of primes dividing at leastone non-zero term, and denote the natural density of this setby D(P(f, a₀)). The problem of determining D(P(f, a₀)) whenf is linear has attracted significant study, although it remainsunresolved in full generality. In this paper, we consider thecase of f quadratic, where previously D(P(f, a₀)) was knownonly in a few cases. We show that D(P(f, a₀)) = 0 regardlessof a₀ for four infinite families of f, including f = x² + k,k \{–1}. The proof relies on tools from group theoryand probability theory to formulate a sufficient condition forD(P(f, a₀)) = 0 in terms of arithmetic properties of the forwardorbit of the critical point of f. This provides an analogy toresults in real and complex dynamics, where analytic propertiesof the forward orbit of the critical point have been shown todetermine many global dynamical properties of a quadratic polynomial.The article also includes apparently new work on the irreducibilityof iterates of quadratic polynomials.     

On strong digraphs with a prescribed ultracenter

The (directed) distance from a vertex u to a vertex v in a strong digraph D is the length of a shortest u-v (directed) path in D. The eccentricity of a vertex v of D is the distance from v to a vertex furthest from v in D. The radius radD is the minimum eccentricity among the vertices of D and the diameter diamD is the maximum eccentricity. A central vertex is a vertex with eccentricity radD and the subdigraph induced by the central vertices is the center C(D). For a central vertex v in a strong digraph D with radD < diamD, the central distance c(v) of v is the greatest nonnegative integer n such that whenever d(v, x) n, then x is in C(D). The maximum central distance among the central vertices of D is the ultraradius uradD and the subdigraph induced by the central vertices with central distance uradD is the ultracenter UC(D). For a given digraph D, the problem of determining a strong digraph H with UC(H) = D and C(H) D is studied. This problem is also considered for digraphs that are asymmetric.     

On the absolute stability of multi-nonlinear control systems in the critical cases

In this paper, we study the absolute stability of stationarymulti-nonlinear control systems in critical cases via a Liapunovfunction V of Lur type. Some necessary conditions are givenfor the existence of a Liapunov function. For systems for whichthe stability can be studied by using Lur-type functions, wegive the normal form, construct the optimal V function for thesystem, and present some (algebraic) criteria for absolute stability.     

A division theorem for real analytic functions

We characterize those homogeneous polynomials P [z₁, ... ,z_d] for which the principal ideal (P) = P · A(^d) is complementedin A(^d) or, equivalently, those which admit a continuous lineardivision operator. The condition is the same as that which characterizes,among the homogeneous polynomials, those which are nonellipticand for which P(D) is surjective in A(^d), and those for whichP(D) admits a continuous linear right inverse in C(^d). It dependsonly on the type of real singularities.