Approximating derivations on ideals ofC *-algebras

For each^*-derivation of a separableC ^*-algebraA and each >0 there is an essential idealI ofA and a self-adjoint multiplierx ofI such that (–ad(ix))|I< and x.     

Symmetrization of functions in Sobolev spaces and the isoperimetric inequality

A positive measurable function f on R^d can be symmetrized to a function f^* depending only on the distance r, and with the same distribution function as f. If the distribution derivatives of f are Radon measures then we have the inequality f^*f, where f is the total mass of the gradient. This inequality is a generalisation of the classical isoperimetric inequality for sets. Furthermore, and this is important for applications, if f belongs to the Sobolev space H¹,P then f^* belongs to H¹,P and f^*_pf_p.     

Some Landau's type inequalities for infinitesimal generators

Summary Lett T(t) be a strongly continuous contraction semigroup on a complex Banach space and letA be its infinitesimal generator. We prove that, forx D(A ³), the following inequalities hold true: Ax³ 243/8 x²A ³ x, A ² x 24 xA ³ x². Ift T(t) is a contraction group (resp. cosine function) we get the analogous but better inequalities with constants 9/8 and 3 (resp. 81/40 and 72/25) instead of 243/8 and 24. We consider also uniformly bounded semigroups, groups and cosine functions.     

Ein neues Surjektivitätskriterium im Hilbertraum

LetA, B andC be linearm-accretive operators in a Hilbert space. Suppose further thatC is bounded, thatb:=inf {Re (C y, y)| y=1}>0, thatA ^–1 exists as a bounded operator and that Re (B ^* x, A ^–1 x)+a x²0 holds for allxD (B ^*) and a constanta with 0a<b. ThenCA+B is surjective, (CA+B)^–1 exists and C Ax+Bx (b–a) A x holds for allxD (A) D (B). This criterion can be applied to evolution equations of the formdu/dt+C(t)A(t)u=f(t) whereB:=d/dt.     

Sufficient conditions for bang-bang control in Hilbert space

Sufficient conditions for bang-bang and singular optimal control are established in the case of linear operator equations with cost functionals which are the sum of linear and quadratic terms, that is,Ax=u,J(u)=(r,x)+(x,x), >0. For example, ifA is a bounded operator with a bounded inverse from a Hilbert spaceH into itself and the control setU is the unit ball inH, then an optimal control is bang-bang (has norm l) if 0<1/2;A ^–1*r·A ^–1–2, but is singular (an interior point ofU) if >1/2A ^–1*r·A².This work was supported by NRC Grant No. A-4047 and NSF Grant No. GP-7445.     

Mixing and some integro-functional equations

Summary It is proved that the operatorP: L ¹ (0, ) L ¹(0, ), given byPg(z) = _z/c [g(x)/cx]dx, is completely mixing, i.e.,P ⁿ g ₁ 0 forg L ¹(0, ) with g dx = 0. This implies that, forc (0, 1), each continuous and bounded solution of the equationf(x)= ₀ ^cx f(t)dt/(cx) (x (0, 1]) is constant.     

An eigenvalue problem for the numerical range of a bounded linear operator

LetX be a complex Lebesgue space with a unique duality mapJ fromX toX ^*, the conjugate space ofX. LetA be a bounded linear operator onX. In this paper we obtain a non-linear eigenvalue problem for (A)=sup{Re: W(A} whereW(A)={J(x)A(x)) : x=1}, under the assumption that (A) and the convex hull ofW(A) for some linear operatorsA onl _p , 2<p<.     

Convergence of the Gradient Projection Method for Generalized Convex Minimization

This paper develops convergence theory of the gradient projection method by Calamai and Moré (Math. Programming, vol. 39, 93–116, 1987) which, for minimizing a continuously differentiable optimization problem min{f(x) : x } where is a nonempty closed convex set, generates a sequence x_k+1 = P(x_k – _k f(x_k)) where the stepsize _k > 0 is chosen suitably. It is shown that, when f(x) is a pseudo-convex (quasi-convex) function, this method has strong convergence results: either x_k x^* and x^* is a minimizer (stationary point); or x_k arg min{f(x) : x } = , and f(x_k) inf{f(x) : x }.     

