A New Comparison Theorem for the Preconditioned Gauss-Seidel Iterative Method
Huang Yong-hui
Abstract
Huang Yong-hui
Abstract
In this paper,the convergence analysis for a new preconditioned Gauss-Seidel iterative method was discussed.If the coefficient matrix is a nonsingular irreducible M-matrix,the convergence rate of this iterative method depends on the spectral radius of the original Gauss-Seidel method.Likewise,the spectral radius of the preconditioned Gauss-Seidel iterative method also depends on one of the preconditioned Gauss-Seidel methods.Finally,some numerical examples are given to explain our theoretical 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.
In this paper,the convergence analysis for a new preconditioned Gauss-Seidel iterative method was discussed.If the coefficient matrix is a nonsingular irreducible M-matrix,the convergence rate of this iterative method depends on the spectral radius of the original Gauss-Seidel method.Likewise,the spectral radius of the preconditioned Gauss-Seidel iterative method also depends on one of the preconditioned Gauss-Seidel methods.Finally,some numerical examples are given to explain our theoretical results.
Key concepts: Spectral radius, Gauss–Seidel method, Mathematics, Iterative method, Applied mathematics, Invertible matrix, Convergence (economics), Rate of convergence