A Shift Splitting Iteration Method for Generalized Absolute Value Equations

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Cui-Xia Li ◽  
Shi-Liang Wu
Keyword(s):  
Iteration Method ◽  
Numerical Experiments ◽  
Absolute Value Equations ◽  
Convergence Conditions ◽  
Absolute Value ◽  
Splitting Technique ◽  
Splitting Iteration Method ◽  
Generalized Absolute Value Equations

Abstract In this paper, based on the shift splitting technique, a shift splitting (SS) iteration method is presented to solve the generalized absolute value equations. Convergence conditions of the SS method are discussed in detail when the involved matrices are some special matrices. Finally, numerical experiments show the effectiveness of the proposed method.

scholarly journals The Picard-HSS-SOR iteration method for absolute value equations

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Lin Zheng
Keyword(s):  
Iteration Method ◽  
Numerical Experiments ◽  
Absolute Value Equation ◽  
Absolute Value Equations ◽  
Absolute Value ◽  
Convergence Results ◽  
Hss Iteration ◽  
The Absolute ◽  
Hss Iteration Method

AbstractIn this paper, we present the Picard-HSS-SOR iteration method for finding the solution of the absolute value equation (AVE), which is more efficient than the Picard-HSS iteration method for AVE. The convergence results of the Picard-HSS-SOR iteration method are proved under certain assumptions imposed on the involved parameter. Numerical experiments demonstrate that the Picard-HSS-SOR iteration method for solving absolute value equations is feasible and effective.

scholarly journals Modified SOR-Like Method for Absolute Value Equations

2020 ◽  
Vol 2020 ◽  
pp. 1-6
Author(s):  
Cui-Xia Li ◽  
Shi-Liang Wu
Keyword(s):  
Fixed Point ◽  
Nonlinear Equation ◽  
Computational Efficiency ◽  
Numerical Experiments ◽  
Absolute Value Equations ◽  
Convergence Conditions ◽  
Absolute Value ◽  
Fixed Point Equation ◽  
Point Equation ◽  
Better Than

In this paper, based on the work of Ke and Ma, a modified SOR-like method is presented to solve the absolute value equations (AVE), which is gained by equivalently expressing the implicit fixed-point equation form of the AVE as a two-by-two block nonlinear equation. Under certain conditions, the convergence conditions for the modified SOR-like method are presented. The computational efficiency of the modified SOR-like method is better than that of the SOR-like method by some numerical experiments.

A Fast Shift-Splitting Iteration Method for Nonsymmetric Saddle Point Problems

2017 ◽  
Vol 7 (1) ◽  
pp. 172-191 ◽  
Author(s):  
Quan-Yu Dou ◽  
Jun-Feng Yin ◽  
Ze-Yu Liao
Keyword(s):  
Saddle Point ◽  
Iteration Method ◽  
Numerical Experiments ◽  
Saddle Point Problems ◽  
Splitting Technique ◽  
Splitting Iteration Method

AbstractBased on the shift-splitting technique and the idea of Hermitian and skew-Hermitian splitting, a fast shift-splitting iteration method is proposed for solving nonsingular and singular nonsymmetric saddle point problems in this paper. Convergence and semi-convergence of the proposed iteration method for nonsingular and singular cases are carefully studied, respectively. Numerical experiments are implemented to demonstrate the feasibility and effectiveness of the proposed method.

scholarly journals Two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems

Filomat ◽  
2020 ◽  
Vol 34 (7) ◽  
pp. 2171-2184
Author(s):  
Lu Jia ◽  
Xiang Wang ◽  
Xuan-Sheng Wang
Keyword(s):  
Theoretical Analysis ◽  
Linear Complementarity Problem ◽  
Iteration Method ◽  
Complementarity Problem ◽  
Numerical Experiments ◽  
Complementarity Problems ◽  
Linear Complementarity Problems ◽  
Linear Complementarity ◽  
Matrix Splitting ◽  
Splitting Iteration Method

The modulus-based matrix splitting iteration has received substantial attention as a momentous tool for complementarity problems. For the purpose of solving the horizontal linear complementarity problem, we introduce the two-step modulus-based matrix splitting iteration method. We also show the theoretical analysis of the convergence. Numerical experiments illustrate the effectiveness of the proposed approach.

On the SOR-like iteration method for solving absolute value equations

2019 ◽  
Vol 97 ◽  
pp. 107-113 ◽  
Author(s):  
Peng Guo ◽  
Shi-Liang Wu ◽  
Cui-Xia Li
Keyword(s):  
Iteration Method ◽  
Absolute Value Equations ◽  
Absolute Value

scholarly journals Iterative schemes induced by block splittings for solving absolute value equations

Filomat ◽  
2020 ◽  
Vol 34 (12) ◽  
pp. 4171-4188
Author(s):  
Nafiseh Shams ◽  
Alireza Fakharzadeh Jahromi ◽  
Fatemeh Beik
Keyword(s):  
Iterative Method ◽  
Iterative Methods ◽  
Numerical Experiments ◽  
Sufficient Conditions ◽  
Convergence Properties ◽  
Absolute Value Equations ◽  
Absolute Value ◽  
Iterative Schemes ◽  
Generalized Newton ◽  
Special Case

In this paper, we develop the idea of constructing iterative methods based on block splittings (BBS) to solve absolute value equations. The class of BBS methods incorporates the well-known Picard iterative method as a special case. Convergence properties of mentioned schemes are proved under some sufficient conditions. Numerical experiments are examined to compare the performance of the iterative schemes of BBS-type with some of existing approaches in the literature such as generalized Newton and Picard(-HSS) iterative methods.

Sign in / Sign up

Export Citation Format

Share Document