2010•Unpublished venueRequires access

Preconditioned AOR Iterative Method And Comparison Theorems For Irreducible L-matrices

Aijuan Li

Abstract

Abstract—A preconditioned AOR iterative method is proposed with the preconditioner I + S ∗ αβ. Some comparison theorems are given when the coefficient matrix of linear system A is an irreducible L−matrix. The convergence rate of AOR iterative method with the preconditioner I + S ∗ αβ is faster than the convergence rate with the preconditioner I + Sα by Li et al. Numerical example verifies comparison theorems.

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