Extensions and selections in subspaces ofC(K)

LetK be a compact Hausdorff space and letFK be a peak interpolation set for a function algebraAC(K). Let be a map fromK to the family of all convex subsets of such that the set {(z, x)zK, x(z)} is open inK×C and such thatg(z)(z) (zK) for somegA. We prove that everyfC(F) satisfyingf(s)(s) (sF) (f(s)closure (s) (sF)) admits an extensionfAA} satisfyingf(z)(z) (zK) (f(z))}closure (z) (zK), respectively). We prove a more general theorem of this kind and present various applications which generalize known dominated interpolation theorems for subspaces ofC(K).     

Convexity of Nonlinear Image of a Small Ball with Applications to Optimization

Let f: XY be a nonlinear differentiable map, X,Y are Hilbert spaces, B(a,r) is a ball in X with a center a and radius r. Suppose f (x) is Lipschitz in B(a,r) with Lipschitz constant L and f (a) is a surjection: f (a)X=Y; this implies the existence of >0 such that f (a)^* yy, yY. Then, if r,/(2L), the image F=f(B(a,)) of the ball B(a,) is convex. This result has numerous applications in optimization and control. First, duality theory holds for nonconvex mathematical programming problems with extra constraint x–a. Special effective algorithms for such optimization problems can be constructed as well. Second, the reachability set for small power control is convex. This leads to various results in optimal control.     

Sharp Large Deviation Estimates for the Stochastic Heat Equation

We consider the family {X , 0} of solution to the heat equation on [0,T]×[0,1] perturbed by a small space-time white noise, that is _t X = X +b({X })+({X }) . Then, for a large class of Borelian subsets of the continuous functions on [0,T]×[0,1], we get an asymptotic expansion of P({X }A) as 0. This kind of expansion has been handled for several stochastic systems, ranging from Wiener integrals to diffusion processes.     

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     

On Logarithmic Smoothing of the Maximum Function

We consider the maximum function f resulting from a finite number of smooth functions. The logarithmic barrier function of the epigraph of f gives rise to a smooth approximation g of f itself, where >0 denotes the approximation parameter. The one-parametric family g converges – relative to a compact subset – uniformly to the function f as tends to zero. Under nondegeneracy assumptions we show that the stationary points of g and f correspond to each other, and that their respective Morse indices coincide. The latter correspondence is obtained by establishing smooth curves x() of stationary points for g , where each x() converges to the corresponding stationary point of f as tends to zero. In case of a strongly unique local minimizer, we show that the nondegeneracy assumption may be relaxed in order to obtain a smooth curve x().     

A note on quasi-periodic solutions of some elliptic systems

We extend a recent method of proof of a theorem by Kolmogorov on the conservation of quasi-periodic motion in Hamiltonian systems so as to prove existence of (uncountably many) real-analytic quasi-periodic solutions for elliptic systems u=f _x (u, y), whereu y ^M u(y) ^N ,f=f(x, y) is a real-analytic periodic function and is a small parameter. Kolmogorov's theorem is obtained (in a special case) whenM=1 while the caseN=1 is (a special case of) a theorem by J. Moser on minimal foliations of codimension 1 on a torusT ^M +1. In the autonomous case,f=f(x), the above result holds for any .     

Poisson kernel is the unique approximate identity,asymptotically multiplicative on H∞

Let for anyf H(R), where (x): = ^–1(x^–1). Then (x) P (x + h) for some h R and > 0; P denotes the Poisson kernel.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 170, pp. 82–89, 1989.     

On the existence of multiple solutions of nonhomogeneous elliptic equations involving critical Sobolev exponents

Letp=2N/(N –2),N 3 be the limiting Sobolev exponent and ^N a bounded smooth domain. We show that for H ^–1(),f satisfies some conditions then–u=c ₁ u ^p–1 +f(x,u) + admits at least two positive solutions.     

Global controllability of conditionally periodic linear system

