Preconditioned AOR Iterative Method and Comparison Theorems
Song Dai-cai
Abstract
Song Dai-cai
Abstract
Under the preconditioned matrix(P=I+B),a new AOR iterative method is discussed,presenting the convergence quality of the method.This paper also gives the comparison theorems between the proposed AOR iterative method and the classic AOR iterative method.Then a numerical example is given,which explain the precondition iterative method is better than(I+S).
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.
Under the preconditioned matrix(P=I+B),a new AOR iterative method is discussed,presenting the convergence quality of the method.This paper also gives the comparison theorems between the proposed AOR iterative method and the classic AOR iterative method.Then a numerical example is given,which explain the precondition iterative method is better than(I+S).
Key concepts: Precondition, Iterative method, Convergence (economics), Applied mathematics, Mathematics, Matrix (chemical analysis), Computer science, Mathematical optimization