On the approximation of convex functions by Bernstein-type operators

As a consequence of Jensen's inequality, centered operators of probabilistic type (also called Bernstein-type operators) approximate convex functions from above. Starting from this fact, we consider several pairs of classical operators and determine, in each case, which one is better to approximate convex functions. In almost all the discussed examples, the conclusion follows from a simple argument concerning composition of operators. However, when comparing Szász-Mirakyan operators with Bernstein operators over the positive semi-axis, the result is derived from the convex ordering of the involved probability distributions. Analogous results for non-centered operators are also considered.     

Nonlinear Cauchy problems with small analytic data

We study the lifespan of solutions to fully nonlinear Cauchy problems with small real- or complex-analytic data. Our proofs are based on the method of majorants and the fixed point theorem for a contraction mapping.

     

STABLE SOLUTION OF TIME DOMAIN INTEGRAL EQUATION METHODS USING QUADRATIC B-SPLINE TEMPORAL BASIS FUNCTIONS

This paper is concerned with stable solutions of time domain integral equation （TDIE） methods for transient scattering problems with 3D conducting objects. We use the quadratic B-spline function as temporal basis functions, which permits both the induced currents and induced charges to be properly approximated in terms of completeness. Because the B-spline function has the least support width among all polynomial basis functions of the same order, the resulting system matrices seem to be the sparsest. The TDIE formula-tions using induced electric polarizations as unknown function are adopted and justified. Numerical results demonstrate that the proposed approach is accurate and efficient, and no late-time instability is observed.     

Minimax Theorems Involving Two Functions and Strictly Monotone Transformations of Their Values

Two two-function minimax theorems are proved.The concavity-convexity conditions of the twofunctions involve strictly monotone transformations and mixing of the values of the two functions,and aredescribed by the inequalities as upward and weakly downward conditions.     

Automatic continuity and representation of group homomorphisms defined between groups of continuous functions

Let C(X,G) be the group of continuous functions from a topological space X into a topological group G with pointwise multiplication as the composition law, endowed with the uniform convergence topology. To what extent does the group structure of C(X,G) determine the topology of X? More generally, when does the existence of a group homomorphism H between the groups C(X,G) and C(Y,G) implies that there is a continuous map h of Y into X such that H is canonically represented by h? We prove that, for any topological group G and compact spaces X and Y, every non-vanishing C-isomorphism (defined below) H of C(X,G) into C(Y,G) is automatically continuous and can be canonically represented by a continuous map h of Y into X. Some applications to specific groups and examples are given in the paper.     

On inequalities of Lieb-Thirring type

Applying the method proposed by Kashin for proving inequalities of Lieb-Thirring type for orthonormal systems, we prove a similar inequality in the multidimensional case.     

On a generalization of Pólya’s theorem

We consider generalizations of Pólya’s theorem to the case of entire functions taking algebraic values at natural or integer points.     

Nash Equilibria,Variational Inequalities,and Dynamical Systems

In this paper, we introduce some relationships between Nash equilibria, variational equilibria, and dynamical equilibria for noncooperative games.     

A simple solution of the van der Waerden permanent problem

The van der Waerden permanent problem was solved using mainly algebraic methods. A much simpler analytic proof is given using a new concept in optimization theory which may be of importance in the general theory of mathematical programming.     

Approximating Clarke’s subgradients of semismooth functions by divided differences

We show that the algorithm presented in an earlier paper by Studniarski (Numer. Math., 55:685–693, 1989) can be applied, after only a small modification, to approximate numerically Clarke’s subgradients of semismooth functions of two variables. Results of computational testing of this modified algorithm are also reported.