拉单晶问题数学模型弱解的存在性和唯一性

本文考虑楔形区域Ｇ０Ｔ上的二相自由边界问题：其中ａ，ｂ，ｂ１，νｐ，ｈ２为正常数。本文在适当的假设之下，证明了上述定解问题弱解的存在性和唯一性。     

A parallel algorithm for solving the linear complementarity problem

The concept of multitasking mathematical programs is discussed, and an application of multitasking to the multiple-cost-row linear programming problem is considered. Based on this, an algorithm for solving the Linear Complementarity Problem (LCP) in parallel is presented. A variety of computational results are presented using this multitasking approach on the CRAY X-MP/48. These results were obtained for randomly generated LCP's where thenxn dense matrixM has no special properties (hence, the problem is NP-hard). based on these results, an average time performance ofO(n ⁴) is observed.     

On the computational complexity of piecewise-linear homotopy algorithms

We show that piecewise-linear homotopy algorithms may take a number of steps that grows exponentially with the dimension when solving a system of linear equations whose solution lies close to the starting point. Our examples are based on an example of Murty exhibiting exponential growth for Lemke's algorithm for the linear complementarity problem.This research was supported in part by NSF grant ECS-7921279 and by a Guggenheim Fellowship.     

A note on node aggregation and Benders' decomposition

Node aggregation methods have been previously studied as a means for approximating large scale transportation problems. In this paper, we show how the approximations inherent in Benders' decomposition method can be combined with node aggregation in optimizing large scale capacitated plant location problems. This research was supported by the National Science Foundation under Grant No. ECS-8117105.     

Similarity Solution of the Flamant Problem by Means of a One-Parameter Group Transformation

The two-dimensional point load problem on a linear elastic half plane is solved using a one-parameter group transformation of the biharmonic equation. This solution technique allows the incorporation of the singular load directly through use of the Dirac delta function. The resulting fourth-order ordinary differential equation, while formidable in appearance, is exact and is readily solved through simple integration.     

The traveling salesman problem in graphs with some excluded minors

Given a graph and a length function defined on its edge-set, the Traveling Salesman Problem can be described as the problem of finding a family of edges (an edge may be chosen several times) which forms a spanning Eulerian subgraph of minimum length. In this paper we characterize those graphs for which the convex hull of all solutions is given by the nonnegativity constraints and the classical cut constraints. This characterization is given in terms of excluded minors. A constructive characterization is also given which uses a small number of basic graphs.     

A quadratic assignment formulation of the molecular conformation problem

The molecular conformation problem is discussed, and a concave quadratic global minimization approach for solving it is described. This approach is based on a quadratic assignment formulation of a discrete approximation to the original problem.     

关于n阶微分方程边值问题（Ⅲ）——奇摄动的渐近展开

本文研究n阶非线性过值问题(NB)的奇异摄动。在较一般的条件下,应用高阶微分不等式理论证明了摄动解的存在性,并给出了摄动解直到n阶导函数的一致有效渐近展开式,推广和改进了已有的结果。     

Network analysis of eigenvalue problem for multilayer dielectric waveguide consisting of arbitrary number of layers

In this paper, the eigenvalue problem of a multilayer dielectric waveguide consisting of arbitrary number of layers is solved by the microwave network method. A general program with the function of computer graphics has been developed for analyzing the dispersion characteristics and the electromagnetic field distributions of an N layer dielectric waveguide. As examples of practical applications of the program, first, the dispersions and field patterns for the planar waveguides with refractive index of parabolic and exponential profiles are analyzed. Secondly, the procedure of mode conversion and mode separation in dielectric branching waveguides is vividly demonstrated through analyzing the field distributions of asymmetric multilayer dielectric structures and the general rules of mode conversion are discussed. The examples show that the present method possesses the advantages of versatility, rapidity, simplicity and accuracy.     

A note on heuristics for the traveling salesman problem

We introduce subclasses of the traveling salesman problem (TSP) and analyze the behaviour of heuristics on them. We derive bounds for the performance of the algorithms.