Some new preconditioned generalized AOR methods for generalized least-squares problems

详细信息    查看全文

• 作者：Zheng-Ge Huang ; ^{ZhenggeHuang@mail.nwpu.edu.cn" class="auth_mail" title="E-mail the corresponding author} ; ^{JingjingCui@mail.nwpu.edu.cn" class="auth_mail" title="E-mail the corresponding author} ; Zhong Xu ^{zhongxu@nwpu.edu.cn" class="auth_mail" title="E-mail the corresponding author} ; Quan Lu ^{zhongxu@nwpu.edu.cn" class="auth_mail" title="E-mail the corresponding author} ; Jing-Jing Cui ^{JingjingCui@mail.nwpu.edu.cn" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Preconditioned ; GAOR method ; Preconditioned GAOR method ; Generalized least squares problem ; Convergence ; Comparison
• 刊名：Applied Mathematics and Computation
• 出版年：2015
• 出版时间：15 October 2015
• 年：2015
• 卷：269
• 期：Complete
• 页码：87-104
• 全文大小：401 K

文摘

In this paper, we present some new preconditioned GAOR methods for solving generalized least-squares problems and their comparison results. Comparison results show that the convergence rates of the new preconditioned GAOR methods are better than those of the preconditioned GAOR methods presented by Zhou et al. (2009) [19] and Wang et al. (2013) [18] whenever these methods are convergent. Lastly, numerical experiments are provided to confirm the theoretical results.