Fixed Point Theorem of {a,b,c} Contraction and Nonexpansive Type Mappings in Weakly Cauchy Normed Spaces

Let C be a closed convex weakly Cauchy subset of a normed space X. Then we define a new {a,b,c} type nonexpansive and {a,b,c} type contraction mapping T from C into C. These types of mappings will be denoted respectively by {a,b,c}-ntype and {a,b,c}-ctype. We proved the following： 1. If T is {a,b,c}-ntype mapping, then inf{ ｜｜ T（x）-x｜｜ ：x C C} =0, accordingly T has a unique fixed point. Moreover, any sequence {Xn}n∈NN in C with limn→∞｜｜T（xn） - Xn｜｜ = 0 has a subsequence strongly convergent to the unique fixed point of T. 2. If T is {a,b,c}-ctype mapping, then T has a unique fixed point. Moreover, for any x∈C the sequence of iterates {Tn （x）}n∈N has subsequence strongly convergent to the unique fixed point of T. This paper extends and generalizes some of the results given in [2,4, 7] and [13].     

几个三角公式、定理的几何解释

把两个斜边分别为a、b的直角三角形按如图所放．     

校正梯形公式误差的精确表示

利用分部积分法和推广的积分第一中值定理,给出了具5次代数精度校正梯形公式误差的精确表示.     

几何问题的降维处理

文[1]介绍了升维处理,作为它的反面——降维法,则是解决几何问题的常用方法,它可使复杂转化为简单,陌生转化为熟悉,隐含转化为显然.1平面几何问题降维处理例1(梅涅劳斯定理)直线a与△ABC的三边或其延长线分别交于求     

CYCLIC AND NEGACYCLIC CODES OF LENGTH 2p^s OVER Fp^m ＋ uFp^m

In this article, we focus on cyclic and negacyclic codes of length 2p^s over the ring R = Fp^m ＋ uFp^m, where p is an odd prime. On the basis of the works of Dinh （in J.Algebra 324,940-950,2010）, we use the Chinese Remainder Theorem to establish the algebraic structure of cyclic and negacyclic codes of length 2p^s over the ring Fp^m ＋ uFp^m in terms of polynomial generators. Furthermore, we obtain the number of codewords in each of those cyclic and negacyclic codes.     

ALGEBRAIC EXTENSION OF ＊-A OPERATOR

In this paper, we study various properties of algebraic extension of *-A operator.Specifically, we show that every algebraic extension of *-A operator has SVEP and is isoloid.And if T is an algebraic extension of *-A operator, then Weyl's theorem holds for f(T), where f is an analytic functions on some neighborhood of σ(T) and not constant on each of the components of its domain.     

半凸多目标优化ε-拟弱有效解的最优性条件及对偶定理

本文在相关文献考虑MP问题的基础上,增加了等式约束条件,即本文考虑了VP问题,并将已有文献中的凸性假设改为半凸性假设,得到VP问题的ε-拟弱有效解的相应最优性条件.接着,本文定义了VP问题的拉格朗日函数及其ε-拟弱鞍点,得到VP问题的ε-拟弱鞍点相应定理.最后,本文考虑了VP问题的对偶问题,获得了VP问题的弱对偶和强对偶定理.     

我为高考设计题目

题79已知椭圆x2/8+y2/4=1,过点P(1,1)作直线l与椭圆交于M,N两点.(1)若点P平分线段MN,试求直线l的方程;(2)设与满足(1)中条件的直线l平行的直线与椭圆交于A,B两点,AP与椭圆交于点C,BP与椭圆交于点D,求证:CD∥AB.解(1)M(x,y),N(x,y),则有x+     

随机函数的几乎处处中心极限定理

设{X_n,n≥1}是独立同分布随机变量序列,EX_1=0,EX_1~2=1．设S_n=∑_i~n=1 X_i,T_N=T_N(X_1,…,X_n)是随机函数且T_N=AS_N+R_n．我们证明若supE|R_n|＜∞,R_n=o n~(1/2)a．s．或R_n=O(n~(1／2-2γ))a．s．(0＜γ＜1／8),则对随机函数T_n几乎处处中心极限定理(简记为ASCLT)和函数型几乎处处中心极限定理(简记为FASCLT)成立．由此作为推论,可得对U统计量、Von-Mises统计量、线性过程、移动平均过程、线性模型中误差方差估计、功率和、连续分布函数的乘积极限估计和分位点函数的乘积极限估计等均成立着ASCLT和FASCLT．     

拓扑线性空间中的Drop定理和Phelps引理以及Ekeland变分原理

将Phelps引理,Ekland变分原理,Pareto有效性定理推广到拓扑线性空间,同时证明了这三个定理与郑喜印证明的拓扑线性空间中的Drop定理彼此等价.