On the distributed stable full information H∞ minimax problem

We study the distributed parameter suboptimal full information H^∞ problem for a stable well-posed linear system with control u, disturbance w, state x, and output y. Here u, w, and y are L²-signals on (0,∞) with values in the Hilbert spaces U, W, and Y, and the state x is a continuous function of time with values in the Hilbert space H. The problem is to determine if there exists a (dynamic) γ-suboptimal feedforward compensator, i.e., a compensator 𝒰 such that the choice u = 𝒰w makes the norm of the input/output map from w to y less than a given constant γ. A sufficient condition for the existence of a γ-suboptimal compensator is that an appropriately extended input/output map of the system has a (J,S)-inner–outer factorization of a special type, and if the control and disturbance spaces are finite-dimensional and the system has an L¹ impulse response, then this condition is also necessary. Moreover, in this case there exists a central state feedback/feedforward controller, which can be used to give a simple parameterization of the set of all γ-suboptimal compensators. Our proof use a game theory approach. © 1998 John Wiley & Sons, Ltd.     

Backstepping boundary control of Burgers’ equation with actuator dynamics

In this paper, we propose a backstepping boundary control law for Burgers’ equation with actuator dynamics. While the control law without actuator dynamics depends only on the signals u(0,t) and u(1,t), the backstepping control also depends on u_x(0,t), u_x(1,t), u_xx(0,t) and u_xx(1,t), making the regularity of the control inputs the key technical issue of the paper. With elaborate Lyapunov analysis, we prove that all these signals are sufficiently regular and the closed-loop system, including the boundary dynamics, is globally H³ stable and well posed.     

Some new paranormed sequence spaces

Maddox defined the sequence spaces ℓ_∞(p), c(p) and c₀(p) in [Proc. Camb. Philos. Soc. 64 (1968) 335, Quart. J. Math. Oxford (2) 18 (1967) 345]. In the present paper, the sequence spaces a₀^r(u,p) and a_c^r(u,p) of non-absolute type have been introduced and proved that the spaces a₀^r(u,p) and a_c^r(u,p) are linearly isomorphic to the spaces c₀(p) and c(p), respectively. Besides this, the α-, β- and γ-duals of the spaces a₀^r(u,p) and a_c^r(u,p) have been computed and their basis have been constructed. Finally, a basic theorem has been given and later some matrix mappings from a₀^r(u,p) to the some sequence spaces of Maddox and to some new sequence spaces have been characterized.     

On Clark and Suen bound-type results for k-domination and Roman domination of Cartesian product graphs

A set S of vertices of a graph G is a dominating set for G if every vertex of G is adjacent to at least one vertex of S. The domination number γ(G), of G, is the minimum cardinality of a dominating set in G. Moreover, if the maximum degree of G is Δ, then for every positive integer k≤Δ, the set S is a k-dominating set in G if every vertex outside of S is adjacent to at least k vertices of S. The k-domination number of G, denoted by γ _k (G), is the minimum cardinality of a k-dominating set in G. A map f: V→<texlscub>0, 1, 2</texlscub>is a Roman dominating function for G if for every vertex v with f(v)=0, there exists a vertex u∈N(v) such that f(u)=2. The weight of a Roman dominating function is f(V)=∑ _u∈V f(u). The Roman domination number γ_R(G), of G, is the minimum weight of a Roman dominating function on G. In this paper, we obtain that for any two graphs G and H, the k-domination number of the Cartesian product of G and H is bounded below by γ(G)γ _k (H)/2. Also, we obtain that the domination number of Cartesian product of G and H is bounded below by γ(G)γ_R(H)/3.     

On the rate of convergence of 2-term recursions in ℝ d

