Modulus-Based GSTS Iteration Method for Linear Complementarity Problems

In this paper, a modulus-based generalized skew-Hermitian triangular splitting (MGSTS) iteration method is present for solving a class of linear complementarity problems with the system matrix either being an $H_+$-matrix with non-positive off-diagonal entries or a symmetric positive definite matrix. The convergence of the MGSTS iteration method is studied in detail. By choosing different parameters, a series of existing and new iterative methods are derived, including the modulus-based Jacobi (MJ) and the modulus-based Gauss-Seidel (MGS) iteration methods and so on. Experimental results are given to show the effectiveness and feasibility of the new method when it is employed for solving this class of linear complementarity problems.     

广义KdV--BO方程的Cauchy问题的局部适定性的改进结果

In this paper we prove that the Cauchy problem associated with the generalized KdV-BO equation ut ＋ uxxx ＋ λH（uxx） ＋ u^2ux = 0, x ∈ R, t ≥ 0 is locally wellposed in Hr^s（R） for 4/3 〈r≤2, b〉1/r and s≥s（r）= 1/2- 1/2r. In particular, for r = 2, we reobtain the result in [3].     

一类强阻尼非线性波动方程的广义解

用Galerkin方法研究了一类非线性波动方程的初边值问题,证明其在一定条件下强解的存在性.     

改进蚁群算法优化周期性车辆路径问题

周期性车辆路径问题(PVRP)是标准车辆路径问题(VRP)的扩展,PVRP将配送期由单一配送期延伸到T(T＞1)期,因此,PVRP需要优化每个配送期的顾客组合和配送路径。由于PVRP是一个内嵌VRP的问题,其比标准VRP问题更加复杂,难于求解。本文采用蚁群算法对PVRP进行求解,并提出采用两种改进措施——多维信息素的运用和基于扫描法的局部优化方法来提高算法的性能。最后,通过9个经典PVRP算例对该算法进行了数据实验,结果表明本文提出的改进蚁群算法求解PVRP问题是可行有效的,同时也表明两种改进措施可以显著提高算法的性能。     

Spectral analysis for the Gauss problem on continued fractions

We present a new derivation of the formula appearing in Babenko (1978) and Mayer and Roepstorff (1987) that gives the probability distribution of τ⁻ⁿ${\tau }^{-n}$ in terms of the eigenvalues of a symmetric operator. Here τ$\tau$ is the well-known Gauss-map.     

Improved trial methods for a class of generalized Bernoulli problems

The aim of this article is to develop improved trial methods for the solution of a generalized exterior Bernoulli free boundary problem. At the free boundary, we prescribe the Neumann boundary condition and update the free boundary with the help of the remaining Dirichlet boundary condition. Appropriate update rules are obtained by expanding the state's Dirichlet data at the actual boundary via a Taylor expansion of first and second order. The resulting trial methods converge linearly for both cases, although the trial method based on the second order Taylor expansion is much more robust. Nevertheless, via results of shape sensitivity analysis, we are able to modify the update rules such that their convergence is improved. The feasibility of the proposed trial methods and their performance is demonstrated by numerical results.     

Requiem for the Miller–Tucker–Zemlin subtour elimination constraints?

The Miller–Tucker–Zemlin (MTZ) Subtour Elimination Constraints (SECs) and the improved version by Desrochers and Laporte (DL) have been and are still in regular use to model a variety of routing problems. This paper presents a systematic way of deriving inequalities that are more complicated than the MTZ and DL inequalities and that, in a certain way, “generalize” the underlying idea of the original inequalities. We present a polyhedral approach that studies and analyses the convex hull of feasible sets for small dimensions. This approach allows us to generate generalizations of the MTZ and DL inequalities, which are “good” in the sense that they define facets of these small polyhedra. It is well known that DL inequalities imply a subset of Dantzig–Fulkerson–Johnson (DFJ) SECs for two-node subsets. Through the approach presented, we describe a generalization of these inequalities which imply DFJ SECs for three-node subsets and show that generalizations for larger subsets are unlikely to exist. Our study presents a similar analysis with generalizations of MTZ inequalities and their relation with the lifted circuit inequalities for three node subsets.     

General Quantum Meet-in-the-Middle Search Algorithm Based on Target Solution of Fixed Weight

Similar to the classical meet-in-the-middle algorithm, the storage and computation complexity are the key factors that decide the efficiency of the quantum meet-in-the-middle algorithm. Aiming at the target vector of fixed weight, based on the quantum meet-in-the-middle algorithm, the algorithm for searching all n-product vectors with the same weight is presented, whose complexity is better than the exhaustive search algorithm. And the algorithm can reduce the storage complexity of the quantum meet-in-the-middle search algorithm. Then based on the algorithm and the knapsack vector of the Chor-Rivest public-key crypto of fixed weight d, we present a general quantum meet-in-the-middle search algorithm based on the target solution of fixed weight, whose computational complexity is ∑_j^d=(0(√C_n-k+1^d-j)+O(C_k^jlogC_k^j)) with ∑_i=0^dC_kⁱ memory cost. And the optimal value of k is given. Compared to the quantum meet-in-the-middle search algorithm for knapsack problem and the quantum algorithm for searching a target solution of fixed weight, the computational complexity of the algorithm is lower. And its storage complexity is smaller than the quantum meet-in-the-middle-algorithm.     

非线性奇异三阶微分方程周期边值问题的正解

讨论非线性奇异三阶微分方程的周期边值问题{u″＋ρ^3u=f（t,u）,t∈I=（0,2π）,ρ∈（0,1/√3）是常数 u^（i）（0）=u^（t）（2π）,i=0,1,2 的正解存在性问题．通过与一个线性算子相关的第一特征值的讨论,运用不动点指数定理,得到了正解存在的结果．     

半正奇异边值问题二阶脉冲微分方程正解的存在性

应用锥上的不动点指数理论,研究固定时刻脉冲作用的奇异半正Dirichlet边值问题,给出了系统至少一个正解存在的充分条件,同时给出了具体的例子,改进了蒋达清等人的结果．