Finding the Maximal Eigenpair for a Large,Dense,Symmetric Matrix based on Mufa Chen's Algorithm

A hybrid method is presented for determining maximal eigenvalue and its eigenvector(called eigenpair)of a large,dense,symmetric matrix.Many problems require finding only a small part of the eigenpairs,and some require only the maximal one.In a series of papers,efficient algorithms have been developed by Mufa Chen for computing the maximal eigenpairs of tridiagonal matrices with positive off-diagonal elements.The key idea is to explicitly construet effective initial guess of the maximal eigenpair and then to employ a self-closed iterative algorithm.In this paper we will extend Mufa Chen's algorithm to find maximal eigenpair for a large scale,dense,symmetric matrix.Our strategy is to first convert the underlying matrix into the tridiagonal form by using similarity transformations.We then handle the cases that prevent us from applying Chen's algorithm directly,e.g.,the cases with zero or negative super-or sub-diagonal elements.Serval numerical experiments are carried out to demonstrate the efficiency of the proposed hybrid method.     

Banach空间中一类非线性算子Ishikawa迭代序列收敛定理

在一般的Banach空间中,研究了Ishikawa迭代序列收敛问题,去掉了通常文献中关于空间X的一致光滑或S-一致光滑的严格要求,此外,还去掉或减弱了其它某些条件。因而本质地改进了近期文献的一系列相应定理。     

矩阵不等式约束下矩阵方程AX=B的双对称解

本文讨论矩阵不等式CXD≥E 约束下矩阵方程AX=B的双对称解,即给定矩阵A,B,C,D和 E, 求双对称矩阵X, 使得AX=B 和 CXD≥E, 其中CXD≥E表示矩阵CXD-E非负.本文将问题转化为矩阵不等式最小非负偏差问题,利用极分解理论给出了求其解的迭代方法,并结合相关矩阵理论说明算法的收敛性.最后给出数值算例验证算法的有效性.     

Set-valued dynamic systems and random iterations of set-valued weaker contractions in uniform spaces

Set-valued weaker contractions in uniform, locally convex and metric spaces are defined and dynamic systems of such weaker contractions are studied. Conditions guaranteeing the convergence of generalized sequences of random iterations and iterations and the existence and uniqueness of endpoints of set-valued weaker contractions are established. Our definitions and results are new for set-valued maps in uniform, locally convex and metric spaces and even for single-valued maps.     

The necessary and sufficient condition for the convergence of Ishikawa iteration on an arbitrary interval

As an important iteration, the Mann and Ishikawa iteration has extensive application in fixed point theory. In 1991, David Borwein and Jonathan Borwein proved the convergence of the Mann iteration on a closed bounded interval in their paper. In this paper, we will extend their result to an arbitrary interval and to the Ishikawa iteration, indicating the necessary and sufficient condition for the convergence of Ishikawa iteration of continuous functions on an arbitrary interval.     

关于Lipschitz强增生算子的迭代程序

本文在一般的Ｂａｎａｃｈ空间中讨论Ｌｉｐｓｃｈｉｔｚ强增生算子方程解和严格伪压缩算子不动点的迭代逼近问题．我们的结果统一和推广了Ｄｅｎｇ，Ｌｉｕ，Ｔａｎ和Ｘｕ的结果，完整地回答了Ｃｈｉｄｕｍｅ提出的公开问题．     

一类增算子不动点定理及其应用

利用锥理论和非对称迭代方法,讨论了不具有连续性和紧性条件的增算子方程解的存在唯一性.作为其应用着重讨论了非增算子方程解的存在唯一性,并给出了迭代序列收敛于解的误差估计,改进和推广了某些已知结果.     

On global stability of an HIV pathogenesis model with cure rate

In this paper, applying both Lyapunov function techniques and monotone iterative techniques, we establish new sufficient conditions under which the infected equilibrium of an HIV pathogenesis model with cure rate is globally asymptotically stable. By giving an explicit expression for eventual lower bound of the concentration of susceptible CD4⁺ T cells, we establish an affirmative partial answer to the numerical simulations investigated in the recent paper [Liu, Wang, Hu and Ma, Global stability of an HIV pathogenesis model with cure rate, Nonlinear Analysis RWA (2011) 12 : 2947–2961]. Our monotone iterative techniques are applicable for the small and large growth rate in logistic functions for the proliferation rate of healthy and infected CD4⁺ T cells. Copyright © 2014 John Wiley & Sons, Ltd.     

关于PageRank的广义二级分裂迭代方法

本文研究计算PageRank的迭代法,在Gleich等人提出的内/外迭代方法的基础上,提出了具有三个参数的广义二级分裂迭代法,该方法包含了内/外迭代法和幂迭代法,并研究了该方法的收敛性.基于该方法的收缩因子的计算公式,讨论了迭代参数可能的选择,通过参数的选择能有效提高内/外迭代法的收敛效率.     

求解PageRank问题的多步幂法修正的内外迭代法

引用两种加速计算PageRank的算法,分别为内外迭代法和两步分裂迭代算法.从这两种方法中,得到多步幂法修正的内外迭代方法.首先,详细介绍了算法实施过程.然后,对此算法的收敛性进行证明,并且将此算法的谱半径与两步分裂迭代算法的谱半径进行比较.最后,数值试验说明该算法的计算速度比两步分裂迭代法要快.