A Posteriori Error Estimates and an Adaptive Finite Element Method for the Allen–Cahn Equation and the Mean Curvature Flow

This paper develops an a posteriori error estimate of residual type for finite element approximations of the Allen–Cahn equation u_t − Δu+ ε⁻² f(u)=0. It is shown that the error depends on ε⁻¹ only in some low polynomial order, instead of exponential order. Based on the proposed a posteriori error estimator, we construct an adaptive algorithm for computing the Allen–Cahn equation and its sharp interface limit, the mean curvature flow. Numerical experiments are also presented to show the robustness and effectiveness of the proposed error estimator and the adaptive algorithm.     

On the weighted sensitivity minimization problem for delay systems

We consider the H^∞-optimal sensitivity problem for delay systems. In particular, we consider computation of μ:= inf {|W-φq|_∞ : q ε H^∞(j )} where W(s) is any function in RH^∞(j ), and φ in H^∞(j ) is any inner function. We derive a new explicit solution in the pure delay case where φ = e^−sh, h > 0.     

An interpolation problem associated with H-optimal design in systems with distributed input lags

A variety of H^∞ optimal design problems reduce to interpolation of compressed multiplication operators, f(s) → π_k(w(s)f(s)), where w(s) is a given rational function and the subspace K is of the form K=H² φ(s)H². Here we consider φ(s) = (1-e^α-5)/(s - α), which stands for a distributed delay in a system's input. The interpolation scheme we develop, adapts to a broader class of distributed lags, namely, those determined by transfer functions of the form B(e^−s)/b(s), where B(z) and b(s) are polynomials and b(s) = 0 implies B(e^−s) = 0.     

Universal stabilization of a class of nonlinear systems with homogeneous vector fields

Under relative-degree-one and minimum-phase assumptions, it is well known that the class of finite-dimensional, linear, single-input (u), single-output (y) systems (A,b,c) is universally stabilized by the feedback strategy u = Λ(λ)y, λ = y², where Λ is a function of Nussbaum type (the terminology “universal stabilization” being used in the sense of rendering /s(0/s) a global attractor for each member of the underlying class whilst assuring boundedness of the function λ(·)). A natural generalization of this result to a class ^k of nonlinear control systems (a,b,c), with positively homogeneous (of degree k 1) drift vector field a, is described. Specifically, under the relative-degree-one (cb ≠ 0) and minimum-phase hypotheses (the latter being interpreted as that of asymptotic stability of the equilibrium of the “zero dynamics”), it is shown that the strategy u = Λ(λ)/vby/vb^k−1y, assures ^k-universal stabilization. More generally, the strategy u = Λ(λ)exp(/vby/vb)y, assures -universal stabilization, where = _{k 1} ^k.     

On computing the worst-case peak gain of linear systems

Based on the bounds due to Doyle and Boyd, we present simple upper and lower bounds for the l¹-norm of the ‘tail’ of the impulse response of finite-dimensional discrete-time linear time-invariant systems. Using these bounds, we may in turn compute the l^∞-gain of these systems to any desired accuracy. By combining these bounds with results due to Khammash and Pearson, we derive upper and lower bounds for the worst-case l^∞-gain of discrete-time systems with diagonal perturbations.     

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.     

An alternative solution to the H∞-optimal control problem

In this paper we present an alternative solution to the problem min _{X ε H^n×n∞} |A + BXC|_∞ where A, B, rmand C are rational matrices in H^n×n_∞. The solution circumvents the need to extract the matrix inner factors of B and C, providing a multivariable extension of Sarason's H^∞-interpolation theory [1] to the case of matrix-valued B(s) and C(s). The result has application to the diagonally-scaled optimization problem int |D(A + BXC)D⁻¹|_∞, where the infimum is over D, X εH^n×n_∞, D diagonal.     

The number of limit cycles for a family of polynomial systems

