Abstract
The paper is concerned with an improvement over the symmetric accelerated overrelaxation (SAOR) method for an iterative solution of large linear systems. At first, the conjugate gradient (CG) acceleration procedure is introduced to the SAOR method, and the non-adaptive SAOR-CG algorithm is developed. Next, the adaptive procedure to determine automatically the CG parameters (ν n , ϱ n ) and the SAOR parameters (γ, ω) is constructed. Based on the adaptive procedure, the adaptive SAOR-CG algorithm is proposed, and its characteristics are shown with numerical experiments. A comparison with the optimum SOR algorithm and the adaptive SSOR algorithm is also given. It is finally proved that the proposed Adaptive SAOR-CG algorithm is feasible and very efficient for the iterative solution.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
