矩阵的正规化

本文考虑ｎ阶复矩阵可嵌入到ｎ＋１阶的正规矩阵的条件．证明了ｎ＞２阶的复矩阵不一定可嵌入到ｎ＋１阶的正规矩阵,而２阶复矩阵总可嵌入到３阶正规矩阵中．本文还证明了任意ｎ阶复方阵可嵌入到２ｎ阶正规矩阵中     

Superconvergence of three dimensional Morley elements on cuboid meshes for biharmonic equations

In the present paper, superconvergence of second order, after an appropriate postprocessing, is achieved for three dimensional first order cuboid Morley elements of biharmonic equations. The analysis is dependent on superconvergence of second order for the consistency error and a corrected canonical interpolation operator, which help to establish supercloseness of second order for the corrected canonical interpolation. Then the final superconvergence is derived by a standard postprocessing. For first order nonconforming finite element methods of three dimensional fourth order elliptic problems, it is the first time that full superconvergence of second order is obtained without an extra boundary condition imposed on exact solutions. It is also the first time that superconvergence is established for nonconforming finite element methods of three dimensional fourth order elliptic problems. Numerical results are presented to demonstrate the validity of the theoretical results.     

On Order Bounded Subsets of Locally Solid Riesz Spaces

In a topological Riesz space there are two types of bounded subsets: order bounded subsets and topologically bounded subsets. It is natural to ask (1) whether an order bounded subset is topologically bounded and (2) whether a topologically bounded subset is order bounded. A classical result gives a partial answer to (1) by saying that an order bounded subset of a locally solid Riesz space is topologically bounded. This paper attempts to further investigate these two questions. In particular, we show that (i) there exists a non-locally solid topological Riesz space in which every order bounded subset is topologically bounded; (ii) if a topological Riesz space is not locally solid, an order bounded subset need not be topologically bounded; (iii) a topologically bounded subset need not be order bounded even in a locally convex-solid Riesz space. Next, we show that (iv) if a locally solid Riesz space has an order bounded topological neighborhood of zero, then every topologically bounded subset is order bounded; (v) however, a locally convex-solid Riesz space may not possess an order bounded topological neighborhood of zero even if every topologically bounded subset is order bounded; (vi) a pseudometrizable locally solid Riesz space need not have an order bounded topological neighborhood of zero. In addition, we give some results about the relationship between order bounded subsets and positive homogeneous operators.     

The L* Partial Order on the Set of Group Matrices

In this paper,we use the L(o)wner partial order and the star partial order to introduce a new partial order (denoted by "L*") on the set of group matrices,and get some characteristics and properties of the new partial order.In particular,we prove that the L* partial order is a special kind of the core par-tial order and it is equivalent to the star partial order under some conditions.We also illustrate its difference from other partial orders with examples and find out under what conditions it is equivalent to other partial orders.     

两类随机控制风险秩序的等价性分析

本文首先对比分析了两类风险秩序:随机控制秩序与对偶随机控制秩序.得到并证明了下述命题:(1)效用自由秩序等价于随机控制秩序;(2)畸变自由秩序等价于对偶随机控制秩序;(3)第一、第二阶随机控制秩序等价于第一、第二阶的对偶随机控制秩序,但对高于三阶的情况由实例说明不一定成立.     

同城货运众包平台的车货匹配模式对比研究

针对目前同城货运车货匹配平台采用抢单模式造成客户等待时间较长、客户满意度不高的问题,提出将派单模式应用于同城货运车货匹配过程,构建以客户平均等待时长最短为目标的动态车货匹配模型。根据抢单模式实际情况设计了就近随机配对算法,针对派单模式设计了滚动时域完美匹配算法,运用模拟仿真研究方法,对比研究了两种算法的有效性和适用性,发现订单饱和度大时宜采用派单模式,且滚动时域越短客户平均等待时长越短。研究结果可为同城货运车货匹配平台的订单分配提供决策支持,提高客户满意度。     

How to avoid accuracy and order reduction in Runge–Kutta methods as applied to stiff problems

