Stabilization of ill-posed Cauchy problems for parabolic equations

Summary In this paper we study the noncharacteristic Cauchy problem, u_t–(a(x)u_x)_x=0, x(0, l), t.(0, T], u(0, t)=(t), u_x(0,t)=0, 0tT, assuming only L for a. In the case of weak a priori bounds on u, we derive stability estimates on u of Hölder type in the interior and of logarithmic type at the boundary. Also the continuous dependence on a is considered.

---

Sunto Nel presente lavoro consideriamo il problema di Cauchy non ben posto u_t= (a(x)u_x)_x, x(0, l), t(0, T), u(0, t)=(t), u_x(0, t)=0, 0tT. Supponiamo che a sia misurabile e limitato inferiormente e superiormente da constanti positive. Introduciamo delle limitazioni a priori su u e dimostriamo la dipendenza continua di u rispetto al dato sia in (0, l)×(0, T) (di tipo hölderiano) sia per x=l (di tipo logaritmico). Consideriamo, inoltre, la dipendenza continua di u da a.

     

Quadratically constrained quadratic programming: Some applications and a method for solution

The problem (QPQR) considered here is: minimizeQ ₁ (x) subject toQ _i (x) 0,i M ₁ {2,...,m},x P R ⁿ, whereQ _i (x), i M {1} M ₁ are quadratic forms with positive semi-definite matrices, andP a compact nonempty polyhedron of Rⁿ. Applications of (QPQR) and a new method to solve it are presented.Letu S={u R ^m;u 0, u _i= l}be fixed;then the problem:iM minimize u _iQ_i (x (u)) overP, always has an optimal solutionx (u), which is either feasible, iM i.e. u C₁ {u S;Q _i (x (u)) 0,i M ₁} or unfeasible, i.e. there exists ani M ₁ withu C {u S; Q_i(x(u)) 0}.Let us defineC _i C_i S _i withS _i {u S; u _i=0}, i M. A constructive method is used to prove that C _i is not empty and thatx (û) withiM û C _i characterizes an optimal solution to (QPQR). Quite attractive numerical results have been reached with this method.

---

Zusammenfassung Die vorliegende Arbeit befaßt sich mit Anwendungen und einer neuen Lösungsmethode der folgenden Aufgabe (QPQR): man minimiere eine konvexe quadratische ZielfunktionQ _i (x) unter Berücksichtigung konvexer quadratischer RestriktionenQ _i (x) 0, iM ₁ {2,...,m}, und/oder linearer Restriktionen.·Für ein festesu S {u R ^m;u 0, u _i=1},M {1} M₁ besitzt das Problem:iM minimiere die konvexe quadratische Zielfunktion u _i Q_i (x (u)) über dem durch die lineareniM Restriktionen von (QPQR) erzeugten, kompakten und nicht leeren PolyederP R ⁿ, immer eine Optimallösungx (u), die entweder zulässig ist: u C₁ {u S;Q ₁ (x (u)) 0,i M ₁} oder unzulässig ist, d.h. es existiert eini M ₁ mitu C_i {u S;Q _i (x(u))0}.Es seien folgende MengenC _i C_i S _i definiert, mitS _i {u S;u _i=0}, i M. Es wird konstruktiv bewiesen, daß C _i 0 undx (û) mitû C _i eine Optimallösung voniM iM (QPQR) ist; damit ergibt sich eine Methode zur Lösung von (QPQR), die sich als sehr effizient erwiesen hat. Ein einfaches Beispiel ist angegeben, mit dem alle Schritte des Algorithmus und dessen Arbeitsweise graphisch dargestellt werden können.

---

---

An earlier version of this paper was written during the author's stay at the Institute for Operations Research, Swiss Federal Institute of Technology, Zürich.     

Some minimax problems of vector-valued functions

The concepts of cone extreme points, cone saddle points, and cone saddle values are introduced. The relation of inclusion among the sets mini _xX max _yY f(x, y), maxi _yY min _xX f(x, y), and the set of all weak cone saddle values is investigated in the case where the image space ⁿ off is ordered by an acute convex cone.The author is grateful for the useful suggestions and comments given by Prof. K. Tanaka, Niigata University, Niigata, Japan.The author would like to thank the referees for their valuable suggestions on the original draft.     

Über Automorphismenbahnen von Elementen u≠O mit (ad u)3=αad u in endlichdimensionalen einfachen komplexen Lie-Algebren

