小数乘法位数的取舍对精确度的影响

小数乘法在珠算运算中是常见的，在具体问题中为了运算等诸方面的便利，在不影响大局的前提下往往采用近似计算，只需近似结果就可以了，不然将增添不必要的麻烦。那么珠算运算能否在运算中对某些位数的计算取舍，而又不影响结果的精确度呢?这个问题早已被人们所关注，如果可以做到这一点无疑会提高珠算的运算速度。     

关于Banach空间上凸优化摄动问题的相容性与稳定性

本文给出了Ｂａｎａａｃｈ空间上凸优化摄动问题的相容性与稳定性的特征。并把所得到的结果应用到最佳凸逼近问题中，导出了几个较深刻的结果。     

集合在受限排列组合问题的应用

在执教人教版新教材第十章“排列、组合和概率”时，排列组合应用问题中许多比较复杂的限制条件，往往让初学者眼花缭乱，不知所措，一时难以理清思路，即使有时能求对结果，但仍然糊里糊涂．课本中的阅读材料“从集合的角度看排列、组合和概率”给了我灵感，我在教学时有意识的让学生使用集合这一工具来表示相关事件，将问题中复杂限制条件间的关系转化为集合间的运算，从而可以通过求出一些集合的元素的个数使问题获得解决，收到了很好的效果．     

关于Serre问题

本文首先简单地证明一个比［５］中定理９．４１更深刻的结果，给出了著名的Ｓｅｒｒｅ定理的更简单的证明，进而概述了著名的Ｓｅｒｒｅ问题证明，指出Ｓｅｒｒｅ定理在解决Ｓｅｒｒｅ问题中的作用。     

拓扑型极大极小定理和抽象B-H-S变分不等式

本文中证明了区间空间中几个新型的极大极小定理，并研究了抽象形式变分不等式和集值B-H-S变分不等式解的存在性问题。本文的结果包含[1，2，5，7，8]中相应结果为特例。     

从矩阵迹关系过渡到算子迹关系的一个通用方法

本文给出了一个将矩阵迹的不等式推广为Ｈｉｌｂｅｒｔ空间中算子迹的不等式的方法，并用它较简捷地将矩阵论中Ｂｅｌｌｍａｎ问题的已有结果以及其它一些矩阵迹的不等式推广为算子迹的相应不等式。     

关于TOPSIS法应用中的逆序问题及消除的方法

在多指标决策问题中，TOPSIS法是一种常用的方法，然而传统的TOPSIS法在实际应用中容易产生逆序的现象。本分析了逆序产生的主要原因，并提出了一种改进的方法-RTOPSIS法。应用本的方法不仅能消除逆序的现象，而且还能正确反映指标权重对决策结果的影响。     

非光滑泛函临界点理论的一个应用

本文利用局部Lipschitz泛函的临界点理论，来得到一个改进的半线性方程的Landesman Lazer型结果，问题来自于力学，称为变分不等式的特征值问题，在[3]中，D.Goeleven,D.Motreanu和P.D.Panagiotopoulos等人讨论了共振的情形，并得到了弱解的存在性的结果。但是，在他们结论中（见[3]中定理4．1），条件（H1）与（H2）却是互不相容的，本文得到了变分不等式的特征值问题在共振情形下的弱解存在性的相应结果。     

自反Banach空间中的相补问题

在自反Banach空间中证明了相补问题解的存在性定理，改进了[1]中的一个主要结果．     

关于LCS中一个模型的某些结果

研究局部凸空间（ＬＣＳ）中一个模型解的有关问题；且应用所得的某些理论结果，研究微分方程组的周期解问题。     

Implicit Complementarity Problems in Banach Spaces

We utilize the method of multivalued fixed point in this paper to prove the existence theorems of solutions for some implicit complementarity problems in Banach spaces.     

On the solution of some (parametric) linear complementarity problems with applications to portfolio selection,structural engineering and actuarial graduation

