α-Diagonal Strictly Dominance Matrix and Convergence Theorem of SOR Iteration Method
Xiaoming Guo
Abstract
Xiaoming Guo
Abstract
For the linear equations system whose coefficient matrix is of α-diagonal strictly dominance or doubly α-chain diagonal strictly dominance,convergence properties of SOR iteration method are studied and some convergence theorems are given,which solves the problem of spectral radius of iterative matrices.Results obtained are applicable not only for α-diagonal strictly dominance matrix or doubly α-chain diagonal strictly dominance matrix,but also for generalized α-diagonal strictly dominance matrices.Finally,a numerical example is given for illustrating advantage of results.
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.
For the linear equations system whose coefficient matrix is of α-diagonal strictly dominance or doubly α-chain diagonal strictly dominance,convergence properties of SOR iteration method are studied and some convergence theorems are given,which solves the problem of spectral radius of iterative matrices.Results obtained are applicable not only for α-diagonal strictly dominance matrix or doubly α-chain diagonal strictly dominance matrix,but also for generalized α-diagonal strictly dominance matrices.Finally,a numerical example is given for illustrating advantage of results.
Key concepts: Diagonally dominant matrix, Mathematics, Diagonal, Spectral radius, Dominance (genetics), Diagonal matrix, Applied mathematics, Convergence (economics)