LetG be a compact set in ℝ ^d d≥1,M=G×G andϕ:M →G a map inC ₃(M). Suppose thatϕ has a fixed pointξ, i.e.ϕ(ξ, ξ)=ξ. We investigate the rate of convergence of the iterationx ⁿ⁺²=φ(x ⁿ⁺¹,x ⁿ) withx ⁰,x ¹∈G andx ⁿ→ξ. Iff _n=Q‖x ⁿ−ξ‖ with a suitable norm and a constantQ depending onξ, an exact representation forf _n is derived. The error terms satisfyf _2m+1≍(ƒ_2m)^γ,f _2m+2≍(ƒ_2m+1)^2γ,m≥0, with 1<gg<2, andγ=γ(x ¹,x ⁰). According to our main result we have lim_n→∞{‖x ⁿ⁺²‖/(‖x ⁿ‖)²}=Q, 0<Q<∞. This paper constitutes an extension of a part of the author’s doctoral thesis realized under the direction of Prof. E. Wirsing and Prof. A. Peyerimhoff, University of Ulm (Germany).     

H ∞ Optimal control

Our aim in this paper is to develop a new approach for solving the H ^∞ optimal control problem where the feedback arrangement takes the form of a linear fractional transformation. The paper is in two parts. In Part 1, a basic kind of model-matching problem is considered: given rational matrices M(s) and N(s), the H ^∞-norm of an error function defined as E(s)=M(s) – N(s)Q(s) is minimized (or bounded) subject to E(s) and Q(s) being stable. Closed-form state-space characterizations are obtained for both E(s) and Q(s). The results established here will be used in Part 2 of the paper (Hung 1989) to solve the H ^∞ optimal control problem.     

Approximate Solutions of Polynomial Equations

In this paper, we introduce “approximate solutions" to solve the following problem: given a polynomial F(x, y) over Q, where x represents an n -tuple of variables, can we find all the polynomials G(x) such that F(x, G(x)) is identically equal to a constant c in Q ? We have the following: let F(x, y) be a polynomial over Q and the degree of y in F(x, y) be n. Either there is a unique polynomial g(x)  ∈ Q [ x ], with its constant term equal to 0, such that F(x, y)  = ∑_j = 0ⁿc_j(y − g(x))^jfor some rational numbers c_j, hence, F(x, g(x)  + a)  ∈ Q for all a ∈ Q, or there are at most t distinct polynomials g₁(x),⋯ , g_t(x), t ≤ n, such that F(x, g_i(x))  ∈ Q for 1  ≤ i ≤ t. Suppose that F(x, y) is a polynomial of two variables. The polynomial g(x) for the first case, or g₁(x),⋯ , g_t(x) for the second case, are approximate solutions of F(x, y), respectively. There is also a polynomial time algorithm to find all of these approximate solutions. We then use Kronecker’s substitution to solve the case of F(x, y).     

Robust stabilisation of nonlinear plants via left coprime factorizations

In this paper we take steps towards the development of a robust stabilization theory for nonlinear plants. An approach using the left coprime factorizations of the plant and controller under certain differential boundedness assumptions is used. We first focus attention on a characterization of the class of all stabilizing nonlinear controllers K_Q for a nonlinear plant G, parameterized in terms of an arbitrary stable (nonlinear) operator Q. Also, we consider the dual class of all plants G_S stabilized by a given nonlinear controller K and parameterized in terms of an arbitrary stable (nonlinear) operator S. We show that a necessary and sufficient condition for K_Q to stabilize G_S with Q, S not necessarily stable, is that S stabilizes Q. This robust stabilization result is of interest for the solution of problems in the areas of nonlinear adaptive control and simultaneous stabilization. It specializes to known results for linear operators.     

Sufficient conditions for the existence and asymptotic behaviour of solution to a quasi-linear elliptic problem

