Search

In this paper, a new matrix splitting iteration method is presented to solve the absolute value equation. The proposed method has three parameters, and it is expected that its convergence efficiency can be improved by selecting appropriate parameters. The convergence of the proposed method is studied. Numerical examples of the absolute value equation with M-matrices are given to show the effectiveness and feasibility of the proposed method.

Picard-type methods are efficient methods for solving the absolute value equation Ax−|x|=b. To further improve the performance of Picard iteration method, a new inexact Picard iteration method, named Picard-SHSS iteration method, is proposed to solve the absolute value equation. The sufficient condition for the convergence of the proposed method for solving the absolute value equation is given. A numerical example is given to demonstrate the effectiveness of the new method.

In this paper, we further investigate the single proper nonnegative splittings and double proper nonnegative splittings of rectangular matrices. Two convergence theorems for the single proper nonnegative splitting of a semimonotone matrix are derived, and more comparison results for the spectral radii of matrices arising from the single proper nonnegative splittings and double proper nonnegative splittings of different rectangular matrices are presented. The obtained results generalize the previous ones, and it can be regarded as the useful supplement of the results in [Comput. Math. Appl., 67: 136–144, 2014] and [Results. Math., 71: 93–109, 2017].

The comparison results for K-double splittings of one K-monotone matrix are established in the literatures. As comparison theorems between the spectral radii of different matrices are a useful tool for judging the efficiency of preconditioners, we propose some comparison results for K-nonnegative double splittings of different K-monotone matrices in this note. The obtained results generalize the previous ones.

Based on the single-step iteration (SSI) method for the non-Hermitian positive definite linear systems, we propose a Uzawa-SSI method for solving the saddle point problems with non-Hermitian positive definite (1, 1) block in this paper. The convergence and semi-convergence properties of the Uzawa-SSI method, respectively, for nonsingular and singular cases are analyzed. Numerical examples with experiments are given to show the robustness and the efficiency of Uzawa-SSI method.

Abstract Recently, based on the Hadjidimos preconditioner, a preconditioned GAOR method was proposed for solving the linear complementarity problem (Liu and Li in East Asian J. Appl. Math. 2:94–107, 2012). In this paper, we propose a new preconditioned GAOR method for solving the linear complementarity problem with an M-matrix. The convergence of the proposed method is analyzed, and the comparison results are obtained to show it accelerates the convergence of the original GAOR method and the preconditioned GAOR method in (Liu and Li in East Asian J. Appl. Math. 2:94–107, 2012). Numerical examples verify the theoretical analysis.

Comparison theorems between the spectral radii of different matrices are useful tools for judging the efficiency of preconditioners. In this paper, some comparison theorems for the spectral radii of matrices arising from proper splittings of different semimonotone matrices are presented.