In this paper, the number of limit cycles in a family of polynomial systems was studied by the bifurcation methods. With the help of a computer algebra system (e.g., Maple 7.0), we obtain that the least upper bound for the number of limit cycles appearing in a global bifurcation of systems (2.1) and (2.2) is 5n + 5 + (1 − (−1)ⁿ)/2 for c ≠ 0 and n for c ≡ 0.     

Gas sensitivity of Zn doped α-Fe2O3(SO4, Sn, Zn) to carbon monoxide

It is shown that the doping of Zn and Sn can improve the gas sensitivity of α-Fe₂O₃-based sensing material to CO. X-ray photo-electron spectroscopy analysis suggests that this is mainly due to the fact that the simultaneous doping of Zn and Sn can increase the S and hence SO₄²⁻ contents in the α-Fe₂O₃(SO₄²⁻, Sn, Zn) sensing material. The results also suggest that under a given condition, the gas sensitivity of α-Fe₂O₃(SO₄²⁻, Sn, Zn) to CO can be optimised by properly adjusting the doped Zn content.     

Sample complexity of worst-case H-identification

We show that the sample complexity of qorst-case H^∞-identification is of order n², by proving that the minimal length of a fractional H^∞-cover for C_n, regarded as the linear space of complex-valued sequences of length n, is of order n². A unit vector u in ^∞ is a fractional H^∞-cover for C_n if for some

Full-size image

for all rh ε C_n, where is the z-transform of h. We also give similar results for real-valued sequences.     

On Complexity of Computation of Partial Derivatives of Boolean Functions Realized by Zhegalkin Polynomials

The combinational complexity of a system of partial derivatives in the basis of linear functions is established for a Boolean function of n variables that is realized by a Zhegalkin polynomial. An algorithm whose complexity equals 3ⁿ – 2ⁿ modulo 2 additions is proposed for computation of all partial derivatives of such a function from the coefficients of its Zhegalkin polynomial.     

A unified presentation of some classes of meromorphically multivalent functions

The authors introduce and investigate various properties of a general class

U_k[p,a,β,A,B]

p, k ε N {1, 2, 3,…,}; 0 α < p; β 0

;

−1 A < B 1; 0 < B 1)

,which unifies and extends several (known or new) subclasses of meromorphically multivalent functions. The properties and characteristics of this general class, which are presented here, include growth and distortion theorems; they also involve Hadamard products (or convolution) of functions belonging to the class U_k[p,α,β,A,B].     

H∞-state-feedback control of linear systems with small state delay

In this note, a H_∞ controller for systems with state delay is presented. For a prechosen γ the controller is obtained by solving Riccati partial differential inequalities (RPDIs). For small time delays, an asymptotic approximation of the controller is achieved by expanding the solution in powers of the delay. It is shown that a higher-order accuracy controller improves the performance. An example is brought where the results of the new method provide a satisfactory solution for a delay length comparable with the system ‘bandwidth’. The performance of the system under the zero-order accuracy controller, which corresponds to systems without delay, is studied. Explicit formula for the guaranteed performance level is obtained for the delay lengths that preserve the internal stability of the system.     

Nonlinear eigenvalue problems for quasilinear systems

