Self-Corrective Iterations (SCI) for generalized diagonally dominant matrices

详细信息    查看全文

• 作者：Jinrui Guan^a ; ^{guanjinrui2012@163.com" class="auth_mail" title="E-mail the corresponding author} ; Linzhang Lu^b ; ^a ; ^{lzlu@xmu.edu.cn" class="auth_mail" title="E-mail the corresponding author} ; Ren-Cang Li^c ; ^{rcli@uta.edu" class="auth_mail" title="E-mail the corresponding author} ; Rongxia Shao^a ; ^{shao-rongxia@163.com" class="auth_mail" title="E-mail the corresponding author}
• 关键词：15B99 ; 65F10 ; 65F35
• 刊名：Journal of Computational and Applied Mathematics
• 出版年：2016
• 出版时间：15 August 2016
• 年：2016
• 卷：302
• 期：Complete
• 页码：285-300
• 全文大小：530 K

文摘

A suggestive indicator is proposed for predicting whether a given (complex or real) square matrix A$A$ is or is not a generalized diagonally dominant matrix (GDDM) by which we mean if A$A$ can be brought into a strictly diagonally dominant matrix by post-multiplying some diagonal matrix D$D$. Based on the indicator, three self-corrective iterative algorithms (SCI) are presented for determining if an irreducible A$A$ is or is not a GDDM and at the same time delivering the matrix D$D$ in case when A$A$ is a GDDM. The basic idea is to push A$A$ towards being (strictly) diagonally dominant when the indicator suggests that A$A$ is likely a GDDM or towards being off-diagonally dominant otherwise. Among the three algorithms, each has their own feature: one takes the fewest number of iterations but the most amount of work per iteration, one takes the most number of iterations but the least amount of work per iteration, and the third one strikes a balance between the two extremes. It is shown that the algorithms will terminate in finite many steps under the assumption that A$A$ has no zero entries and the comparison matrix of A$A$ is nonsingular. Comparing with existing methods, new algorithms are more efficient, as demonstrated on known difficult examples in the literature, newly designed random matrices, as well as matrices from the University of Florida Sparse Matrix Collection.