Banach空间中非光滑算子方程的光滑化拟牛顿法

研究Banach空间中非光滑算子方程的光滑化拟牛顿法.构造光滑算子逼近非光滑算子,在光滑逼近算子满足方向可微相容性的条件下,证明了光滑化拟牛顿法具有局部超线性收敛性质.应用说明了算法的有效性.     

对于局部有界函数的积分型Szász-Bézier算子的逼近估计

引入一种积分型的Szász-Bézier算子,并研究其逼近性质,得到了此类算子对局部有界函数的逼近阶估计公式.     

对于局部有界函数的积分型Szász-Bézier算子的逼近估计

引入一种积分型的 Szász- Bézier算子 ,并研究其逼近性质 ,得到了此类算子对局部有界函数的逼近阶估计公式     

局部列紧(正规)算子与局部列紧(正规)收敛

在数值求解非线性算子方程时,列紧 算子、正规算子与列紧收敛、正规收敛理论,即列紧、正规算子逼近理论[1]、[3]、[5],导致了在较少假定下方程的近似解的收敛性[1]—[6]。作为列紧、正规算子逼近理论的推广,本文引入局部有界点列、局部有界算子、局部列紧算子(线性或非线性、有界或无界)、局部正规算子与局部列紧收敛、局部正规收敛等     

Banach空间中预解算子控制的分数阶微分包含解的存在性

利用逼近解的方法,解析预解算子理论和Kakutani不动点定理讨论了预解算子控制的非局部分数阶微分包含,获得了适度解的存在性定理.     

Banach空间的逼近紧性与度量投影算子的连续性及其应用

首先给出赋范线性空间中的非空集合C的逼近紧性的等价描述. 如所周知, 如果C是Banach空间X中的一个逼近紧的半Chebyshev闭集, 那么由X到C的度量投影算子π_c是连续的. 当X是中点局部一致凸的Banach 空间, 利用Banach空间几何的技巧证得: C的逼近紧性对投影算子π_c的连续性也是必要的. 利用这个一般结论给出: 当T是由逼近紧且严格凸的Banach空间$X$到中点局部一致凸Banach空间Y的有界线性算子时, T有连续的Morse-Penrose度量广义逆T⁺$的充分必要条件.     

象征算子的紧算子逼近算法和逼近速度

传统的微分方程的方法是利用Taylor展开用主象征逼近象征;本文用充分好的紧算子来逼近象征算子,并且逼近算子在算子范数意义下快速逼近原来的算子.     

Shepard-Lagrange算子的逼近

本文建立了Shepard-Lagrange算子逼近的正逆定理,证明了可以利用高阶光滑模来刻画Shepard-Lagrange算子的逼近性质.从而说明了Shepard-Lagrange算子比一般的Shepard算子具有更好的逼近性质.进一步,所用光滑模的阶梯函数非常广泛,这是多项式逼近所不具有的.     

学习理论中核函数逼近的Jackson型不等式（英文）

从微分算子角度理解核函数空间,借助经典Fourier变换研究核函数逼近问题.应用Fourier乘子算子和算子半群定义了一种光滑模,证明其与一种基于微分算子的K-泛函的等价性,由此给出了刻画核函数逼近收敛性的Jackson不等式.进一步证明,如果微分算子为Riesz势算子或Bessel势算子,逼近的收敛性可以转化为卷积算子逼近.特别地,给出了再生核Hilbert空间逼近的一种上界估计.     

m次积分余弦算子函数的逼近

m次积分余弦算子函数是近年来提出并研究的一类算子族,它的逼近问题是研究的课题之一.目的在于研究如何用生成元预解式的逼近来刻画m次积分余弦算子函数的逼近.利用Laplace变换得到了m次积分余弦算子函数逼近的四个等价条件.当m=0时即为经典的余弦算子函数相应的逼近结果.     

Extreme values of the sum of squares of degrees of bipartite graphs

In this paper we determine the minimum and maximum values of the sum of squares of degrees of bipartite graphs with a given number of vertices and edges.     

Number of connected components of groups of real points of adjoint groups

We present a unified approach to compute the number of connected components in the group of real points of adjoint almost simple real algebraic groups.     

Estimation of the number of components of finite mixtures of multivariate distributions

An estimator of the number of components of a finite mixture ofk-dimensional distributions is given on the basis of a one-dimensional independent random sample obtained by a transformation of ak-dimensional independent random sample. A consistency of the estimator is shown. Some simulation results are given in a case of finite mixtures of two-dimensional normal distributions.     

Radius of convexity of certain classes of analytic functions

We consider the classes of analytic functions introduced recently by K.I. Noor which are defined by conditions joining ideas of close-to-convex and of bounded boundary rotation functions. We investigate coefficients estimates and radii of convexity.     

Eigenvector p-Bases of Rings of Constants of Derivations

Let A be a UFD of characteristic p > 0, let 𝒵 be a set of some eigenvectors of a derivation of A. We prove, under some additional assumptions, a necessary and sufficient condition for 𝒵 to be a p-basis of the minimal ring of constants containing 𝒵. The main preparatory result is the unique decomposition theorem with respect to a factor from a given subalgebra containing A^p.     

Galois Structure of K-Groups of Rings of Integers

N/Kbe a Galois extension of number fields with finite Galois group G.We describe a new approach for constructing invariants of the G-module structure of the K groups of the ring of integers of N in the Grothendieck group of finitely generated projective Z[G]modules. In various cases we can relate these classes, and their function field counterparts, to the root number class of Fröhlich and Cassou-Noguès.     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².     

有资格限制的指派问题的求解方法

在实际的指派工作中，常会遇到某个人有没有资格去承担某项工作的问题，因此，本建立了有资格限制的指派问题的数学模型。在此数学模型中，将效益矩阵转化为判定矩阵，由此给出了判定此种指派问题是否有解的方法；在有解的情况下，进一步将效益矩阵转化为求解矩阵，从而将有资格限制的指派问题化为传统的指派问题来求解。最后给出了一个数值例子来说明这样的处理方法是有效的。