Research and application of Successive Over-Relaxation Iterative Algorithm

Author

Ruixia Cui ; Mingjun Wei

Author_Institution

Dept. of Basic Teaching & Res., Henan Province Population & Family Planning Coll., Zhengzhou, China

Volume

8

fYear

2011

fDate

12-14 Aug. 2011

Firstpage

3856

Lastpage

3858

Abstract

Successive Over-Relaxation Iterative Algorithm (hereinafter referred to as SOR Iterative Algorithm) is one of the effective methods for solving large-scale sparse matrix equation set, and one first order linear stationary iterative method. Starting with introduction to SOR Iterative Algorithm solving system of linear algebraic equations, this paper discusses astringency judgement conditions for SOR Iterative Algorithm and importance of selection of convergence factor, and provides MATLAB program of SOR Iterative Algorithm, linear equations; iterative algorithm; symmetric positive definite matrices.

Keywords

convergence of numerical methods; iterative methods; sparse matrices; MATLAB program; SOR iterative algorithm; astringency judgement conditions; convergence factor; first order linear stationary iterative method; linear algebraic equation system; sparse matrix equation set; successive over-relaxation iterative algorithm; symmetric positive definite matrices; Convergence; Educational institutions; Equations; Iterative methods; Mathematical model; Sufficient conditions; Symmetric matrices; constringency; sparsity linear equation system; successive over relaxation method;

fLanguage

English

Publisher

ieee

Conference_Titel

Electronic and Mechanical Engineering and Information Technology (EMEIT), 2011 International Conference on

Conference_Location

Harbin, Heilongjiang

Print_ISBN

978-1-61284-087-1

Type

conf

DOI

10.1109/EMEIT.2011.6023095

Filename

6023095