节点文献

块二级迭代法的近似最优内迭代次数

THE APPROXIMATE OPTIMAL NUMBER OF INNER ITERATIONS OF BLOCK TWO-STAGE ITERATIVE METHODS

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 蔡放熊岳山骆志刚

【Author】 Cai Fang (Department of Mathematics,School of Science,National University of Defense Technology,Changsha 410073,China;Department of Mathematics and Information Science,Changsha University,Changsha 410003,China) Xiong Yueshan Luo Zhigang (School of Computer,National University of Defense Technology,Changsha 410073,China)

【机构】 国防科技大学理学院数学系国防科技大学计算机学院国防科技大学计算机学院 长沙 410073 长沙大学数学与信息科学系长沙 410003长沙 410073

【摘要】 本文讨论线性方程组定常块二级迭代法内迭代次数的选择.对于单调矩阵,证明了块Jacobi矩阵的谱半径ρp(T)为非定常块二级迭代法R1-因子的下界.对于M-矩阵,用某个单调范数给出了ρ(Tp)的关于p单调下降且收敛于ρ(T)的上界.于是,当系数矩阵为M-矩阵时,我们定义了定常块二级迭代法的近似最优内迭代次数.所定义的近似最优值与模型问题数值计算的实际最优值非常吻合.本文分析表明,实际计算中应该把内迭代次数控制在较小的数目.

【Abstract】 This article discusses the selection of the number of inner iterations of stationary block two-stage iterative methods for linear systems.It is shown that,for monotone matrices,the spectral radiusρ(T) of block Jacobi iteration matrix is the low bound of R1-factor of the non-stationary block two-stage iterative methods.We apply a certain monotone norm to find out the decreasing upper bounds ofρ(Tp),these upper bounds converge toρ(T) with p for M- matrices.Consequently,when coefficient matrices are M-matrices we define the approximate optimal number of the inner iterations for stationary block two-stage iterative methods;the approximate optimum defined very tallies with the real optimum of the numerical instance for model problem.It is deduced from our analysis that small number of inner iterations should always be used in applications.

【基金】 国家自然科学基金项目(60773022)
  • 【文献出处】 计算数学 ,Mathematica Numerica Sinica , 编辑部邮箱 ,2008年01期
  • 【分类号】O241.6
  • 【被引频次】6
  • 【下载频次】143
节点文献中: 

本文链接的文献网络图示:

本文的引文网络