In this paper we study certain semisimple elements in simple complex Koecher-Tits-constructions from Jordan-triplesystems. Let L be a finite dimensional simple complex Lie-Algebra and u O an element in L with (ad u)³=-ad u. Then there is a compact real form L of L, which contains u. The involutorial automorphism id_L+2 (ad_Lu)² of L induces a Cartan-decomposition of a real form L (u) of L and this gives us a criterion of conjugacy under Aut L for two such elements u₁, u₂L.Using this result, we show that the number of conjugacy classes of elements uL (u O) with (ad u)³=ad u (\{O}, under Aut L is equal to the number of similarity classes of Jordantriplesystems, the Koecher-Tits-construction of which is isomorphic to L. The corresponding data are finally listed for all possible types of L.     

Kite-freeP- andQ-polynomial schemes

LetY = (X, {R _i } _oid) denote aP-polynomial association scheme. By a kite of lengthi (2 i d) inY, we mean a 4-tuplexyzu (x, y, z, u X) such that(x, y) R ₁,(x, z) R ₁,(y, z) R ₁,(u, y) R _i–1,(u, z) R _i–1,(u, x) R _i. Our main result in this paper is the following.     

On the complete solution of ∈y″=y 3

In Ref. 1, the author claimed that the problem y=y ³ is soluble only for a certain range of the parameter . An analytic approach, as adopted in the following contribution, reveals that a unique solution exists for any positive value of . The solution is given in closed form by means of Jacobian elliptic functions, which can be numerically computed very efficiently. In the limit 0+, the solutions exhibit boundary-layer behavior at both endpoints. An easily interpretable approximate solution for small is obtained using a three-variable approach.     

Connected and alternating vectors: Polyhedra and algorithms

Given a graphG = (V, E), leta ^S, S L, be the edge set incidence vectors of its nontrivial connected subgraphs.The extreme points of = {x R ^E: a^sx |V(S)| - |S|, S L} are shown to be integer 0/± 1 and characterized. They are the alternating vectorsb ^k, k K, ofG. WhenG is a tree, the extreme points ofB 0,b ^kx 1,k K} are shown to be the connected vectors ofG together with the origin. For the four LP's associated with andA, good algorithms are given and total dual integrality of andA proven.On leave from Swiss Federal Institute of Technology, Zurich.     

Notes on Interpolation. X (Two Boundary Value Problems)

In this paper we use (0, 2) interpolational polynomials to give an approximate solution of the differential equation y(x) + A(x)y(x) = F(x), x I := [-1, 1] j in case when the boundary values are y(-1) = and y(1) = , , R.     

A perturbation result for the asymptotic behavior of matrix powers

We prove a perturbation result for the asymptotic behavior of the sequence (A ⁿ c) _nN , whereAG|(d), the space of invertibled×d matrices, andc ^d .     

Milnor numbers and the topology of polynomial hypersurfaces

Summary LetF: n + 1 be a polynomial. The problem of determining the homology groupsH _q (F ^–1 (c)), c , in terms of the critical points ofF is considered. In the best case it is shown, for a certain generic class of polynomials (tame polynomials), that for allc,F ^–1 (c) has the homotopy type of a bouquet of - ^c n-spheres. Here is the sum of all the Milnor numbers ofF at critical points ofF and ^c is the corresponding sum for critical points lying onF ^–1 (c). A second best case is also discussed and the homology groupsH _q (F ^–1 (c)) are calculated for genericc. This case gives an example in which the critical points at infinity ofF must be considered in order to determine the homology groupsH _q (F ^–1 (c)).     

Radially Symmetric Functions as Fixed Points of some Logarithmic Operators

In this note we show that for f C((0,); R₊) C¹ ((0,)) with support in [0,), if a function u C¹(R²) is such that support (u⁺) is compact and u(x) = R² f(u(y)) log 1/(|x-y|)dy x, then u is radial. This result is important for some free boundary problems in R² or some axisymmetric ones in Rⁿ.     

On signpost systems and connected graphs

By a signpost system we mean an ordered pair (W, P), where W is a finite nonempty set, P W × W × W and the following statements hold: if (u, v, w) P, then (v, u, u) P and (v, u, w) P, for all u, v, w W; if u v; then there exists r W such that (u, r, v) P, for all u, v W. We say that a signpost system (W, P) is smooth if the folowing statement holds for all u, v, x, y, z W: if (u, v, x), (u, v, z), (x, y, z) P, then (u, v, y) P. We say thay a signpost system (W, P) is simple if the following statement holds for all u, v, x, y W: if (u, v, x), (x, y, v) P, then (u, v, y), (x, y, u) P.By the underlying graph of a signpost system (W, P) we mean the graph G with V(G) = W and such that the following statement holds for all distinct u, v W: u and v are adjacent in G if and only if (u, v, v) P. The main result of this paper is as follows: If G is a graph, then the following three statements are equivalent: G is connected; G is the underlying graph of a simple smooth signpost system; G is the underlying graph of a smooth signpost system.Research was supported by Grant Agency of the Czech Republic, grant No. 401/01/0218.     

