区间参数结构振动问题的矩阵摄动法

当结构的参数具有不确定性时，结构的固有频率也将具有某种程度的不确定性．本文讨论了区间参数结构的振动问题，将区间参数结构的特征值问题归结为两个不同的特征值问题来求解．提出了求解区间参数结构振动问题的矩阵摄动方法．数值运算结果表明，本文所提出方法具有运算量小，结果精度高等优点．     

(D6,Z2)-等变分歧问题的识别

利用奇点理论中光滑映射芽的接触等价，研究状态变量和分歧参数均具有对称性的等变分歧问题，给出了状态变量具有D。对称性，分歧参数具有Z2对称性的等变分歧问题的两个识别条件．     

一类非线性规划问题的研究

一些具有特殊结构的非线性规划问题我们已得到了很好的结果，本文研究一种具有特殊结构非线性规划问题的推广问题。     

处理机具有不同开始加工时间的可中断排序问题

本文对处理机具有的不同开始加工时间的可中断排序问题进行讨论，得到下面结论：若处理机具有相同开始加工时间的可中断排序问题存在最优排序算法，则相应的处理机具有不同开始加工时间的可中断排序问题也存在最优排序算法。     

关于Lax-Milgram定理和Cea定理的一个注记

本文研究抽象变分问题（不必要求具有强制性）的Galerhin方法，利用泛函分析理论证明了：若变分问题的Galerkin逼近问题存在唯一解，那么它本身的解存在唯一且可由Galerhin逼近解无限逼近的充要条件是其Galerkin逼近格式具有某种稳定性．此结果是对Lax-Milgram定理和Cea定理的补充，可以应用于不必具有强制性的变分问题．     

非线性反应扩散方程奇摄动问题

研究了具有非线性反应扩散方程奇摄动问题。在适当的条件下，利用微分不等式理论，讨论了当退化问题具有两个相交解时，原初始边值问题解的渐近性态。      

直接解规范型线性规划问题的Karmarkar算法

直接解规范型线性规划问题的Ｋａｒｍａｒｋａｒ算法刁在筠，李玉领（山东大学数学系，济南２５０１００）１引言解线性规划问题的各种内点算法多数是针对具有等式约束和非负变量的问题设计的，而某些采取了对偶公式的内点算法又是针对具有不等式约束和自由变量的问题设计...     

平面Laplace问题的等价间接变量边界积分方程

利用变分法证明平面调和函数的外问题的确切形式；在此基础上，建立外问题的具有间接变量的等价边界积分方程；传统的外问题及边界积分方程不具有普遍适用性，本文对此进行了详细的讨论．     

三角债清理的模型与算法

本文用图论和网络的观点研究了三角债问题，建立了解决三角债问题的网络模型，给出了为解决三角债所需投入的最少资金的计算公式及具体操作方法，这一研究无疑具有很强的理论意义和实际意义，所提供的算法也具有较好的可操作性。     

竞争态势下的企业技术创新能力评价

企业技术创新能力的评价问题，具有指标量大，同时又具有模糊性的特点。本针对企业技术创新能力评价中存在的问题，构建企业技术创新能力评价的系统指标体系，应用模糊数学中的综合判断方法。对企业技术创新能力进行定量和综合的判断。     

Convergence of algorithms for perturbed optimization problems

Infinite-dimensional optimization problems occur in various applications such as optimal control problems and parameter identification problems. If these problems are solved numerically the methods require a discretization which can be viewed as a perturbation of the data of the optimization problem. In this case the expected convergence behavior of the numerical method used to solve the problem does not only depend on the discretized problem but also on the original one. Algorithms which are analyzed include the gradient projection method, conditional gradient method, Newton's method and quasi-Newton methods for unconstrained and constrained problems with simple constraints.     

A new constraint test-case generator and the importance of hybrid optimizers

In the past decade, significant progress has been made in understanding problem complexity of discrete constraint problems. In contrast, little similar work has been done for constraint problems in the continuous domain. In this paper, we study the complexity of typical methods for non-linear constraint problems and present hybrid solvers with improved performance. To facilitate the empirical study, we propose a new test-case generator for generating non-linear constraint satisfaction problems (CSPs) and constrained optimization problems (COPs). The optimization methods tested include a sequential quadratic programming (SQP) method, a penalty method with a fixed penalty function, a penalty method with a sequence of penalty functions, and an augmented Lagrangian method. For hybrid solvers, we focus on the form that combines two or more optimization methods in sequence. In the experiments, we apply these methods to solve a series of continuous constraint problems with increasing constraint-to-variable ratios. The test problems include artificial benchmark problems from the test-case generator and problems derived from controlling a hyper-redundant modular manipulator. We obtain novel results on complexity phase transition phenomena of the various methods. Specifically, for constraint satisfaction problems, the SQP method is the best on weakly constrained problems, whereas the augmented Lagrangian method is the best on highly constrained ones. Although the static penalty method performs poorly by itself, by combining it with the SQP method, we show a hybrid solver that is significantly better than any of the individual methods on problems with moderate to large constraint-to-variable ratios. For constrained optimization problems, the hybrid solver obtains much better solutions than SQP, while spending comparable amount of time. In addition, the hybrid solver is flexible and can achieve good results on time-bounded applications by setting parameters according to the time limits.     

