2011•Unpublished venueRequires access

Research and application of Successive Over-Relaxation Iterative Algorithm

Ruixia Cui, Mingjun Wei

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.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Iterative method, Successive over-relaxation, Algorithm, Relaxation (psychology), Matrix-free methods, Convergence (economics), Linear equation, Local convergence