非时齐马氏过程的Liggett-Stroock不等式

本文将时齐马氏过程中重要的代数不等式Liggett-Stroock不等式推广到非时齐马氏过程中,建立了非时齐马氏过程的转移半群与Liggett-Stroock不等式之间的关系.     

关于两个素数和一个素数k次幂的丢番图不等式

令■设λ_1,λ_2,λ_3是不全同号的非零实数,且满足λ_1/λ_2为无理数,则对于任意实数η和ε 0,不等式■有无穷多组素数解p_1,p_2,p_3.该结果改进了Gambini,Languasco和Zaccagnini的结果.     

Modeling of Steady Flows in a Channel by Navier–Stokes Variational Inequalities

A mathematical model of a steady viscous incompressible fluid flow in a channel with exit conditions different from the Dirichlet conditions is considered. A variational inequality is derived for the formulated subdifferential boundary-value problem, and the structure of the set of its solutions is studied. For two-ption on the low Reynolds number is proved. In the three-dimensional case, a class of constraints on the tangential component of velocity at the exit, which guarantees solvability of the variational inequality, is found.     

On upper bounds for the variance of functions of random variables

The upper bounds for the variance of a function g of a random variable X obtained in Cacoullos (1982) (for short CP) are improved in the case μ = E(X) ≠ 0. A main feature of these bounds is that they involve the second moment of the derivative or the difference of g. A multivariate extension for functions of independent random variables is also given.     

一类奇摄动三阶系统边值问题的渐近解

本文获得了一类三阶系统边值问题解的存在性及其精确到任意精度的一致有效估计.     

Duality Results for Generalized Vector Variational Inequalities with Set-Valued Maps

In this paper, we introduce new dual problems of generalized vector variational inequality problems with set-valued maps and we discuss a link between the solution sets of the primal and dual problems. The notion of solutions in each of these problems is introduced via the concepts of efficiency, weak efficiency or Benson proper efficiency in vector optimization. We provide also examples showing that some earlier duality results for vector variational inequality may not be true. This work was supported by the Brain Korea 21 Project in 2006.     

Optimal shape design for systems governed by variational inequalities,part 3: Necessary conditions in the elliptic case

General optimality conditions are obtained for optimal shape design for systems governed by a class of elliptic variational inequalities. The conditions are established by making use of the necessary conditions for optimal control of systems governed by strongly monotone variational inequalities. These conditions are then applied to an electrochemical machining problem.     

Projected Dynamical Systems and Evolutionary Variational Inequalities via Hilbert Spaces with Applications<Superscript>1</Superscript>

In this paper, we make explicit the connection between projected dynamical systems on Hilbert spaces and evolutionary variational inequalities. We give a novel formulation that unifies the underlying constraint sets for such inequalities, which arise in time-dependent traffic network, spatial price equilibrium, and a variety of financial equilibrium problems. We emphasize the importance of the results in applications and provide a traffic network numerical example in which we compute the curve of equilibria. ¹This research was funded by the Rockefeller Foundation, Bellagio Center Program. The first author was also supported by NSERC Discovery Grant 045997 and the third author by NSF Grant IIS-0002647. The authors thank Professors George Isac, Antonino Maugeri, and Panos Pardalos for support and inspiration; they are indebted to Professor Antonino Maugeri for assistance throughout their residency at Bellagio, Italy in March 2004.     

Moment problem formulation of the Schrödinger equation

We show that it is possible to project out in an exact manner the lowest eigenstate of Schrödinger equations. Taking into account the nodeless property of the lowest eigenstate one can replace the full Schrödinger equation by a moment problem whose measure is the eigenstate itself. The infinite set of positivity inequalities linked to this moment problem provides a framework which allows to compute sequences of upper and lower bounds to the unknown eigenvalue and eigenfunction.The effective computation is based on deep convexity properties embedded in the set of hierarchical inequalities associated to this moment problem. The convexity allows to get the bounds through linear programming. We illustrate the method with simple one dimensional problems.Laboratoire de la Direction des Sciences de la Matière du Commissariat à l'Energie Atomique.