2011Journal of Changchun University of Science and TechnologyRequires access

Diagonal Strictly Dominance Matrix and Convergence Theorem of SOR Iteration Method

Chen Deyan

Open publisher page 0 citations

Abstract

In this paper Convergence theorem of SOR iteration method for solving linear system is studied,when coefficient matrix is α-chain diagonal strictly dominance or doubly diagonal strictly dominance,and some convergence theorems are given,which solves the problem of spectral radius of iterative matrices.Results obtained are applicable for α-chain diagonal strictly dominance matrix or doubly diagonal strictly dominance matrix,and improve the known results and are applicable for generalized diagonal strictly dominance matrices.Finally,a numerical example is given for illustrating advantage of the results in this paper.

About this research paper

What this paper is about

In this paper Convergence theorem of SOR iteration method for solving linear system is studied,when coefficient matrix is α-chain diagonal strictly dominance or doubly diagonal strictly dominance,and some convergence theorems are given,which solves the problem of spectral radius of iterative matrices.Results obtained are applicable for α-chain diagonal strictly dominance matrix or doubly diagonal strictly dominance matrix,and improve the known results and are applicable for generalized diagonal strictly dominance matrices.Finally,a numerical example is given for illustrating advantage of the results in this paper.

Why it matters

A significance statement is not available in the OpenAlex record.

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

In this paper Convergence theorem of SOR iteration method for solving linear system is studied,when coefficient matrix is α-chain diagonal strictly dominance or doubly diagonal strictly dominance,and some convergence theorems are given,which solves the problem of spectral radius of iterative matrices.Results obtained are applicable for α-chain diagonal strictly dominance matrix or doubly diagonal strictly dominance matrix,and improve the known results and are applicable for generalized diagonal strictly dominance matrices.Finally,a numerical example is given for illustrating advantage of the results in this paper.

Key concepts: Diagonally dominant matrix, Diagonal, Mathematics, Spectral radius, Dominance (genetics), Diagonal matrix, Applied mathematics, Convergence (economics)

Related papers

Back to paper searchBrowse research topicsOriginal source
Diagonal Strictly Dominance Matrix and Convergence Theorem of SOR Iteration Method — Research Paper | ScholarLens