新组合型的三角插值多项式

将被插函数进行组合平均,构造一个新组合型的三角插值多项式Cn(f;t,x),使得它在全轴上一致收敛到每个以2π为周期的连续函数,且对Cj2π连续函数类的逼近阶达到最佳,这里0jt,t为任给的奇自然数.     

线性森林定常发展系统半离散化的研究

利用半离散的方法将线性森林发展方程中的μ(r)进行离散,得到两个偏微分方程,进一步利用算子半群的理论证明离散后的解是收敛于原方程的解.     

An Accurate and Universal HEOM Approach to Strongly Correlated Quantum Impurity Systems

A hierarchical equations of motion(HEOM)approach is developed for general open quantum systems coupled to fermionic environment.The HEOM method is in principle formally exact,as it resolves nonperturbatively the combined effects of many-body interaction,system-bath dissipation,and non-Markovian memory.In practice,the HEOM approach is highly accurate and efficient for the characterization of strongly correlated quantum impurity sys-     

多点Pad逼近的几乎处处收敛性

讨论了在某些插值点解析的函数的多点Ｐａｄｅ逼近,得到多点Ｐａｄｅ逼近行子序列在一定区域上几乎处处收敛的结果．     

两同型部件温贮备可修系统半离散化的研究

利用半离散的方法对两同型部件温贮备可修系统中的函数μ(x)进行离散,得到两个离散的方程,再利用算子半群的理论证明离散后方程的解收敛于原方程的解.     

随机变量阵列的强收敛性

获得了独立随机变量阵列的对数律成立的一个充分条件,推广了已有的结果。     

正项随机级数的收敛性及应用

在{Xn}不要求独立或至多两两不相关情形下,运用文献[1]中已有的关于正项随机级数的收敛判别准则讨论了其他正项随机级数的收敛性,得到了较好的结果.     

不等式约束非线性规划的拉格朗日乘子的收敛

对于等式约束的非线性规划问题,一般的解决方法是在每次迭代中更新拉格朗日乘子且逐渐增大拉格朗日函数的惩罚因子,当罚因子充分大或充分接近局部最优解时,二阶充分条件是满足的;对不等式约束问题也采用了相应的方法.在凸的情况下,对于任意的罚因子或者在每次迭代中不要求精确极小化,就能全局收敛到最优解;证明了拉格朗日乘子是收敛的.     

模糊互补判断矩阵一致性修正新方法

判断矩阵的一致性修正是利用层次分析法进行决策的一个重要步骤,本文利用几何平均法对由专家构造的模糊互补判断矩阵进行修正,证明了满意一致性矩阵的存在性与所给方法的收敛性,最后给出了一算例.     

3,4跳图的平面性

For a graph G of size ε≥1 and its edge-induced subgraphs H1 and H2 of size r(1≤r≤ε), H1 is said to be obtained from H2 by an edge jump if there exist four distinct vertices u,v,w and x in G such that (u,v)∈E(H2), (w,x)∈ E(G)-E(H2) and H1=H2-(u,v)+(w,x). In this article, the r-jump graphs (r≥3) are discussed. A graph H is said to be an r-jump graph of G if its vertices correspond to the edge induced graph of size r in G and two vertices are adjacent if and only if one of the two corresponding subgraphs can be obtained from the other by an edge jump. For k≥2, the k-th iterated r-jump graph Jrk(G) is defined as Jr(Jrk-1(G)), where Jr1(G)=Jr(G).An infinite sequence{Gi} of graphs is planar if every graph Gi is planar. It is shown that there does not exist a graph G for which the sequence {J3k(G)} is planar, where k is any positive integer. Meanwhile,lim gen(J3k(G))=∞,where gen(G) denotes the genus of a graph G, if the sequencek→∞J3k(G) is defined for every positive integer k. As for the 4-jump gra