Open AccessA cluster-based technique for solving the GAVE
Author(s) -
Wenxiu Guo
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1707/1/012024
Subject(s) - sign (mathematics) , cluster analysis , mathematics , cluster (spacecraft) , zero (linguistics) , computer science , iterative method , process (computing) , algorithm , value (mathematics) , mathematical optimization , mathematical analysis , statistics , linguistics , philosophy , programming language , operating system
Generalized absolute value equation (abbreviated as GAVE) has wide applications in scientific computing and engineering. In this paper, we propose a cluster-based technique for solving the GAVE. First, the GAVE is shown to be equivalent to a linear equation which is related to the signs of the solution. In order to avoid the disadvantage of the existence of the sign index sets which is problem depended, by the framework of a fixed-point iteration, the analysis of the signs of the iteration vectors is given. Some necessary conditions of the nonzero and zero entries of the iteration vector are presented. Then, the signs of the solution of the GAVE can be partitioned by a clustering process. Numerical examples show that the proposed technique can work and significantly accelerate the computational efficiency comparing to some existing methods.