Singular perturbations in foliations

Summary We define a constraint system , [0,₀), which is a kind of family of vector fields on a manifold. This is a generalized version of the family of the equations , [0,₀),x ^m ,y ⁿ . Finally, we prove a singular perturbation theorem for the system , [0,₀).Dedicated to Professor Kenichi Shiraiwa on his 60th birthday     

Two-parameter Vilenkin multipliers and a square function

Two-parameter Vilenkin systems will be investigated. First we give a general sufficient condition for multipliers to be bounded between two-dimensional Hardy spaces H ^q(0<q1). By means of interpolation and duality argument, this theorem can be extended to other spaces. As a consequence, we can prove the (H ^q , L ^q)-boundedness of the Sunouchi operator U with respect to two-parameter Vilenkin systems for all 0 <q 1. Moreover, the equivalence f{H_q} ~ Uf_q (f H^q)follows for 1/2<q 1.     

A representation of symmetric functions in Carleman-Gevrey spaces

For a symmetric function t(x)(x^d) one investigates the representation, where _j(x) is the elementary symmetric polynomial of degree j. Let be the closure of the domain in ^d, let be a numerical sequence such that (n) does not decrease, let be the Carleman-Gevrey space, i.e. the collection of functions (n+1)/(n) such that for any bounded subdomain there exists a constant tC() with which one has the inequality _x t(x)H⁺¹!() (x*#x03A9;'). Let S be the image of ^d under the mapping x(₁(x), ..., _d(x)). One proves the following theorem: For any tk(^d) there exists such that, if and only if (n)(nd)ⁿ⁺¹, where is some positive number, independent of n.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 149, pp. 116–126, 1986.     

Almost sure behaviour ofF-valued random fields

Summary LetX _n, n ^d be a field of independent random variables taking values in a semi-normed measurable vector spaceF. For a broad class of fields _n, ^d of positive numbers, the almost sure behaviour of _knX_k/_n, n ^d is studied. The main result allows us to deduce some new and well-known theorems for fields of independentF random variables from related results for fields of independent real random variables.Supported in part by the Youth Science Foundation of China, No. 19001018Supported by the National Natural Science Foundation of China     

∈-Weak Minimal Solutions of Vector Optimization Problems with Set-Valued Maps

In this paper, we consider cone-subconvexlike vector optimization problems with set-valued maps in general spaces and derive scalarization results, -saddle point theorems, and -duality assertions using -Lagrangian multipliers.     

The lyapunov equation and the problem of stability for linear bounded discrete-time systems in Hilbert space

This paper is devoted to a study of the properties of the equationA ^*FA–F=–G, where FL() is unknown, AL(), GL() is positive and is a Hilbert space. It is shown that necessary and sufficient (in some sense) conditions for the existence of positive definite solutions of this equation are directly connected with the stability of infinite dimensional linear systemx _k+1=Ax _k . The relationships between stability of such a system and stability of a continuous-time system generated by a strongly continuous semigroup are given also. As an example the case of the delayed system in Rⁿ is considered.This work was supported in part by the Polish Academy of Sciences under the contract Problem Miedzyresortowy I.1, Grupa Tematyczna 3 This paper was written while the author was with the Instytut Automatyki, the same university.     

Une propriete arithmetique de certains operateurs differentiels

Define and let L(D)=a_i(x)Dⁱ[x][D] be a linear differential operator with polynomial coefficients. G. POLYA for L(D)=D and D. CANTOR for L(D)=P(xD), P[x] proved that if u[[x]] is such that L(D)(u) is a rational function, then u is also a rational function.In this paper, we introduce a new class of linear differential operators with the same property.     

Orthogonality and additivity modulo a subgroup

Summary LetE be a real inner product space of dimension at least 2,F a topological Abelian group, andK a discrete subgroup ofF. Assume also thatF is continuously divisible by 2 (that is, the functionu 2u is a homeomorphism ofF ontoF). Iff: E F fulfils the conditionf(x + y) – f(x) – f(y) K for all orthogonalx, y E and is continuous at the origin then there exist continuous additive functionsa: R F andA: E F such thatf(x) – a(x ²)– A(x) K for everyx E. Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth.