Diagonal Strictly Dominance Matrix and Convergence Theorem of SOR Iteration Method
Chen Deyan
Abstract
Chen Deyan
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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)