A spectral mapping theorem for scalar-type spectral operators in locally convex spaces

LetT be a continuous scalar-type spectral operator defined on a quasi-complete locally convex spaceX, that is,T=fdP whereP is an equicontinuous spectral measure inX andf is aP-integrable function. It is shown that (T) is precisely the closedP-essential range of the functionf or equivalently, that (T) is equal to the support of the (unique) equicontinuous spectral measureQ ^* defined on the Borel sets of the extended complex plane ^* such thatQ ^*({})=0 andT=zdQ _*(z). This result is then used to prove a spectral mapping theorem; namely, thatg((T))=(g(T)) for anyQ ^*-integrable functiong: ^{* *} which is continuous on (T). This is an improvement on previous results of this type since it covers the case wheng((T))/{} is an unbounded set in a phenomenon which occurs often for continuous operatorsT defined in non-normable spacesX.     

Fehlerabschätzungen für Gauß-Quadraturformeln

Summary We consider Gauss quadrature formulaeQ _n ,n, approximating the integral ,w an even weight function. Let be analytic inK _r :={z:|z|<r},r>1, and . The error functionalR _n :=I-Q _n is continuous with respect to |·|_r and the relation , q_2k (x):=x ^2k holds.In this paper estimates for R _n are given. To this end we first derive two new representations of R _n which are essential for our further investigations. The R _n =r ² R _n (), with (x):=1/(r ²-x ²), is estimated in various ways by using the best uniform approximation of in P_2n-1, and also the expansion of with respect to Chebyshe polynomials of the first and second kind. Forw(x)=(1-x ²), =±1/2, R _n is calculated. The asymptotic behaviour, forr1+, of R _n and of the derived error bounds is also discussed. Finally, we compare different error bounds and give numerical examples.

     

Stationary Gaussian processes with a finite correlation function

If the correlation function vanishes outside the segment [–R, R], then an upper estimate (uniform with respect to all such processes) is possible for the probability of the fact that on an other segment [–r, r] the process remains between – and . Such an estimate is obtained, decreasing for 0 asexp(–f(r/R ln ²+ ) and, moreover,r/R may be either 0 or +. The proof is based on an estimate of the form P_mQ_n c_mn P_m Q_n for norms of polynomials on a circle in the complex plane.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 184, pp. 279–288, 1990.     

Estimate of a random field based on the trajectory of a point moving in it

We consider the stochastic differential equationd _t =( _t )dt+ _t ( _t )dw _t in Euclidean space, where (x) is a Gaussian random field andw _t is a standard Wiener process. Let f _t ={ _s ,st}. Equations are obtained for the conditional meansm _t (x)=f _t } andB _t (x, y)=M{(x)(y)|f _t }.Translated fromTeariya Sluchaínykh Protsessov, Vol. 14, pp. 7–9, 1986.     

The convergence of matrices generated by rank-2 methods from the restricted β-class of Broyden

Summary It is shown that the matricesB _k generated by any method from the restricted -class of Broyden converge, if the method is applied to the unconstrained minimization of a functionfC ²(R ⁿ ) with Lipschitz continuous ² f(x) and if the method is such that it generates vectorsx _k converging sufficiently fast to a local minimumx ^* off with positive definite ² f(x ^*). This result not only holds for constant step sizes _k 1 in each iterationx _k x _k+1=x _k – _k B _k ^–1 f(x _k ) of these methods but also for step sizes determined by asymptotically exact line searches. The paper generalizes corresponding results of Ge Ren-Pu and Powell [6] for the DFP and BFGS methods used in conjunction with step sizes _k 1.Dedicated to Professor F.L. Bauer on the occasion of his 60th birthday     

Iterative refinement implies numerical stability