An asymptotic initial value method for second order singular perturbation problems of convection-diffusion type with a discontinuous source term

In this paper a numerical method is presented to solve singularly perturbed two points boundary value problems for second order ordinary differential equations consisting a discontinuous source term. First, in this method, an asymptotic expansion approximation of the solution of the boundary value problem is constructed using the basic ideas of a well known perturbation method WKB. Then some initial value problems and terminal value problems are constructed such that their solutions are the terms of this asymptotic expansion. These initial value problems are happened to be singularly perturbed problems and therefore fitted mesh method (Shishkin mesh) are used to solve these problems. Necessary error estimates are derived and examples provided to illustrate the method.     

Boundary contraction solution of the Neumann and mixed boundary value problems of the Laplace equation

The boundary contraction method is generalized in such a way that it is applicable to the Neumann and mixed boundary value problems over regions of irregular shape. Various variants of mixed boundary value problems can be solved numerically in a unified way with mesh points fewer than those required of ADI and SOR. The method is not iterative and therefore does not require the positive definiteness of eigenvalues which is the necessary condition of the stability of ADI and SOR. The method is also applicable to exterior problems. Thus the applicability of the contraction method to problems of practical importance is substantially improved.     

A method of determining the extraneous unknowns in problems of the stability and vibrations of rods

An approximate method of determining the critical loads in problems of the stability of compressed rods has been extended to statically indeterminate systems. For this purpose, a method has been developed for solving stability problems when there are extraneous unknowns defined by the stationarity condition for the potential energy of the system. It is shown that, combined with Grammel's method and Hamilton's variational principle, the method described for determining the extraneous unknowns in statically indeterminate systems can also be used in problems of finding the natural frequencies of vibrations of rods.     

A critical review of discrete filled function methods in solving nonlinear discrete optimization problems

Many real life problems can be modeled as nonlinear discrete optimization problems. Such problems often have multiple local minima and thus require global optimization methods. Due to high complexity of these problems, heuristic based global optimization techniques are usually required when solving large scale discrete optimization or mixed discrete optimization problems. One of the more recent global optimization tools is known as the discrete filled function method. Nine variations of the discrete filled function method in literature are identified and a review on theoretical properties of each method is given. Some of the most promising filled functions are tested on various benchmark problems. Numerical results are given for comparison.     

Numerical Analysis of Boundary-Value Problems for Singularly-Perturbed Differential-Difference Equations with Small Shifts of Mixed Type

In this paper, we use a numerical method to solve boundary-value problems for a singularly-perturbed differential-difference equation of mixed type, i.e., containing both terms having a negative shift and terms having a positive shift. Similar boundary-value problems are associated with expected first exit time problems of the membrane potential in models for the neuron. The stability and convergence analysis of the method is given. The effect of a small shift on the boundary-layer solution is shown via numerical experiments. The numerical results for several test examples demonstrate the efficiency of the method.     

Parametric Quintic-Spline Approach to the Solution of a System of Fourth-Order Boundary-Value Problems

In this paper, we use parametric quintic splines to derive some consistency relations which are then used to develop a numerical method for computing the solution of a system of fourth-order boundary-value problems associated with obstacle, unilateral, and contact problems. It is known that a class of variational inequalities related to contact problems in elastostatics can be characterized by a sequence of variational inequations, which are solved using some numerical method. Numerical evidence is presented to show the applicability and superiority of the new method over other collocation, finite difference, and spline methods.     

Prediction-correction alternating direction method for a class of constrained min-max problems

The problems concerned in this paper are a class of constrained min-max problems. By introducing the Lagrange multipliers to the linear constraints, such problems can be solved by some projection type prediction-correction methods. However, to obtain components of the predictor one by one, we use an alternating direction method. And then the new iterate is generated by a minor correction. Global convergence of the proposed method is proved. Finally, numerical results for a constrained single-facility location problem are provided to verify that the new method is effective for some practical problems.      

Variable parameter Uzawa method for solving a class of block three-by-three saddle point problems

In this work, we consider numerical methods for solving a class of block three-by-three saddle point problems, which arise from finite element methods for solving time-dependent Maxwell equations and a class of quadratic programs. We present a variant of Uzawa method with two variable parameters for the saddle point problems. These two parameters can be updated easily in each iteration, similar to the evaluation of the two iteration parameters in the conjugate gradient method. We show that the new iterative method converges to the unique solution of the saddle point problems under a reasonable condition. Numerical experiments highlighting the performance of the proposed method for problems are presented.