Extension of Transient Resolvents

For a submarkovian resolvent U=(U )_>0 with bounded initial kernel U ₀ on a Radon space X, we construct a minstable cone of potentials C on a compact metrizable space YX such that U extends to a subordonated (to C) resolvent on Y.     

Cone Spline Surfaces and Spatial Arc Splines – a Sphere Geometric Approach

Basic sphere geometric principles are used to analyze approximation schemes of developable surfaces with cone spline surfaces, i.e., G ¹-surfaces composed of segments of right circular cones. These approximation schemes are geometrically equivalent to the approximation of spatial curves with G ¹-arc splines, where the arcs are circles in an isotropic metric. Methods for isotropic biarcs and isotropic osculating arc splines are presented that are similar to their Euclidean counterparts. Sphere geometric methods simplify the proof that two sufficiently close osculating cones of a developable surface can be smoothly joined by a right circular cone segment. This theorem is fundamental for the construction of osculating cone spline surfaces. Finally, the analogous theorem for Euclidean osculating circular arc splines is given.     

On individual stability of semigroups

Let be a -semigroup with generator on a Banach space . Let be a fixed element. We prove the following individual stability results.

(i) Suppose is an ordered Banach space with weakly normal closed cone and assume there exists such that for all . If the local resolvent admits a bounded analytic extension to the right half-plane 0\}$">, then for all and we have

(ii) Suppose is a rearrangement invariant Banach function space over with order continuous norm. If is an element such that defines an element of , then for all and we have

     

锥Pf的若干性质

利用实赋范线性空间E上非零连续线性泛函f,确定了E上半序关系和锥Pf,证明了锥Pf的几个性质,给出了H ilbert空间中Pf的对偶锥的表现形式及由Pf确定的H ilbert投影距离与T hom pson距离.     

滩海地区运移聚集的精细数值模拟和分析

对滩海地区三层油资源运移聚集进行高精度精细平行数值模拟,提出数学模型和精细平行算子分裂隐式迭代格式,设计了并行计算程序,提出了并行计算的信息传递和交替方向网格剖分方法. 并对不同的CPU组合进行并行计算和分析,对滩海地区数值模拟结果和实际情况吻合.对模型问题进行数值分析,得到最佳阶误差估计,成功地解决了这一困难问题．     

偏锥b-度量空间中的不动点定理

在偏锥度量空间的基础上,介绍了偏锥b-度量空间的相关概念,提出了偏锥b-度量空间和锥b-度量空间的关系,并给出了一个简单的例子,最后研究了偏锥b-度量空间中在没有正规性的条件下的一些不动点定理,从而推广了巴拿赫压缩原理.     

A Modified Relaxation Scheme for Mathematical Programs with Complementarity Constraints

In this paper, we consider a mathematical program with complementarity constraints. We present a modified relaxed program for this problem, which involves less constraints than the relaxation scheme studied by Scholtes (2000). We show that the linear independence constraint qualification holds for the new relaxed problem under some mild conditions. We also consider a limiting behavior of the relaxed problem. We prove that any accumulation point of stationary points of the relaxed problems is C-stationary to the original problem under the MPEC linear independence constraint qualification and, if the Hessian matrices of the Lagrangian functions of the relaxed problems are uniformly bounded below on the corresponding tangent space, it is M-stationary. We also obtain some sufficient conditions of B-stationarity for a feasible point of the original problem. In particular, some conditions described by the eigenvalues of the Hessian matrices mentioned above are new and can be verified easily. This work was supported in part by the Scientific Research Grant-in-Aid from the Ministry of Education, Science, Sports, and Culture of Japan. The authors are grateful to an anonymous referee for critical comments.     

Function cones and interpolation

We consider interpolation of operators acting on functions that belong to a given cone Q with the so‐called decomposition property. The set of all positive functions whose level sets are the level sets of a given function is the main example, and the cone of all decreasing functions is a particular case. As applications, we obtain conditions for the identity (E₀ ∩ Q,E₁ ∩ Q)_θ,p = (E₀,E₁)_θ,p ∩ Q and interpolation results for operators which are bounded when restricted to a given family of characteristic funcions. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov–Todd step

In this paper we propose a primal-dual path-following interior-point algorithm for second-order cone optimization. The algorithm is based on a new technique for finding the search directions and the strategy of the central path. At each iteration, we use only full Nesterov–Todd step. Moreover, we derive the currently best known iteration bound for the algorithm with small-update method, namely, , where N denotes the number of second-order cones in the problem formulation and ε the desired accuracy.