Product integration in reflexive Banach spaces

LetX denote a reflexive Banach space and {A(t)|t[0,T]} a time dependent family of accretive operators defined onX. Conditions are placed on {A(t)|t[0,T]} which are sufficient to guarantee the existence of solutions to the Cauchy initial value problem:u(t,x)+A(t)u(t,x)=0; u(0,x)=x. These solutions are obtained via the method of product integration; however limits for the infinite product are taken with respect to the weak topology.     

L p Spectral Independence of Elliptic Operators via Commutator Estimates

Let {T _p:q ₁ p q ₂} be a family of consistent C ₀ semigroups on L ^p(), with q ₁,q ₂ [1,) and open. We show that certain commutator conditions on T _p and on the resolvent of its generator A _p ensure the p independence of the spectrum of A _p for p [q ₁,q ₂.Applications include the case of Petrovskij correct systems with Hölder continuous coefficients, Schrödinger operators, and certain elliptic operators in divergence form with real, but not necessarily symmetric, or complex coefficients.     

On the one-dimensional two-phase inverse Stefan problems

New formulations of the inverse nonstationary Stefan problems are considered: (a) forx [0,1] (the inverse problem IP₁; (b) forx [0, (t)] with a degenerate initial condition (the inverse problem IP). Necessary conditions for the existence and uniqueness of a solution to these problems are formulated. On the first phase {x [0, y(t)]{, the solution of the inverse problem is found in the form of a series; on the second phase {x [y(t), 1] orx [y(t), (t)]{, it is found as a sum of heat double-layer potentials. By representing the inverse problem in the form of two connected boundary-value problems for the heat conduction equation in the domains with moving boundaries, it can be reduced to the integral Volterra equations of the second kind. An exact solution of the problem IP is found for the self similar motion of the boundariesx=y(t) andx=(t).Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 45, No. 8, pp. 1058–1065, August, 1993.     

Global null controllability of nonlinear delay equations with controls in a compact set

The question of controlling some nonlinear retarded functional differential equations from an initial function to the zero function is considered. The control setsM() are square integrable functions with values in the unit closed sphereL ₂([t ₀, ),E ^m ) with center the origin. Assuming that the linear approximation of the nonlinear equation is null controllable with some integrable controls on some interval [t ₀,t ₁–2r], wheret ₀ is sufficiently large and wherer>0 is the delay, and assuming that the nonlinear system, withu=0, is uniformly globally asymptotically stable, we show that the nonlinear control process is globally null controllable with controlsuM(). The paper gives conditions which guarantee the stability assumptions, and also indicates conditions which yield the null controllability assumptions of the linear approximation. Our research extends known results on ordinary differential processes.     

Polynomially Compact-Like Strongly Continuous Semigroups

J. R. Cuthbert gave some results about the class of semigroups of operators (T(t)) _t0 on a Banach space X which have the property that for some t>0, T(t)–I is compact. Cuthbert's results were extended to various classes of operators generalizing the set of compact operators such as the ideal of Fredholm perturbations or the set of Riesz operators. The purpose of the present paper is to give further results in this direction. Thus we consider semigroups for which there exists a non-trivial polynomial p()C[z] such that, for some t>0, p(T(t))J(X) where J(X) is an arbitrary proper two-sided ideal of the algebra (X) contained in the set of Fredholm perturbations.     

Generalized sequencing problem “Towers of Hanoi”

ForpN certain integer-valued functionsA _p (x), defined forx N {0}, are studied. These functions occur in a functional equation system corresponding to a generalized version of the transportation game Towers of Hanoi and their values may be interpreted as minimum numbers of moves. An explicit representation ofA _p (x) is given and so-called minimum partitions ofx with respect top are determined for allx N. The minimum partitions ofx are of interest concerning the realisation of the minimum number of moves by optimal policies.

---

Zusammenfassung Es werden fürp N gewisse ganzzahlige für allex N {0} erklärte FunktionenA _p (x) untersucht, die bei einer Verallgemeinerung des unter dem Namen Türme zu Hanoi bekannten Transportspiels in einem entsprechenden Funktionalgleichungssystem auftreten und deren Funktionswerte sich als Mindestzugzahlen interpretieren. Es werden fürA _p (x) eine explizite Darstellung und sogenannte Minimalzerlegungen vonx bezüglichp für allex N bestimmt. Die Minimalzerlegungen vonx spielen eine besondere Rolle bei der Angabe von optimalen Strategien zur Realisierung der Mindestzugzahl.

     

On Gauss quadrature formulas with equal weights

Summary It is well known that the Chebyshev weight function (1–x ²)^–1/2 is the only weight function (up to a linear transformation) for which then point Gauss quadrature formula has equal weights for alln. In this paper we describe all weight functions for which thenm point Gauss quadrature formula has equal weights for alln, wherem is fixed.     

On the strong controllability of the diffusion equation

Let (x,t)y (x,t),x[0, 1],t[0,T], be the solution of the diffusion equation in one spatial variable corresponding to zero initial conditions and boundary controluL ₂(0,T). GivenfL ₂(0, 1), it is not possible, in general, to find a controlu such thaty(·,T)=f. We extend the space of controls in such a manner thatL ₂(0,T) can be considered to be a subset of a new spaceS of control elements; this space contains elements which do provide a solution to the problem of moments associated with the problem of makingy(·,T)=f inL ₂(0, 1). We show then that the action of the elements ofS can be approximated by that of control functions inL ₂(0,T) in a suitable manner.     

A general descent framework for the monotone variational inequality problem

We present a framework for descent algorithms that solve the monotone variational inequality problem VIP _v which consists in finding a solutionv ^* _v satisfyings(v ^*)^T(v–v ^*)0, for allv _v. This unified framework includes, as special cases, some well known iterative methods and equivalent optimization formulations. A descent method is developed for an equivalent general optimization formulation and a proof of its convergence is given. Based on this unified logarithmic framework, we show that a variant of the descent method where each subproblem is only solved approximately is globally convergent under certain conditions.This research was supported in part by individual operating grants from NSERC.     

On a theorem of J. Vukman

Summary LetR be a ring. A bi-additive symmetric mappingD:R × R R is called a symmetric bi-derivation if, for any fixedy R, the mappingx D(x, y) is a derivation. J. Vukman [2, Theorem 2] proved that, ifR is a non-commutative prime ring of characteristic not two and three, and ifD:R × R R is a symmetric bi-derivation such that [D(x, x), x] lies in the center ofR for allx R, thenD = 0. This result is in the spirit of the well-known theorem of Posner [1, Theorem 2], which states that the existence of a nonzero derivationd on a prime ringR, such that [d(x), x] lies in the center ofR for allx R, forcesR to be commutative. In this paper we generalize the result of J. Vukman mentioned above to nonzero two-sided ideals of prime rings of characteristic not two and we prove the following. Theorem.Let R be a non-commutative prime ring of characteristic different from two, and I a nonzero two-sided ideal of R. Let D: R × R R be a symmetric bi-derivation. If [D(x, x), x] lies in the center of R for all x I, then D = 0.     

A Class of Iterative Algorithms and Solvability of Nonlinear Variational Inequalities Involving Multivalued Mappings

The solvability of the following class of nonlinear variational inequality (NVI) problems based on a class of iterative procedures, which possess an equivalence to a class of projection formulas, is presented.Determine an element x ^* K and u ^* T(x ^*) such that u ^*, x – x ^* 0 for all x K where T: K P(H) is a multivalued mapping from a real Hilbert space H into P(H), the power set of H, and K is a nonempty closed convex subset of H. The iterative procedure adopted here is represented by a nonlinear variational inequality: for arbitrarily chosen initial points x ⁰, y ⁰ K, u ⁰ T(y ⁰) and v ⁰ T(x ⁰), we have u ^k + x ^k+1 – y ^k , x – x ^k+1 0, x K, for u ^k T(y ^k ) and for k 0where v ^k + y ^k – x ^k , x – y ^k 0, x K and for v ^k T(x ^k ).     

On some additive mappings in rings with involution

Summary LetR be a *-ring. We study an additive mappingD: R R satisfyingD(x ²) =D(x)x ^* +xD(x) for allx R.It is shown that, in caseR contains the unit element, the element 1/2, and an invertible skew-hermitian element which lies in the center ofR, then there exists ana R such thatD(x) = ax ^* – xa for allx R. IfR is a noncommutative prime real algebra, thenD is linear. In our main result we prove that a noncommutative prime ring of characteristic different from 2 is normal (i.e.xx ^* =x ^* x for allx R) if and only if there exists a nonzero additive mappingD: R R satisfyingD(x ²) =D(x)x ^* +xD(x) and [D(x), x] = 0 for allx R. This result is in the spirit of the well-known theorem of E. Posner, which states that the existence of a nonzero derivationD on a prime ringR, such that [D(x), x] lies in the center ofR for allx R, forcesR to be commutative.     

On a Test Statistic for Linear Trend

Let {W(s)} _s 0 be a standard Wiener process. The supremum of the squared Euclidian norm Y (t)², of the R²-valued process Y(t)=(1/t W(t), {12/t ³ int_{0 t} s dW (s)– {3/t} W(t)), t [, 1], is the asymptotic, large sample distribution, of a test statistic for a change point detection problem, of appearance of linear trend. We determine the asymptotic behavior P {sup _t [, 1] Y(t)² > u as u , of this statistic, for a fixed (0,1), and for a moving = (u) 0 at a suitable rate as u . The statistical interest of our results lie in their use as approximate test levels.     

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.     

Galerkin methods for parabolic equations with nonlinear boundary conditions

A variety of Galerkin methods are studied for the parabolic equationu _t =(a(x) u),x ⁿ ,t (O,T], subject to the nonlinear boundary conditionu _v =g(x,t,u),x,t (O,T] and the usual initial condition. Optimal order error estimates are derived both inL ² () andH ¹ () norms for all methods treated, including several that produce linear computational procedures.The authors were partially supported by The National Science Foundation during the preparation of this paper.     

Conditions for non-oscillation of singular linear differential equations of second order

Conditions are found in the fulfillment of which each non-trivial solution of the equation u+ (t)u+(t)u=0, where(t) L(a, b) and (t–a)(t–b)(t) L(a, b) has not more than one zero on the interval atb.Translated from Matematicheskie Zametki, Vol. 6, No. 5, pp. 633–639, November, 1969.     

Einschließungsaussagen für gewöhnliche Differentialoperatoren

Summary For differential operatorsM of second order (as defined in (1.1)) we describe a method to prove Range-Domain implications—Mu–u and an algorithm to construct these functions , , , . This method has been especially developed for application to non-inverse-positive differential operators. For example, for non-negativea ₂ and for given functions = we require =C ₀[0, 1] C ₂([0, 1]–T) whereT is some finite set), (M) (t)(t), (t[0, 1]–T) and certain additional conditions for eachtT. Such Range-Domain implications can be used to obtain a numerical error estimation for the solution of a boundary value problemMu=r; further, we use them to guarantee the existence of a solution of nonlinear boundary value problems between the bounds- and .     

Logarithms and imaginary powers of closed linear operators

The imaginary powersA ^it of a closed linear operatorA, with inverse, in a Banach spaceX are considered as aC ₀-group {exp(itlogA);t R} of bounded linear operators onX, with generatori logA. Here logA is defined as the closure of log(1+A) – log(1+A ^–1). LetA be a linearm-sectorial operator of typeS(tan ), 0(/2), in a Hilbert spaceX. That is, |Im(Au, u)| (tan )Re(Au, u) foru D(A). Then ±ilog(1+A) ism-accretive inX andilog(1+A) is the generator of aC ₀-group {(1+A) ^it ;t R} of bounded imaginary powers, satisfying the estimate (1+A) ^it exp(|t|),t R. In particular, ifA is invertible, then ±ilogA ism-accretive inX, where logA is exactly given by logA=log(1+A)–log(1+A ^–1), and {A ^it;t R} forms aC ₀-group onX, with the estimate A ^it exp(|t|),t R. This yields a slight improvement of the Heinz-Kato inequality.     

Stability of the solution of definite quadratic programs

This paper studies how the solution of the problem of minimizingQ(x) = 1/2x ^T Kx – k ^T x subject toGx g andDx = d behaves whenK, k, G, g, D andd are perturbed, say by terms of size, assuming thatK is positive definite. It is shown that in general the solution moves by roughly ifG, g, D andd are not perturbed; whenG, g, D andd are in fact perturbed, much stronger hypotheses allow one to show that the solution moves by roughly. Many of these results can be extended to more general, nonquadratic, functionals.This research was supported in part by contract number N00014-67-A-0126-0015, NR 044-425 from the Office of Naval Research.     

Nonexistence of certain symmetric spherical codes

A spherical 1-codeW is any finite subset of the unit sphere inn dimensionsS ^n–1, for whichd(u, v)1 for everyu, v fromW, uv. A spherical 1-code is symmetric ifuW implies –uW. The best upper bounds in the size of symmetric spherical codes onS ^n–1 were obtained in [1]. Here we obtain the same bounds by a similar method and improve these bounds forn=5, 10, 14 and 22.