In this article, we combine the existing regularity theory, perturbation method and the lower and upper solutions method to study the existence and asymptotic behaviour of positive solution to a boundary value problem for the p-Laplacian operator. More exactly, we study the existence and asymptotic behaviour of the positive solution to a quasi-linear elliptic problem of the form?Δ _p u=λ a(x)g(u) in D′(Ω), u>0 in Ω, lim _{x→? Ω} u(x)=0. Under some conditions on a and g, we show that there is a non-negative number Λ₀ such that for all λ∈(0, Λ₀], the problem has a solution u _λ in the sense of distribution, which is bounded from above by some positive numbers μ(λ). Such estimates and the asymptotic behaviour are important in computer programs when we know an algorithm for determining the solution.     

Construction of superoptimal approximants

LetG be a matrix function of type m×n and suppose thatG is expressible as the sum of anH ^∞ function and a continuous function on the unit circle. Then it is known that there is a unique superoptimal approximant toG inH ^∞: that is, there is a unique analytic matrix functionQ in the open unit disc which minimizess ^∞(G?Q) or, in other words, which minimizes the sequence $$(s_0^\infty (G - Q),s_1^\infty (G - Q),s_2^\infty (G - Q), \ldots )$$ with respect to the lexicographic ordering, wheres _j ^∞ (F)=sup _x∈ s _j (F(z)) ands _j (·) denotes thejth singular value of a matrix. We give a function-theoretic (frequency domain) algorithm for the construction of this approximant. We calculate an example to illustrate the algorithm. The construction works for rationalG, but is also valid for non-rational functions. It is based on the authors' uniqueness proof in [PY1], but contains extra ingredients required to render it practicable, notably one which obviates the need for the preliminary solution of a Nehari problem. We also establish a formula forQ in terms of the maximizing vectors of a sequence of Hankel-type operators.     

Adaptive robust control of nonholonomic systems with stochastic disturbances

Based on the Brockett’s necessary condition for feedback asymptotic stabilization[1], nonholonomic systems fail to be stabilized at the origin by any static continuous state feedback though they are open loop controllable. There are two novel approaches …     

Generation of robust root loci for linear systems with parametric uncertainties in an ellipsoid

Given a parametric polynomial family p(s; Q) := {ⁿ _k=0 a_k (q)s^k : q ] Q}, Q R ^m , the robust root locus of p(s; Q) is defined as the two-dimensional zero set _p,Q := {s ] C:p(s; q) = 0 for some q ] Q}. In this paper we are concerned with the problem of generating robust root loci for the parametric polynomial family p(s; E) whose polynomial coefficients depend polynomially on elements of the parameter vector q ] E which lies in an m-dimensional ellipsoid E. More precisely, we present a computational technique for testing the zero inclusion/exclusion of the value set p(z; E) for a fixed point z in C, and then apply an integer-labelled pivoting procedure to generate the boundary of each subregion of the robust root locus _p,E . The proposed zero inclusion/exclusion test algorithm is based on using some simple sufficient conditions for the zero inclusion and exclusion of the value set p(z,E) and subdividing the domain E iteratively. Furthermore, an interval method is incorporated in the algorithm to speed up the process of zero inclusion/exclusion test by reducing the number of zero inclusion test operations. To illustrate the effectiveness of the proposed algorithm for the generation of robust root locus, an example is provided.     

New explicit filters and smoothers for diffusions with nonlinear drift and measurements

The optimal least-squares filtering of a diffusion x(t) from its noisy measurements {y(τ); 0 τ t} is given by the conditional mean E[x(t)|y(τ); 0 τ t]. When x(t) satisfies the stochastic diffusion equation dx(t) = f(x(t)) dt + dw(t) and y(t) = ∫₀^tx(s) ds + b(t), where f(·) is a global solution of the Riccati equation /xf(x) + f(x)² = f(x)² = αx² + βx + γ, for some , and w(·), b(·) are independent Brownian motions, Benes gave an explicit formula for computing the conditional mean. This paper extends Benes results to measurements y(t) = ∫₀^tx(s) ds + ∫₀^t dx(s) + b(t) (and its multidimensional version) without imposing additional conditions on f(·). Analogous results are also derived for the optimal least-squares smoothed estimate E[x(s)|y(τ); 0 τ t], s < t. The methodology relies on Girsanov's measure transformations, gauge transformations, function space integrations, Lie algebras, and the Duncan-Mortensen-Zakai equation.     