In this paper we discuss three applications of a class of (parametric) linear complementarity problems arising independently from such diverse areas as portfolio selection, structural engineering and actuarial graduation. After explaining how the complementarity problems emerge in these applications, we perform some analytical comparisons (based on operation counts and storage requirements) of several existing algorithms for solving this class of complementarity problems. We shall also present computational results to support the analytical comparisons. Finally, we deduce some conclusions about the general performance of these algorithms.This research is supported in part by the United States Army under Contract No. DAAG29-75-C-0024, the National Science Foundation under Grant No. MCS75-17385 and Grant ENG77-11136.     

A note onQ-matrices

This paper concerns three classes of matrices that are relevant to the linear complementarity problem. We prove that within the class ofP ₀-matrices, theQ-matrices are precisely the regular matrices.Research supported by Department of Energy, Contract EY-76-S-03-0326 PA # 18.     

一类H矩阵线性互补问题的预处理二步模基矩阵分裂迭代方法

本文我们利用预处理技术推广了求解线性互补问题的二步模基矩阵分裂迭代法,并针对H-矩阵类给出了新方法的收敛性分析,得到的理论结果推广了已有的一些方法.     

On the number of solutions to a class of complementarity problems

In this paper we consider the problem of establishing the number of solutions to the complementarity problem. For the case when the Jacobian of the mapping has all principal minors negative, and satisfies a condition at infinity, we prove that the problem has either 0, 1, 2 or 3 solutions. We also show that when the Jacobian has all principal minors positive, and satisfies a condition at infinity, the problem has a unique solution.Sponsored by the United States Army under Contract No. DAAG29-75-C-0024. This material is based upon work supported by the National Science Foundation under Grant No. MCS77-03472 and Grant No. MCS78-09525. This work appeared as an MRC Technical Report No. 1964, University of Wisconsin, Madison, WI, June 1979.     

Locally unique solutions of quadratic programs,linear and nonlinear complementarity problems

It is shown that McCormick's second order sufficient optimality conditions are also necessary for a solution to a quadratic program to be locally unique and hence these conditions completely characterize a locally unique solution of any quadratic program. This result is then used to give characterizations of a locally unique solution to the linear complementarity problem. Sufficient conditions are also given for local uniqueness of solutions of the nonlinear complementarity problem.Research supported by National Science Foundation Grant MCS74-20584 A02.     

A parametric linear complementarity problem involving derivatives

The problem considered in this paper is given by the conditions:w = q + tp + Mz, w 0, 0,w ^T = 0, where a dot denotes the derivative with respect to the scalar parametert 0. In this problem,q, p aren-vectors withq 0 andM is an byn P-matrix. This problem arises in a certain basic problem in the field of structural mechanics. The main result in this paper is the existence and uniqueness theorem of a solution to this problem. The existence proof is constructive providing a computational method of obtaining the solution asymptotically.This research is in part supported by the National Science Foundation under Grant No. ENG77-11136.     

OnQ-matrices

In a recent paper [1], Aganagic and Cottle have established a constructive characterization for aP ₀-matrix to be aQ-matrix. Among the principal results in this paper, we show that the same characterization holds for anL-matrix as well, and that the symmetric copositive-plusQ-matrices are precisely those which are strictly copositive.     

Stability of the linear complementarity problem at a solution point

In this paper we study the behavior of a solution of the linear complementarity problem when data are perturbed. We give characterizations of strong stability of the linear complementarity problem at a solution. In the case of stability we give sufficient and necessary conditions.     

On the number of solutions to a class of linear complementarity problems

In this note, we consider the linear complementarity problemw = Mz + q, w 0, z 0, w ^T z = 0, when all principal minors ofM are negative. We show that for such a problem for anyq, there are either 0, 1, 2, or 3 solutions. Also, a set of sufficiency conditions for uniqueness is stated.The work of both authors is partially supported by a grant from the National Science Foundation, MCS 77-03472.