拓扑空间中的一个非空交定理及其应用

在FC-空间中证明了一新的非空交定理．作为应用，一不动点定理，一极大元定理，一重合点定理和一些极小极大不等式被证明．这些定理推广了近期文献中的结果．     

一个新的Ky Fan匹配定理及其在L-凸度量空间中的应用

建立了转移开覆盖的一个新的Ky Fan型匹配定理．作为应用，获得了Fan-Browder重合定理，不动点定理、极大元定理，相交定理和截口定理．     

完备L-凸度量空间中的Ky Fan匹配定理及其对抽象经济的应用

在完备L-凸度量空间中建立了一个转移紧开覆盖的Ky Fan匹配定理．作为应用，获得了Fan-Browder重合定理和极大元定理．最后，研究了完备L-凸度量空间中抽象经济和定性对策的平衡存在定理．     

零对称BZ-代数的充要条件

重新证明文[10]中几个重要结论并修正文[10]中的定理1(11)和定理2．在此基础上，利用这些重新证明过的结论及修正过的定理可以按照文[10]中引理3，定理4，定理6，定理7，定理10的证明过程原样证明文[10]中的相应结果．因而在文[10]中，除性质11是结合BZ一代数的等价性质(见文[15])，定理1(11)及定理2需要进行修正外，其余结论及证明过程均成立．     

L-空间中的KKM映射及不动点定理

引入了L-空间和L-空间上的KKM类映射，建立了关于该类映射的一些不动点定理，其中包括Schauder型和Fan-Browder型不动点定理．得到了L-空间中的KyFan匹配定理和叠合点定理．     

一个新的极大极小定理及应用

本文得到一个新的极大极小定理及其几个等价形式．作为这一结果的应用，我们得到区间空间上的Ｋｙ Ｆａｎ型截口定理，匹配定理和几个集值映象的不动点定理．     

覆盖曲面的不等式及其应用

本文运用改良Ａｈｌｆｏｒｓ的覆盖曲面定理，首先精确了Ｔｓｕｊｉ的二个不等式．然后用几何方法导出了一个相当广泛的正规定理．它以著名的Ａ．Ｂｌｏｃｈ正规定理及Ｐ．Ｍｏｎｔｅｌ正规定理为特例．     

广义蝴蝶定理

广义蝴蝶定理南京三乐电气总公司朱履乾蝴蝶定理是世界近代初等几何中的一道名题．该定理于一八一五年问世，一百七十多年来，始终吸引着人们去探求新的更优美简捷的证法，探求她的多种形式的推广．然而至今尚无对各种蝴蝶定理普遍适用的几何关系式．作者对蝴蝶定理范畴的...     

混合序列加权和的强收敛性

本文给出混合序列加权和的强收敛性的一些充分条件，这些结论推广和改进了文［１］定理３，文［２］定理３；文［３］定理４．１５以及文［４］定理４．     

本质连通区的存在性和稳定性

本文首先给出了一个统一的本质连通区的存在性定理．应用这个定理，容易地导出了不动点集和Nash平衡点集本质连通区的存在性定理．此外，还首先给出了一个统一的本质连通区的稳定性定理．     

Applications of doubly companion matrices

Doubly companion matrices are used as a tool to analyze the ESIRK and DESIRE methods, and the general linear methods satisfying the IRKS property. These methods can be considered as extensions of the DIRK and SIRK Runge–Kutta methods, and were introduced to overcome some of the undesirable properties of these methods. A connection between the ESIRK and DESIRE methods, and IRKS methods is also established. Several low order methods are given.     

Mehar’s methods for fuzzy assignment problems with restrictions

In this paper, limitations of existing methods [5, 11] for solving fuzzy assignment problems (FAPs) are pointed out. In order to overcome the limitations of existing methods, two new methods named Mehar’s methods are proposed. To show the advantages of Mehar’s methods over existing methods, some FAPs are solved. The Mehar’s methods can solve the problems solved by existing methods as well as those which cannot be solved by existing methods.     

