2011•Journal of Shantou UniversityRequires access

A New Comparison Theorem for the Preconditioned AOR Iterative Method

Huang Yong-hui

Abstract

In this paper,the convergence analysis for a new preconditioned AOR iterative method is discussed. If the coefficient matrix is a nonsingular M-matrix,the convergence rate of the preconditioned AOR iterative method is faster than one of the AOR methods. In addition,the spectral radius of the preconditioned AOR iterative method is monotone decreasing. At last,some numerical examples are given to explain our theoretical results.

About this research paper

What this paper is about

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

Key concepts: Spectral radius, Invertible matrix, Mathematics, Iterative method, Applied mathematics, Rate of convergence, Convergence (economics), Matrix (chemical analysis)