ScholarLens Back to search
2013•Journal of Inner Mongolia University for the NationalitiesRequires access

A New Preconditioned AOR Iterative Method and Comparison Theorems

Zhao Ton

Open publisher page 0 citations

Abstract

In this paper,we present a new preconditioned AOR iterative method and prove it is converge.It shows that the rate of the preconditioned AOR iterative method is faster than that of the basic AOR iterative method.Numerical example verifies validity.

About this research paper

What this paper is about

In this paper,we present a new preconditioned AOR iterative method and prove it is converge.It shows that the rate of the preconditioned AOR iterative method is faster than that of the basic AOR iterative method.Numerical example verifies validity.

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

In this paper,we present a new preconditioned AOR iterative method and prove it is converge.It shows that the rate of the preconditioned AOR iterative method is faster than that of the basic AOR iterative method.Numerical example verifies validity.

Key concepts: Iterative method, Mathematics, Applied mathematics, Algorithm, Mathematical optimization, Computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A New Preconditioned AOR Iterative Method and Comparison Theorems — Research Paper | ScholarLens