On preconditioned AOR method for solving linear systems

02/03/2020
by   Yongzhong Song, et al.
0

In this paper, we investigate the preconditioned AOR method for solving linear systems. We study two general preconditioners and propose some lower triangular, upper triangular and combination preconditioners. For A being an L-matrix, a nonsingular M-matrix, an irreducible L-matrix and an irreducible nonsingular M-matrix, four types of comparison theorems are presented, respectively. They contain a general comparison result, a strict comparison result and two Stein-Rosenberg type comparison results. Our theorems include and are better than almost all known corresponding results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/03/2022

A Method for the Automated Discovery of Angle Theorems

The Naive Angle Method, used by Geometry Expressions for solving problem...
research
06/19/2021

Comparison Theorems for Splittings of M-matrices in (block) Hessenberg Form

Some variants of the (block) Gauss-Seidel iteration for the solution of ...
research
03/05/2020

A generalized projection iterative methods for solving non-singular linear systems

In this paper, we propose and analyze iterative method based on projecti...
research
04/08/2023

A comparison of Krylov methods for Shifted Skew-Symmetric Systems

It is well known that for general linear systems, only optimal Krylov me...
research
10/06/2021

Fast and flexible preconditioners for solving multilinear systems

This paper investigates a type of fast and flexible preconditioners to s...
research
12/03/2016

A Matrix Splitting Perspective on Planning with Options

We show that the Bellman operator underlying the options framework leads...
research
05/03/2021

What's Decidable about (Atomic) Polymorphism

Due to the undecidability of most type-related properties of System F li...

Please sign up or login with your details

Forgot password? Click here to reset