Suppose that a method computes an approximation of the exact solution of a linear systemAx=b with the relative errorq,q<1. We prove that if all computations are performed in floating point arithmeticfl and single precision, then with iterative refinement is numerically stable and well-behaved wheneverqA A ^–1 is at most of order unity.     

Quadratically constrained least squares and quadratic problems

Summary We consider the following problem: Compute a vectorx such that Ax–b₂=min, subject to the constraint x₂=. A new approach to this problem based on Gauss quadrature is given. The method is especially well suited when the dimensions ofA are large and the matrix is sparse.It is also possible to extend this technique to a constrained quadratic form: For a symmetric matrixA we consider the minimization ofx ^T A x–2b ^T x subject to the constraint x₂=.Some numerical examples are given.This work was in part supported by the National Science Foundation under Grant DCR-8412314 and by the National Institute of Standards and Technology under Grant 60NANB9D0908.     

Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du maximum

Résumé Certaines méthodes directes et indirectes pour le calcul de Max {x ^t Ax, (x)1} sont étudiées.Les méthodes directes sont basées sur les propriétés particulières des normes ₁, ₂ et . Ces méthodes sont très simples mais ne s'appliquent qu'à certaines familles de matrices.La méthode indirecte est la méthode autoduale introduite dans [25, 26] avec = ₁. Dans ce cas, le choix du vecteur initial pour qu'il y ait convergence vers une solution optimale est largement discuté.

---

Some methods for computing the maximum of quadratic from on the unit ball of the maximum norm

Summary Some direct and indirect methods are studied for computing Max {x ^t Ax, (x)1} whereA is symmetric definite positive.Direct methods are constructed using particular properties of ₁, ₂, norms. These methods are very simple, but uniquely suitable to certains families of matrices.The indirect method is the autodual method, introduced in [25, 26, 29] with = ₁. In this case the problem of choosing an initial vector so that convergence of the iterative sequence occurs to an optimal solution is largely discussed.

     

Jordan axioms for C*-algebras

A complex Banach spaceA which is also an associative algebra provided with a conjugate linear vector space involution * satisfying (a ²)^*=(a ^*)², aa ^* a=a³ and ab+ba2ab for alla, b inA is shown to be a C^*-algebra. The assumptions onA can be expressed in terms of the Jordan algebra obtained by symmetrization of the product ofA and are satisfied by any C^*-algebra. Thus we obtain a purely Jordan characterization of C^*-algebras.     

The local time of iterated Brownian motion

We define and study the local time process {L ^*(x,t);x¹,t0} of the iterated Brownian motion (IBM) {H(t):=W ₁(|W ₂ (t)|); t0}, whereW ₁(·) andW ₂(·) are independent Wiener processes.Research supported by Hungarian National Foundation for Scientific Research, Grant No. T 016384.Research supported by an NSERC Canada Grant at Carleton University, Ottawa.Research supported by a PSC CUNY Grant, No. 6-66364.     

A geometric property of extremal surfaces

Let the surface R³ be defined by the equation z = f(x, y), where f(x, y) is a function 3 times continuously differentiable in R². It is proved that if the total (Gaussian) curvature of the surface is nonzero almost everywhere on in the sense of Lebesgue measure in R²), then is extremal, i.e., for almost all (x,y) R² the inequality max (||qx||, ||qy, qf (x, y)) > q^–1/s–. holds for all integral q qo (f), where x is the distance from the real number x to the nearest integer and > 0 is arbitrarily small.Translated from Matematicheskie Zametki, Vol. 23, No. 2, pp. 177–181, February, 1978.In conclusion, the author thanks V. G. Sprindzhuk for suggesting the problem.     

Separation of hypersurfaces

We give a generalization of results obtained in [15]. LetK ⁿ denote the set of embedded hypersurfaces in ⁿ⁺¹; for all xSⁿ and MK ⁿ we denote by C _x ^M the apparent contour ofM in the directionx. Then we give a sufficient condition on WSⁿ such that the map _W ^{K n}:K ⁿ P(T Sⁿ) , defined by _W ^{K n} (M)={C _w ^M ¦ wW}, is injective.