Mixed sensitivity minimization problems with rationall 1-optimal solutions

Up to this time, the only known method to solve the discrete-time mixed sensitivity minimization problem inl ¹ has been to use a certain infinite-dimensional linear programming approach, presented by Dahleh and Pearson in 1988 and later modified by Mendlovitz. That approach does not give in general true optimal solutions; only suboptimal ones are obtained. Here, for the first time, the truel ¹-optimal solutions are found for some mixed sensitivity minimization problems. In particular, Dahleh and Pearson construct an 11h order suboptimal compensator for a certain second-order plan with first-order weight functions; it is shown that the unique optimal compensator for that problem is rational and of order two. The author discovered this fact when trying out a new scheme of solving the infinite-dimensional linear programming system. This scheme is of independent interest, because when it is combined with the Dahleh-Pearson-Mendlovitz scheme, it gives both an upper bound and a lower bound on the optimal performance; hence, it provides the missing error bound that enables one to truncate the solution. Of course, truncation is appropriate only if the order of the optimal compensator is too high. This may indeed be the case, as is shown with an example where the order of the optimal compensator can be arbitrarily high.     

Global classical solutions for a class of quasilinear hyperbolic systems

In this paper we investigate the mechanism of singularity formation to the Cauchy problem of quasilinear hyperbolic system.Moreover, we present some examples to show some significant problems.     

An analog of Sard’s theorem for C 1-smooth functions of two variables

The main result of the article is Theorem 1. Let v: Ω → ? be a C¹-smooth function on a domain Ω → ?². Suppose that 0 ? Cl Int Dv(Ω). Then the measure of the image of the set of critical points equals zero.     

The complexity of anl p method for discrete Tchebycheff approximation in exact arithmetic

A discrete Tchebycheff problem is approximated by a sequence ofl _p norm problems. This is an algorithm to be used if a large number of variables is involved as is the case in the approximation of a function of several variables by a polynomial. The complexity of this procedure is investigated and a lower bound for the number of steps to reach ε-optimality is established. Supported by NIH Grant RR01243 at the University of Washington     

On approximation theorems for controllability of non-linear parabolic problems

^** Email: anil{at}math.iitb.ac.in^*** Email: mcj{at}math.iitb.ac.in^**** Email: akp{at}math.iitb.ac.in In this paper, we consider the following control system governedby the non-linear parabolic differential equation of the form: [graphic: see PDF] where A is a linear operator with dense domain and f(t, y)is a non-linear function. We have proved that under Lipschitzcontinuity assumption on the non-linear function f(t, y), theset of admissible controls is non-empty. The optimal pair (u^*,y^*) is then obtained as the limit of the optimal pair sequence{(u_n^*, y_n^*)}, where u_n^* is a minimizer of the unconstrainedproblem involving a penalty function arising from the controllabilityconstraint and y_n^* is the solution of the parabolic non-linearsystem defined above. Subsequently, we give approximation theoremswhich guarantee the convergence of the numerical schemes tooptimal pair sequence. We also present numerical experimentwhich shows the applicability of our result.     

Existence, uniqueness and stability of C m solutions of iterative functional equations

In this paper we discuss a relatively general kind of iterative functional equation G(x,f(x), ...,f ⁿ (x)) = 0 (for allx ∈J), whereJ is a connected closed subset of the real number axis ℝ,G∈C ^m (J ⁿ⁺¹, ℝ) andn ≥ 2. Using the method of approximating fixed points by small shift of maps, choosing suitable metrics on functional spaces and finding a relation between uniqueness and stability of fixed points of maps of general spaces, we prove the existence, uniqueness and stability ofCm solutions of the above equation for any integer m ≥ 0 under relatively weak conditions, and generalize related results in reference in different aspects.     

Necessary and sufficient conditions for a curve to be the gradient range of a <Emphasis Type="Italic">C</Emphasis><Superscript>1</Superscript>-smooth function

We find some necessary and sufficient conditions for a plane curve to be the gradient range of a C ¹-smooth function of two variables. As one of the consequences we give the necessary and sufficient conditions on a continuous function ? under which the differential equation \(\frac{{\partial v}}{{\partial t}} = \varphi \left( {\frac{{\partial v}}{{\partial x}}} \right)\) has nontrivial C ¹-smooth solutions.     

On a class of optimum problems in structural design

The paper deals with the existence of solutions for a class of optimal design problems. The notion of relaxation of an integral functional with respect toG-convergence is introduced, and a general integral representation theorem is obtained for the relaxed functional. For a particular class of functionals, this integral representation is computed explicitly.This work has been realized in a National Research Project in Mathematics supported by the Ministero della Pubblica Istruzione (Italy).     

An example of a <Emphasis Type="Italic">C</Emphasis><Superscript>1</Superscript>-smooth function whose gradient range is an arc with no tangent at any point

We construct an example of a C ¹-smooth real function of two variables whose gradient range is an arc with no tangent at any point.     

On conditions for and the order of approximation of functions by operators of classS 2m

