版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Univ Novi Sad Fac Sci Dept Math & Informat Novi Sad 21000 Serbia
出 版 物:《NUMERICAL ALGORITHMS》 (数值算法)
年 卷 期:2006年第42卷第3-4期
页 面:325-334页
核心收录:
学科分类:07[理学] 070104[理学-应用数学] 0701[理学-数学]
主 题:relaxation methods parallel decomposition block H-matrices
摘 要:The parallel decomposition-type relaxation methods for solving large sparse systems of linear equations on SIMD multiprocessor systems have been proposed in [3] and [2]. In case when the coefficient matrix of the linear system is a block H-matrix, sufficient conditions for the convergence of methods given in [2], [3] have been further improved in [5] and [4]. From the practical point of view, the convergence area obtained there is not always suitable for computation, so we propose new, easily computable ones, for some special subclasses of block H-matrices. Furthermore, this approach improves the already known convergence area for the class of block strictly diagonally dominant (SDD) matrices.