Extragradient Methods for Pseudomonotone Variational Inequalities

We consider and analyze some new extragradient-type methods for solving variational inequalities. The modified methods converge for a pseudomonotone operator, which is a much weaker condition than monotonicity. These new iterative methods include the projection, extragradient, and proximal methods as special cases. Our proof of convergence is very simple as compared with other methods.     

A Class of Projection Methods for General Variational Inequalities

In this paper, we consider and analyze a new class of projection methods for solving pseudomonotone general variational inequalities using the Wiener-Hopf equations technique. The modified methods converge for pseudomonotone operators. Our proof of convergence is very simple as compared with other methods. The proposed methods include several known methods as special cases.     

A class of Uzawa-SOR methods for saddle point problems

In this paper, we consider a class of Uzawa-SOR methods for saddle point problems, and prove the convergence of the proposed methods. We solve a lower triangular system per iteration in the proposed methods, instead of solving a linear equation Az=b. Actually, the new methods can be considered as an inexact iteration method with the Uzawa as the outer iteration and the SOR as the inner iteration. Although the proposed methods cannot achieve the same convergence rate as the GSOR methods proposed by Bai et al. [Z.-Z. Bai, B.N. Parlett, Z.-Q. Wang, On generalized successive overrelaxation methods for augmented linear systems, Numer. Math. 102 (2005) 1-38], but our proposed methods have less workloads per iteration step. Experimental results show that our proposed methods are feasible and effective.     

Hamilton系统的连续有限元法

利用常微分方程的连续有限元法,对非线性Hamilton系统证明了连续一次、二次有限元法分别是2阶和3阶的拟辛格式,且保持能量守恒;连续有限元法是辛算法对线性Hamilton系统,且保持能量守恒．在数值计算上探讨了辛性质和能量守恒性,与已有的辛算法进行对比,结果与理论相吻合．     

MULTISTEP DISCRETIZATION OF INDEX 3 DAES

1. IntroductionIn this paper, we will consider the multistep discrezations of the differential--algebraicequations (DAEs) in Hessenberg formwhere F e AN M M R", K E AN M L - AM, G E AN - RL, the initial value(yo, ic, no) at xo are assumed to be consistent, i.e., they satisfyWe supposes, F, G and K are sufficiently differentiable, and thatin a neighbourhood of the solution. Such problems often appear in the simulation ofmechanical systems with constraints and the singularly perturbed…     

On the convergence of modified Newton methods for solving equations containing a non-differentiable term

We provide a semilocal convergence analysis for certain modified Newton methods for solving equations containing a non-differentiable term. The sufficient convergence conditions of the corresponding Newton methods are often taken as the sufficient conditions for the modified Newton methods. That is why the latter methods are not usually treated separately from the former. However, here we show that weaker conditions, as well as a finer error analysis than before can be obtained for the convergence of modified Newton methods. Numerical examples are also provided.     

Non-linear stability of a general class of differential equation methods

For a class of methods sufficiently general as to include linear multistep and Runge-Kutta methods as special cases, a concept known as algebraic stability is defined. This property is based on a non-linear test problem and extends existing results on Runge-Kutta methods and on linear multistep and one-leg methods. The algebraic stability properties of a number of particular methods in these families are studied and a generalization is made which enables estimates of error growth to be provided for certain classes of methods.     

Local error estimation for multistep collocation methods

Multistep collocation methods for initial value problems in ordinary differential equations are known to be a subclass of multistep Runge-Kutta methods and a generalisation of the well-known class of one-step collocation methods as well as of the one-leg methods of Dahlquist. In this paper we derive an error estimation method of embedded type for multistep collocation methods based on perturbed multistep collocation methods. This parallels and generalizes the results for one-step collocation methods by Nørsett and Wanner. Simple numerical experiments show that this error estimator agrees well with a theoretical error estimate which is a generalisation of an error estimate first derived by Dahlquist for one-leg methods.