Following P. P. Korovkin, we study conditions for the convergence of operators of classesS _2m to continuous functions and the asymptotics of approximation by such operators to differentiable functions. Translated fromMatematicheskie Zametki, Vol. 67, No. 5, pp. 654–661, May, 2000.     

New examples of Cantor sets in <Emphasis Type="Italic">S</Emphasis><Superscript>1</Superscript> that are not <Emphasis Type="Italic">C</Emphasis><Superscript>1</Superscript>-minimal

Although every Cantor subset of the circle (S¹) is the minimal set of some homeomorphism of S¹, not every such set is minimal for a C¹ diffeomorphism of S¹. In this work, we construct new examples of Cantor sets in S¹ that are not minimal for any C¹-diffeomorphim of S¹.     

The newton filtration and d-determination of bifurcation problems related to C0 contact equivalence

In this paper, from the Newton filtration’s point of view, we construct the singular Riemannian metric and use the method in singular theory to study the bifurcation problems, and give the sufficient condition of d-determination of bifurcation problems with respect to C ⁰ contact equivalence. The special cases of the main result in this paper are the results of Sun Weizhi and Zou Jiancheng.     

Construction of the extremal function for a functional on the classH ω (n)

For a functional on the classH _ω ⁽ⁿ⁾ ,n≥3, we construct the extremal function on which the upper bound obtained by A. I. Stepanets is attained. Translated fromMatematicheskie Zametki, Vol. 61, No. 4, pp. 519–529, April, 1997. Translated by N. K. Kulman     

On the existence of solutions for nonlinear impulsive periodic viable problems

In this paper we prove the existence of periodic solutions for nonlinear impulsive viable problems monitored by differential inclusions of the type x′(t)∈F(t,x(t))+G(t,x(t)). Our existence theorems extend, in a broad sense, some propositions proved in [10] and improve a result due to Hristova-Bainov in [13].     

An interaction-coordination algorithm with modified performance index for nonlinear optimal control problems

This paper proposes a coordination algorithm for multilevel control of a nonlinear dynamical system. The overall system under consideration is composed of subsystems with relatively strong interactions or relatively strong nonlinearities, or both. The objective is to minimize a performance index of quadratic type.The idea of the present algorithm is to replace the system variables associated with interactions and nonlinearities by artificially introducedinteraction variables and to decompose the overall problem into a number of smaller and simpler subproblems. At the same time, the appearance of the performance index is modified by using the interaction variables. Parameters, called weights, are introduced into the modified performance index. Choice of the values of these parameters has significant influence on the convergence rate of the algorithm, and hence is one of the major factors determining the total computing time.The interaction variables are adjusted directly by a nearly steepest-descent algorithm, without using Jacobian matrix, until the interactions attain consistency. In the paper, some sufficient conditions for convergence of the iterative algorithm are discussed in detail, and several features of the present algorithm are illustrated by examining an example.     

The optimal convergence of the h–p version of the boundary element method with quasiuniform meshes for elliptic problems on polygonal domains

In the framework of the Jacobi-weighted Besov spaces, we analyze the lower and upper bounds of errors in the h–p version of boundary element solutions on quasiuniform meshes for elliptic problems on polygons. Both lower bound and upper bound are optimal in h and p, and they are of the same order. The optimal convergence of the h–p version of boundary element method with quasiuniform meshes is proved, which includes the optimal rates for h version with quasiuniform meshes and the p version with quasiuniform degrees as two special cases. Dedicated to Professor Charles Micchelli on the occasion of his sixtieth birthday Mathematics subject classification (2000) 65N38. Benqi Guo: The work of this author was supported by NSERC of Canada under Grant OGP0046726 and was complete during visiting Newton Institute for Mathematical Sciences, Cambridge University for participating in special program “Computational Challenges in PDEs” in 2003. Norbert Heuer: This author is supported by Fondecyt project No. 1010220 and by the FONDAP Program (Chile) on Numerical Analysis. Current address: Mathematical Sciences, Brunel University, Uxbridge, U.K.     

Large time behavior of solutions for critical and subcritical complex Ginzburg-Landau equations in H<Superscript>1</Superscript>

Considering the Cauchy problem for the critical complex Ginzburg-Landau equation in H¹(Rⁿ), we shall show the asymptotic behavior for its solutions in C(0, ∖;H¹(Rⁿ)) ∩ L²(0, ∖;H^1,2n/(n-2)(R²)), n≥3. Analogous results also hold in the case that the nonlinearity has the subcritical power in H¹(Rⁿ), n≥1. Dedicated to Professor Zhou Yulin for his 80th birthday.     

Properties of the <Emphasis Type="Italic">C</Emphasis><Superscript>1</Superscript>-smooth functions with nowhere dense gradient range

One of the main results of the present article is as follows Theorem. Let v: Ω → ? be a C¹-smooth function on a domain Ω ? ?². Suppose that Int?v(Ω) = ?. Then, for every point z ∈ Ω, there is a straight line L ? z such that ?v ≡ const on the connected component of the set L ? Ω containing z.Also, we prove that, under the conditions of the theorem, the range of the gradient ?v(Ω) is locally a curve and this curve has tangents in the weak sense and the direction of these tangents is a function of bounded variation.