Second Refinement of Accelerated over Relaxation Method for the Solution of Linear System

IF 0.2 Q4 MATHEMATICS
Wondosen Lisanu Assefa, Ashenafi Woldeselassie Teklehaymanot
{"title":"Second Refinement of Accelerated over Relaxation Method for the Solution of Linear System","authors":"Wondosen Lisanu Assefa, Ashenafi Woldeselassie Teklehaymanot","doi":"10.11648/J.PAMJ.20211001.13","DOIUrl":null,"url":null,"abstract":"This paper describes a method for the numerical solution of linear system of equations. The main interest of refinement of accelerated over relaxation (RAOR) method is to minimize the spectral radius of the iteration matrix in order to increase the rate of convergence of the method comparing to the accelerated over relaxation (AOR) method. That is minimizing the spectral radius means increasing the rate of convergence of the method. This motivates us to refine the refinement of accelerated over relaxation method called second refinement of accelerated over relaxation method (SRAOR). In this paper, we proposed a second refinement of accelerated over relaxation method, which decreases the spectral radius of the iteration matrix significantly comparing to that of the refinement of accelerated over relaxation (RAOR) method. The method is a two-parameter generalization of the refinement of accelerated over relaxation methods and the optimal value of each parameter is derived. The third, fourth and in general the kth refinement of accelerated methods are also derived. The spectral radius of the iteration matrix and convergence criteria of the second refinement of accelerated over relaxation (SRAOR) are discussed. Finally a numerical example is given in order to see the efficiency of the proposed method comparing with that of the existing methods.","PeriodicalId":46057,"journal":{"name":"Italian Journal of Pure and Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":0.2000,"publicationDate":"2021-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Italian Journal of Pure and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11648/J.PAMJ.20211001.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper describes a method for the numerical solution of linear system of equations. The main interest of refinement of accelerated over relaxation (RAOR) method is to minimize the spectral radius of the iteration matrix in order to increase the rate of convergence of the method comparing to the accelerated over relaxation (AOR) method. That is minimizing the spectral radius means increasing the rate of convergence of the method. This motivates us to refine the refinement of accelerated over relaxation method called second refinement of accelerated over relaxation method (SRAOR). In this paper, we proposed a second refinement of accelerated over relaxation method, which decreases the spectral radius of the iteration matrix significantly comparing to that of the refinement of accelerated over relaxation (RAOR) method. The method is a two-parameter generalization of the refinement of accelerated over relaxation methods and the optimal value of each parameter is derived. The third, fourth and in general the kth refinement of accelerated methods are also derived. The spectral radius of the iteration matrix and convergence criteria of the second refinement of accelerated over relaxation (SRAOR) are discussed. Finally a numerical example is given in order to see the efficiency of the proposed method comparing with that of the existing methods.
线性系统加速过松弛法的二次改进
本文描述了线性方程组数值解的一种方法。加速过弛豫(RAOR)方法的主要改进方向是使迭代矩阵的谱半径最小,以提高该方法的收敛速度。也就是说,最小化谱半径意味着提高方法的收敛速度。这促使我们对加速过弛豫法进行细化,称为加速过弛豫法的二次细化(SRAOR)。在本文中,我们提出了一种加速过松弛法的二次改进,与加速过松弛法(RAOR)的改进相比,迭代矩阵的谱半径显著减小。该方法是对加速过松弛法的改进进行双参数推广,并推导出各参数的最优值。还推导了加速方法的第三、第四和一般的第k次细化。讨论了迭代矩阵的谱半径和加速过松弛(SRAOR)二次细化的收敛准则。最后给出了一个数值算例,比较了所提方法与现有方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
0.60
自引率
0.00%
发文量
2
期刊介绍: The “Italian Journal of Pure and Applied Mathematics” publishes original research works containing significant results in the field of pure and applied mathematics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信