A simple nc algorithm to recognize weakly triangulated graphs

Let S be a set of n closed intervals on the x-axis. A ranking assigns to each interval, s, a distinct rank, p(s)? [1, 2,…,n]. We say that s can see t if p(s)<p(t) and there is a point p?s∩t so that p?u for all u with p(s)<p(u)<p(t). It is shown that a ranking can be found in time O(n log n) such that each interval sees at most three other intervals. It is also shown that a ranking that minimizes the average number of endpoints visible from an interval can be computed in time O(n ^5/2). The results have applications to intersection problems for intervals, as well as to channel routing problems which arise in layouts of VLSI circuits.     

Filtering of some nonlinear diffusions satisfying the general Bene condition

Under some regularity assumptions and the following generalization of the well-known Bene condition [1]:

Full-size image

, where F(t,z) = g⁻²(t)∫f(t,z)dz, F_t, F_z, F_zz, are partial derivatives of F, we obtain explicit formulas for the unnormalized conditional density q_t(z, x) α Px_t ε dz| y_s, 0 st, where diffusion x_t on R¹ solves x₀ = x, dx_t = [β(t) + α(t)x_t + f(t, x_t] dt + g(t) dw₁, and observation y_t = ∫_o^th(s)x_s ds + ∫_o^t(s) dw_2t, with w = (w₁, w₂) a two-dimensional Wiener process.     

Local colourings of Cartesian product graphs

A local colouring of a graph G is a function c: V(G)→? such that for each S ? V(G), 2≤|S|≤3, there exist u, v∈S with |c(u)?c(v)| at least the number of edges in the subgraph induced by S. The maximum colour assigned by c is the value χ_?(c) of c, and the local chromatic number of G is χ_?(G)=min {χ_?(c): c is a local colouring of G}. In this note the local chromatic number is determined for Cartesian products G □ H, where G and GH are 3-colourable graphs. This result in part corrects an error from Omoomi and Pourmiri [On the local colourings of graphs, Ars Combin. 86 (2008), pp. 147–159]. It is also proved that if G and H are graphs such that χ(G)≤? χ_?(H)/2 ?, then χ_?(G □ H)≤χ_?(H)+1.     

Il metodo di Treffiz-Fichera per i semigruppi. potenziale di tipo potenza

A variation of the Trefftz-Fichera method is presented to compute lower bounds for the eigenvalues of a positive self-adjoint operator with discrete spectrum with grow at least in a logarithmic way as the index diverges. As suggested by Barnes et al. [2] to compute ground state, the semigroupe ^−βH, β>0, is used rather than the iterated resolvent(H+β) ⁻ⁿ,n=1,2,... As an example, the method is applied to the operatorH=−Δ+|x|^γ. inL ²(R), 1≤γ≤4.      

Robustness of a discrete dynamical process with a given set of attainability

A linear discrete system x ^{(k +1)} = A x ^(k) with a given set of attainability (c, x( ^N)) ≥ c ₀ is considered. The influence of small variations of problem parameters on the attainability of a required set is investigated. For the control system x ^(k+1) = Ax ^(k) + Bu ^(k), the choice of a controller as a feedback in state u(k) = Kx ^(k) is studied.     

Stabilization of a class of generalized bilinear systems

This paper studies local stabilization of a class of analytic nonlinear systems in terms of, which includes ordinary bilinear systems as its subset, ż=f(z)+g(z)u, f(0)=0, g(0)=0, z∈R² which can be achieved via a feedback control law u=u(z) with u(0)=0. Following the theoretical results a potential application, stabilization of non-minimum phase systems, is investigated. Copyright © 1999 John Wiley & Sons, Ltd.