The paper deals with the existence of positive solutions for the quasilinear system (Φ(u'))' + λh(t)f(u) = 0,0 < t < 1 with the boundary condition u(0) = u(1) = 0. The vector-valued function Φ is defined by Φ(u) = (q(t)(p(t)u₁), …, q(t)(p(t)u_n)), where u = (u₁, …, u_n), andcovers the two important cases (u) = u and (u) = up > 1, h(t) = diag[h₁(t), …, h_n(t)] and f(u) = (f¹(u), …, fⁿ (u)). Assume that fⁱ and h_i are nonnegative continuous. For u = (u₁, …, u_n), let

, f₀ = maxf¹₀, …, fⁿ₀ and f_∞ = maxf¹_∞, …, fⁿ_∞. We prove that the boundary value problem has a positive solution, for certain finite intervals of λ, if one of f₀ and f_∞ is large enough and the other one is small enough. Our methods employ fixed-point theorem in a cone.     

Algebraic Riccati equation and J-spectral factorization for estimation

In this paper we investigate on the existence of the stabilizing solution of the algebraic Riccati equation (ARE) related to the filtering problem with a prescribed attenuation level γ. It is well known that such a solution exists and is positive definite for γ larger than a certain γ_F and it does not exist for γ smaller than a certain γ₀. We consider the intermediate case γ(γ₀,γ_F] and show that in this interval the stabilizing solution does exist, except for a finite number of values of γ. We show how the solution of the ARE may be employed to obtain a minimum-phase J-spectral factor of the J-spectrum associated with the filtering problem.     

Perturbing Bézier coefficients for best constrained degree reduction in the L2-norm

This paper first shows how the Bézier coefficients of a given degree n polynomial are perturbed so that it can be reduced to a degree m (<n) polynomial with the constraint that continuity of a prescribed order is preserved at the two endpoints. The perturbation vector, which consists of the perturbation coefficients, is determined by minimizing a weighted Euclidean norm. The optimal degree n−1 approximation polynomial is explicitly given in Bézier form. Next the paper proves that the problem of finding a best L₂-approximation over the interval [0,1] for constrained degree reduction is equivalent to that of finding a minimum perturbation vector in a certain weighted Euclidean norm. The relevant weights are derived. This result is applied to computing the optimal constrained degree reduction of parametric Bézier curves in the L₂-norm.     

Single quantum dot-micelles coated with gemini surfactant for selective recognition of a cation and an anion in aqueous solutions

The synthesis of quantum dot coated with cetyltrimethyl ammonium bromide (CTAB) and gemini surfactant [C₁₂H₂₅N⁺(CH₃)₂(CH₂)₄(CH₃)₂N⁺C₁₂H₂₅]·2Br⁻ (C_12-4-12) in aqueous solution have been described. It is characterized by photoluminescent spectroscopy, UV–vis spectroscopy and transmission electron microscopy (TEM), etc. In comparison with CTAB-coated QDs, the QDs coated with C_12-4-12 respond selectively to both transition metal ion copper and fluoride ion in aqueous media. When Cu²⁺ is bound to C_12-4-12-coated QD micelles, the fluorescence intensity is quenched. Linear relationships are found between the relative fluorescence intensity and the concentration of Cu²⁺ in the range 0–500 μM, which is best described by a Stern–Volmer-type equation. Meanwhile, it is found that F⁻ enhanced the luminescence of the C_12-4-12-coated QD micelles in a concentration dependence that is described by a Langmuir binding isotherm equation in the range 0–300 μM. The limits of detection of Cu²⁺ and F⁻ are 1.1 and 0.68 μM, respectively. The possible mechanism is discussed.     

Some remarks on computing the square parts of integers

Let n be a positive integer, and suppose is its prime factorization. Let , so that n/θ(n) is the largest squarefree factor of n. We show that π is deterministic polynomial time Turing reducible to , the Euler function. We also show that θ is reducible to λ, the Carmichael function. We survey other recent work on computing the square part of an integer and give upper and lower bounds on the complexity of solving the problem.     

Supervisory control of hybrid systems within a behavioural framework

This contribution addresses the synthesis of supervisory control for hybrid systems Σ with discrete external signals. Such systems are in general neither l-complete nor can they be represented by finite state machines. We find an l-complete approximation (abstraction) Σ_l for Σ, represent it by a finite state machine, and investigate the control problem for the approximation. If a solution exists, we synthesize the maximally permissive supervisor for Σ_l. We show that it also solves the control problem for the hybrid system Σ. If no solution exists, approximation accuracy can be increased by computing a k-complete abstraction Σ_k, k>l. This paper is entirely set within the framework on Willems’ behavioural systems theory.