It is known that the spectral radius of the iterative tensor can be seen as an approximate
convergence rate for solving multi-linear systems by tensor splitting iterative methods. So in …

In this paper, we propose a new preconditioned SOR method for solving the multi-linear
systems whose coefficient tensor is an M M-tensor. The corresponding comparison for …

In this paper, the Jacobi and Gauss–Seidel-type iteration methods are proposed for solving
the matrix equation AXB= C, which are based on the splitting schemes of the matrices A and …

Linear systems with M-matrices often appear in a wide variety of areas. In this paper, we
give general preconditioners for solving the systems with nonsingular M-matrix. We show …

In the past years, a growing interest to solve linear systems with modified iterative methods
has been shown by researchers. Recently, Dehghan and Hajarian (J Vib Control, doi …

By introducing two parameters in the splittings of the matrices A and B, this paper presents a
parameterized accelerated iteration (PAI) method for solving the matrix equation AXB= C …

In this paper, based on the iteration frameworks [6], several relaxed iteration methods are
proposed for solving the matrix equation AXB= C by introducing a tunable parameter ω, and …

The purpose of this paper is to present new preconditioning techniques for solving
nonnegative matrices linear system and M-matrices linear system Ax= b based on the I+ S …

In this paper, we first present a general preconditioner P for solving linear complementarity
problem (LCP) associated with an M-matrix A and a vector f, and prove that the LCP (A, f) is …

In this note recent comparison results for preconditioned Gauss–Seidel (GS) methods are
discussed. A new strict comparison result between two different preconditioned GS methods …