2011•Mianyang Shifan Xueyuan xuebaoRequires access

Convergence Analysis of Iterative Method for L-matrix under Preconditioned AOR

Yonghui Huang

Abstract

This paper is to discuss the convergence analysis of a new preconditioned AOR iterative method for L-matrix.If the coefficient matrix is a strictly dominant L-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 reconditioned AOR iterative method is monotonically decreasing.In the end,some numerical examples to verify the correctness of our theoretical results are given.

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, Correctness, Iterative method, Convergence (economics), Matrix (chemical analysis), Mathematics, Rate of convergence, Applied mathematics