The solution of stiff problems is frequently accompanied by a phenomenon known as order reduction. The reduction in the actual order can be avoided by applying methods with a fairly high stage order, ideally coinciding with the classical order. However, the stage order sometimes fails to be increased; moreover, this is not possible for explicit and diagonally implicit Runge–Kutta methods. An alternative approach is proposed that yields an effect similar to an increase in the stage order. New implicit and stabilized explicit Runge–Kutta methods are constructed that preserve their order when applied to stiff problems.     

What are second order hyperbolic systems?

On adopting the usual view that a second order differential system is hyperbolic provided that the equivalent first order one is, a theorem is proved which offers an intrinsic procedure to check hyperbolicity of second order systems. In deducing such result, the link between second order and first order systems is analyzed in detail and a number of relevant results is proved.     

Steiner triple systems of order 19 and 21 with subsystems of order 7

Steiner triple systems (STSs) with subsystems of order 7 are classified. For order 19, this classification is complete, but for order 21 it is restricted to Wilson-type systems, which contain three subsystems of order 7 on disjoint point sets. The classified STSs of order 21 are tested for resolvability; none of them is doubly resolvable.     

Pattern avoidance and the Bruhat order

The structure of order ideals in the Bruhat order for the symmetric group is elucidated via permutation patterns. The permutations with boolean principal order ideals are characterized. These form an order ideal which is a simplicial poset, and its rank generating function is computed. Moreover, the permutations whose principal order ideals have a form related to boolean posets are also completely described. It is determined when the set of permutations avoiding a particular set of patterns is an order ideal, and the rank generating functions of these ideals are computed. Finally, the Bruhat order in types B and D is studied, and the elements with boolean principal order ideals are characterized and enumerated by length.     

Classification of ordinary differential equations by conditional linearizability and symmetry

Lie’s invariant criteria for determining whether a second order scalar equation is linearizable by point transformation have been extended to third and fourth order scalar ordinary differential equations (ODEs). By differentiating the linearizable by point transformation scalar second order ODE (respectively third order ODE) and then requiring that the original equation holds, what is called conditional linearizability by point transformation of third and fourth order scalar ODEs, is discussed. The result is that the new higher order nonlinear ODE has only two arbitrary constants available in its solution. One can use the same procedure for the third and fourth order extensions mentioned above to get conditional linearizability by point or other types of transformation of higher order scalar equations. Again, the number of arbitrary constants available will be the order of the original ODE. A classification of ODEs according to conditional linearizability by transformation and classifiability by symmetry are proposed in this paper.     

Optimality and mixed saddle point criteria in multiobjective optimization

In this paper, higher order strong convexity for Lipschitz functions is introduced and is utilized to derive the optimality conditions for the new concept of strict minimizer of higher order for a multiobjective optimization problem. Variational inequality problem is introduced and its solutions are related to the strict minimizers of higher order for a multiobjective optimization problem. The notion of vector valued partial Lagrangian is also introduced and equivalence of the mixed saddle points of higher order and higher order minima are provided.     

常微分方程(组)的高次积分因子与高次积分及其微分特征列集算法

考虑了一般微分方程(组)高次积分和其微分特征列集(吴方法)机械化确定算法.首先提出微分方程的积分因子和首次积分的推广高次积分因子与其对应的高次积分的概念.其次给出了由高次积分因子确定其对应的高次积分的计算公式,使确定高次积分的问题转化为求高次积分因子的问题.再其次对确定高次积分因子的问题,给出了微分特征列集算法.最后用给定的算法确定了二阶和三阶微分方程拥有高次积分的结构定理,并给出了具体的算例和结论.     

A Third Order Small Parameter Method and Its Nordsieck Expression

A third order small parameter method and its Nordsieck expression are given in this paper. It is based on Gear's method of order 2 and order 3. For moderate stiff problems this method is suitable. In [1] we proposed a second order numerical method for stiff ODEs. The purpose of this paper is to raise the order from 2 to 3 and give its Nordsieck expression, making it automatically suit varying stepsize calculation.     

Second order duality in fuzzy mathematical programming with fuzzy coefficients

