A New Comparison Theorem for the Preconditioned Jacobi Iterative Method
Huang Yong-hui
Abstract
Huang Yong-hui
Abstract
In this paper,the convergence analysis for a new preconditioned Jacobi iterative method was discussed.If the coefficient matrix is the strictly dominant L-matrix,the convergence rate of the preconditioned Jacobi iterative method is faster than one of the Jacobi methods.In addition,the spectral radius of this method is monotonically decreasing.Last,a numerical example is used to verify the correctness of 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 Jacobi iterative method was discussed.If the coefficient matrix is the strictly dominant L-matrix,the convergence rate of the preconditioned Jacobi iterative method is faster than one of the Jacobi methods.In addition,the spectral radius of this method is monotonically decreasing.Last,a numerical example is used to verify the correctness of our theoretical results.
Key concepts: Spectral radius, Jacobi method, Correctness, Jacobi eigenvalue algorithm, Iterative method, Mathematics, Applied mathematics, Convergence (economics)