We use the notation: Rⁿ Is n-dimensional Euclidean space;S _a (x⁰)={x Rⁿ: ¦x-x ⁰ ¦ }; int Q is the interior of setQ Rⁿ. With any linear systemx=A (t)x +B (t) u, x Rⁿ,u R^m, (1)Translated from Matematicheskie Zametki, Vol. 32, No. 2, pp. 169–174, August, 1982.     

Conjugation for polynomial mappings

We consider Keller's functions, namely polynomial functionsf:C ⁿ C ⁿ with detf(x)=1 at allx C ⁿ. Keller conjectured that they are all bijective and have polynomial inverses. The problem is still open.Without loss of generality assumef(0)=0 andf'(0)=I. We study the existence of certain mappingsh , > 1, defined by power series in a ball with center at the origin, such thath(0)=I andh (f(x))=h (x). So eachh conjugates f to its linear part I in a ball where it is injective.We conjecture that for Keller's functionsf of the homogeneous formf(x)=x +g(x),g(sx)=s ^dg(x),g(x)ⁿ=0,xC ⁿ,sC the conjugationh for f is anentire function.     

Interpolation of generalized analytical functions of complex variable

A general approach is proposed to the interpolation of x -analytical functions of a complex variable with an arbitrary –,+[Basis x -analytical functions whose imaginary pan is a polynomial in x, and y are obtained in explicit form.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 58, pp. 3–9, 1986.     

Spectral parameter asymptotics of the Weyl solutions of Sturm-Liouville equations

In the paper one investigates the dependence of Weyl's solution ,)=c(,)+n()s(,) of the Sturm-Liouville equation y+q()y=²y on the spectral parameter . Under the condition that the potential q is bounded from below and q()exp(c₀+c[in1 ¦¦), it is proved for {ie217-01} for any positive values and A. If q()>1 and {ie217-02} for all >0, then in the semiplane >0 the Weyl solution (, ) is obtained from the Weyl solution (,x) is obtained from the Weyl solution e^ix with zero potential, with the aid of a generalization of B. Ya Levin's transformation operators.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 170, pp. 184–206, 1989.I express my sincere gratitude to L. A. Pastur and I. V. Ostrovskii for valuable advice and discussions.     

The correctness problem for best approximations by trigonometric polynomials in the class W o r H[ω]C

Suppose thatk, rz₊, W _o ^r H[]_C= {ff is a 2-periodic function,f C^r [–, ], (f^(r), ) ()}, T_k is the space of trigonometric polynomials of order k, p_k(f)T_k is the polynomial of best uniform approximation to f, and E_k(f) is the error of the best approximation. It is shown that for an arbitrary > 0 we have,where for 0<&#x2A7D;(1),k > 0.R () is the root of the equation , and for k = 0 or > (1) we have R()=.Translated from Matematicheskie Zametki, Vol. 22, No. 1, pp. 85–101, July, 1977.The author thanks S. B. Stechkin for posing the problem and for his attention to this work.     

Shift invariant spaces inL 2

If is a complex, separable Hilbert space, letL ² () denote theL ²-space of functions defined on the unit circle and having values in . The bilateral shift onL ²() is the operator (U f)()=f(). A Hilbert spaceH iscontractively contained in the Hilbert spaceK ifHK and the inclusion mapH–K is a contraction. We describe the structure of those Hilbert spaces, contractively contained inL ²(), that are carried into themselves contractively byU . We also do this for the subcase of those spaces which are carried into themselves unitarily byU .     

Sequential gradient-restoration algorithm for the minimization of constrained functions—Ordinary and conjugate gradient versions

The problem of minimizing a functionf(x) subject to the constraint (x)=0 is considered. Here,f is a scalar,x ann-vector, and aq-vector. Asequential algorithm is presented, composed of the alternate succession of gradient phases and restoration phases.In thegradient phase, a nominal pointx satisfying the constraint is assumed; a displacement x leading from pointx to a varied pointy is determined such that the value of the function is reduced. The determination of the displacement x incorporates information at only pointx for theordinary gradient version of the method (Part 1) and information at both pointsx and for theconjugate gradient version of the method (Part 2).In therestoration phase, a nominal pointy not satisfying the constraint is assumed; a displacement y leading from pointy to a varied point is determined such that the constraint is restored to a prescribed degree of accuracy. The restoration is done by requiring the least-square change of the coordinates.If the stepsize of the gradient phase is ofO(), then x=O() and y=O(²). For sufficiently small, the restoration phase preserves the descent property of the gradient phase: the functionf decreases between any two successive restoration phases.This research, supported by the NASA Manned Spacecraft Center, Grant No. NGR-44-006-089, and by the Office of Scientific Research, Office of Aerospace Research, United States Air Force, Grant No. AF-AFOSR-828-67, is a condensation of the investigations reported in Refs. 1 and 2.     

Constraint decomposition algorithms in global optimization

Many global optimization problems can be formulated in the form min{c(x, y): x X, y Y, (x, y) Z, y G} where X, Y are polytopes in ^p , ⁿ , respectively, Z is a closed convex set in ^p+n, while G is the complement of an open convex set in ⁿ . The function c: ^p+n is assumed to be linear. Using the fact that the nonconvex constraints depend only upon they-variables, we modify and combine basic global optimization techniques such that some new decomposition methods result which involve global optimization procedures only in ⁿ . Computational experiments show that the resulting algorithms work well for problems with smalln.     

A finite element method for a singularly perturbed boundary value problem

Summary We examine the problem:u+a(x)u–b(x)u=f(x) for 0<x<1,a(x)>0,b(x)>, ² = 4>0,a, b andf inC ² [0, 1], in (0, 1],u(0) andu(1) given. Using finite elements and a discretized Green's function, we show that the El-Mistikawy and Werle difference scheme on an equidistant mesh of widthh is uniformly second order accurate for this problem (i.e., the nodal errors are bounded byCh ², whereC is independent ofh and ). With a natural choice of trial functions, uniform first order accuracy is obtained in theL (0, 1) norm. On choosing piecewise linear trial functions (hat functions), uniform first order accuracy is obtained in theL ¹ (0, 1) norm.     

Zur L∞-Konvergenz linearer finiter Elemente beim Dirichlet-Problem

Summary For piecewise linear Ritz approximation of second order elliptic Dirichlet problemsAu=f over domains ⁿ globalL error boundsO(h ²|lnh|^v) are obtained under the assumptionfL (). The proof rests on interpolation ofH ²()-functions with second derivatives in the space of John and Nirenberg by piecewise linear splines and a technique of Nitsche [7] using weighted Sobolev norms.

---

---

Diese Note wurde verfaßt mit der Unterstützung des Sonderforschungsbereiches 72 der DFG, Bundesrepublik Deutschland     

On the distribution of comparisons in sorting algorithms

We considered the following natural conjecture: For every sorting algorithm every key will be involved in(logn) comparisons for some input. We show that this is true for most of the keys and prove matching upper and lower bounds. Every sorting algorithm for some input will involven–n /2+1 keys in at leastlog₂ n comparisons,>0. Further, there exists a sorting algorithm that will for every input involve at mostn–n ^/c keys in greater thanlog₂ n comparisons, wherec is a constant and>0. The conjecture is shown to hold for natural algorithms from the literature.     

Isolation theorem for forms corresponding to purely real algebraic fields

Let M be the complete module of a purely real algebraic field of degree n 3, let be a lattice in this module, and let F(X) be its form. We use to denote any lattice for which we have = , where is a nondiagonal matrix for which – I . With each lattice we can associate a factorizable formF (X) in a natural manner. We denote the complete set of forms corresponding to the set {} by {F (X)}. It is proved that for any > 0 there exists an > 0 such that for eachF (X) {F } we have |F (X₀₎| for some integer vector X₀ 0.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 185, pp. 5–12, 1990.In conclusion, the author would like to express his deep gratitude to B. F. Skubenko for stating the problem and for his constant attention.