In this paper, the concept of second order convexity of fuzzy mappings with fuzzy order relation under ranking function is used to formulate a second order duality for fuzzy mathematical programming problems with fuzzy coefficients, where all the fuzzy mappings are twice differentiable. Also, Wolfe’s dual of these problems under ranking function is investigated, and finally, an advantage of second order duality with respect to first order duality is stated.     

基于交易量的最优指令提交策略模型

构建了两个价位的指令驱动市场模型.交易者根据自己的估值选择提交限价指令或市价指令.假设交易量作为交易者的禀赋,可在一个连续区间上任意取值,从而提出限价收益曲线的概念,并结合该曲线给出基于交易量的最优指令提交策略时.最优指令提交策略不仅依赖于交易者的私人估值、市场深度和价差,同时依赖于交易者所持交易量.模型揭示以下几点微观特征:1.私人估值偏离证券基本价值较大的交易者倾向于提交市价订单,而私人估值接近证券基本价值的交易者倾向于提交限价订单;2.当市场深度较小时,交易者倾向于限价单;而市场深度较大时,交易者倾向于提交市价单;3.随价差的增加,交易者更倾向于提交限价订单.     

Necessary conditions for stochastic optimal control problems in infinite dimensions

The purpose of this paper is to establish the first and second order necessary conditions for stochastic optimal controls in infinite dimensions. The control system is governed by a stochastic evolution equation, in which both drift and diffusion terms may contain the control variable and the set of controls is allowed to be nonconvex. Only one adjoint equation is introduced to derive the first order necessary optimality condition either by means of the classical variational analysis approach or, under an additional assumption, by using differential calculus of set-valued maps. More importantly, in order to avoid the essential difficulty with the well-posedness of higher order adjoint equations, using again the classical variational analysis approach, only the first and the second order adjoint equations are needed to formulate the second order necessary optimality condition, in which the solutions to the second order adjoint equation are understood in the sense of the relaxed transposition.     

On the Structure of Order Domains

The notion of an order domain is generalized. The behaviour of an order domain by taking a subalgebra, the extension of scalars, and the tensor product is studied. The relation of an order domain with valuation theory, Gröbner algebras, and graded structures is given. The theory of Gröbner bases for order domains is developed and used to show that the factor ring theorem and its converse, the presentation theorem, hold. The dimension of an order domain is related to the rank of its value semigroup.     

Optimal ordering policies in inventory systems with random demand and random deal offerings

In this paper, we determine the optimal order policies for a firm facing random demand and random deal offerings. In a periodic review setting, a firm may first place an order at the regular price. Later in the period, if a price promotion is offered by the supplier (with a certain probability), the firm may decide to place another order. We consider two models in the paper. In the first model, the firm does not share the cost savings (due to the promotion offered by the supplier) with its own customers, i.e. its demand distribution remains fixed. In the second model, the cost savings are shared with the final customers. As a result, the demand distribution shifts to the right. For both the models, in a dynamic finite-horizon problem, the order policy structure is divided into three regions and is as follows. If the initial inventory level for the firm exceeds a certain threshold level, it is optimal not to order anything. If it is in the medium range, it is optimal to wait for the promotion and order only if it is offered. The order quantity when the promotion is offered has an ‘order up to’ policy structure. Finally, if the inventory level is below another threshold, it is optimal to place an order at the regular price, and to place a second order if the promotion is offered. The low initial inventory level makes it risky to just wait for the promotion to be offered. The sum of the order quantities in this case has an ‘order up to’ structure. Finally, we model the supplier's problem as a Stackelberg game and discuss the motivation for the supplier to offer a promotion for the case of uniform demand distribution for the firm. In the first model (when the firm does not share the cost savings with its customers), we show that it is rarely optimal for the supplier to offer a promotion. In the second model, the supplier may offer a promotion depending on the price elasticity of the product.     

关于次序统计量广义TTT序的几个结果

研究了次序统计量在广义TTT变换序(TTT变换序)和剩余财富序下的性质. 讨论了寿命分布类NBUT在增凹变换下的封闭性以及NWUT寿命分布在次序统计量下的特征.