Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation

In this paper,we consider a class of quadratic maximization problems.For a subclass of the problems,we show that the SDP relaxation approach yields an approximation solution with the ratio is dependent on the data of the problem with α being a uniform lower bound.In light of this new bound,we show that the actual worst-case performance ratio of the SDP relaxation approach (with the triangle inequalities added) is at least α δd if every weight is strictly positive,where δd ＞ 0 is a constant depending on the problem dimension and data.     

Surfaces of revolution in the Heisenberg group and the spectral generalization of the Willmore functional

We study the generalization of the Willmore functional for surfaces in the three-dimensional Heisenberg group. Its construction is based on the spectral theory of the Dirac operator entering into theWeierstrass representation of surfaces in this group. Using the surfaces of revolution we demonstrate that the generalization resembles the Willmore functional for the surfaces in the Euclidean space in many geometrical aspects. We also observe the relation of these functionals to the isoperimetric problem.     

一类椭圆型方程的多重解

利用极小极大方法获得了一类Dirichlet问题多重解的存在性结果.     

Sharp condition of global existence for second-order derivative nonlinear Schrödinger equations in two space dimensions

This paper discusses a class of second-order derivative nonlinear Schrödinger equations which are used to describe the upper-hybrid oscillation propagation. By establishing a variational problem, applying the potential well argument and the concavity method, we prove that there exists a sharp condition for global existence and blow-up of the solutions to the nonlinear Schrödinger equation. In addition, we also answer the question: how small are the initial data, the global solutions exist?     

Runge–Kutta interpolants for high precision computations

Runge–Kutta (RK) pairs furnish approximations of the solution of an initial value problem at discrete points in the interval of integration. Many techniques for enriching these methods with continuous approximations have been proposed. Here we construct C ¹ continuous, eighth and ninth order interpolation methods for a recently appeared RK pair of orders 9(8). These interpolants share a very small leading truncation error making them suitable for use at quadruple precision, i.e. 32–33 decimal digits of accuracy. Extended numerical results justify our effort.     

Solution of monotone complementarity problems with locally Lipschitzian functions

The paper deals with complementarity problems CP(F), where the underlying functionF is assumed to be locally Lipschitzian. Based on a special equivalent reformulation of CP(F) as a system of equationsφ(x)=0 or as the problem of minimizing the merit functionΘ=1/2∥Φ∥ ₂ ² , we extend results which hold for sufficiently smooth functionsF to the nonsmooth case. In particular, ifF is monotone in a neighbourhood ofx, it is proved that 0 εδθ(x) is necessary and sufficient forx to be a solution of CP(F). Moreover, for monotone functionsF, a simple derivative-free algorithm that reducesΘ is shown to possess global convergence properties. Finally, the local behaviour of a generalized Newton method is analyzed. To this end, the result by Mifflin that the composition of semismooth functions is again semismooth is extended top-order semismooth functions. Under a suitable regularity condition and ifF isp-order semismooth the generalized Newton method is shown to be locally well defined and superlinearly convergent with the order of 1+p.     

A parallel version of the preconditioned conjugate gradient method for boundary element equations

The parallel version of precondition techniques is developed for matrices arising from the Galerkin boundary element method for two-dimensional domains with Dirichlet boundary conditions. Results were obtained for implementations on a transputer network as well as on an nCUBE-2 parallel computer showing that iterative solution methods are very well suited for a MIMD computer. A comparison of numerical results for iterative and direct solution methods is presented and underlines the superiority of iterative methods for large systems.     

无穷区间上二阶微分方程的边值问题

利用Schauder不动点定理讨论了一类非线性二阶微分方程在无穷区间上的边值问题无界解的存在性，部分改进了郭大钧教授最近得到的结果。     

解线性及二次型规划问题增广的神经网络

本文提出了一个解线性及二次型规划问题的神经网络模型，证明了该网络是全局稳定于平衡点，而平衡点就是线性及二次型规划问题的解，该网络的优点是能够实时获得问题的精确解，且可以同时获得带等式不式约束的对偶问题解，该网络易于电路实现。     

解Job－Shop调度问题的一个遗传算法

本文首先介绍了遗传算法的基本概念和流程，然后叙述了如何把Ｊｏｂ－Ｓｈｏｐ调度问题编码成为遗传算法的形式，并解释了对于实现这一算法中一些问题的考虑．最后给出了算法运行结果并对结果与算法做了总结。