Interior-point algorithm for quadratically constrained entropy minimization problems

In this paper, we develop an interior point algorithm for quadratically constrained entropy problems. The algorithm uses a variation of Newton's method to follow a central path trajectory in the interior of the feasible set. The primal-dual gap is made less than a given in at most steps, wheren is the dimension of the problem andm is the number of quadratic inequality constraints.     

A semi-discretization method based on quartic splines for solving one-space-dimensional hyperbolic equations

In this paper, based on C³ quartic splines, a semi-discretization method containing two schemes is constructed to solve one-space-dimensional linear hyperbolic equations. It is shown that both schemes are unconditionally stable and their approximation orders are of O(k⁵+h⁴) and of O(k⁷+h⁴) with k and h being step sizes in time and space, respectively, which are much higher than those of other published schemes. A numerical example is presented and the results are compared with other published numerical results.     

Local bifurcations of critical periods for cubic Liénard equations with cubic damping

Continuing Chicone and Jacobs’ work for planar Hamiltonian systems of Newton’s type, in this paper we study the local bifurcation of critical periods near a nondegenerate center of the cubic Liénard equation with cubic damping and prove that at most 2 local critical periods can be produced from either a weak center of finite order or the linear isochronous center and that at most 1 local critical period can be produced from nonlinear isochronous centers.     

Center and isochronous center problems for quasi analytic systems

This paper considers the problems of determining center or focus and isochronous centers for the planar quasi-analytic systems. Two recursive formulas to determine the focal values and period constants are given. The convergence of first integral near the center is proved. Using the general results to quasi-quadratic systems, the problem of the isochronous center of the origin is completely solved. This research is partially supported by the National Natural Science Foundation of China (10671179 and 10771196) and the Natural Science Foundation of Yunnan Province (2005A0092M)     

Brauer代数的中心维数问题

Brauer代数B_n(t)是一种在表示论,数学物理中重要的带一个参数t的有限维代数.当t取普通值时它们的结构已经了解得比较清楚,例如,不可约表示分类.当t取某些特殊值时有关它们还仍有些问题未探明.本文讨论任意参数时Brauer代数的中心的维数问题.主要结论是当t取某些特殊值时,Brauer代数中心的维数必定大于或等于t取普通值时它们的维数.     

Approximating the maximum 2- and 3-edge-colorable subgraph problems

For a fixed value of a parameter k≥2, the Maximum k-Edge-Colorable Subgraph Problem consists in finding k edge-disjoint matchings in a simple graph, with the goal of maximising the total number of edges used. The problem is known to be -hard for all k, but there exist polynomial time approximation algorithms with approximation ratios tending to 1 as k tends to infinity. Herein we propose improved approximation algorithms for the cases of k=2 and k=3, having approximation ratios of 5/6 and 4/5, respectively.     

李color三系的Frattini子系的性质

给出了李color三系的Frattini子系的定义,得到了李color三系的Frattini子系的一些性质·特别的,证明了李color三系T有分解T=T_1⊕T_2⊕…⊕T_m,则φ(T)有分解φ(T)=φ(T_1)⊕φ(T_2)⊕…⊕φ(T_m).     

基于三角模糊数序列的灰色预测模型

以GM(1,1)模型为代表的灰色预测模型是以精确数序列为基础,难以满足实际需要.为了使灰色模型适应于模糊数序列,具体给出了一种基于三角模糊数序列的建模方法,这种方法也可以实现对二元区间模糊数和梯形模糊数序列的建模.首先由三角模糊数序列得出三个含有等量信息的精确数序列:重心序列、隶属函数的覆盖面积序列和中界点序列,对这三个序列分别建模后,再导出原始三角模糊数序列的三个界点的预测模型.这种建模方法既保持了模糊数的整体性又提高了建模序列的光滑度,提高了预测精度.最后进行了多组随机三角模糊数序列的数据模拟,验证了模型的有效性.     

一维紧邻时间随机环境下可逗留随机游动的有关性质

给出了可数状态空间中时间随机环境下可逗留随机游动的一个统一模型,对于一维紧邻时间随机环境下的随机游动,在一定的条件下,讨论它的极限性质和中心极限定理,该结论类似于空间随机环境下的随机游动的有关结论.