2021
DOI: 10.31926/but.mif.2021.1.63.1.2
|View full text |Cite
|
Sign up to set email alerts
|

On unique solvability and Picard’s iterative method for absolute value equations

Abstract: In this paper, we deal with unique solvability and numerical solution ofabsolute value equations (AVE),Ax−B|x|=b, (A,B∈Rn×n,b∈Rn).Under some weaker conditions, a simple proof is given for unique solvabilityof AVE. Furthermore, we demonstrate with an example that these results arereliable to detect unique solvability of AVE. These results are also extendedto unique solvability of standard and horizontal linear complementarity prob-lems. Finally, we suggest a Picard iterative method to compute an approx-imated s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(6 citation statements)
references
References 7 publications
0
6
0
Order By: Relevance
“…Theorem 4.9. [2] The GAVE has exactly one solution for any d if A T A − ||B|| 2 2 I is a P-matrix. Remark 4.10.…”
Section: P-matrixmentioning
confidence: 99%
See 4 more Smart Citations
“…Theorem 4.9. [2] The GAVE has exactly one solution for any d if A T A − ||B|| 2 2 I is a P-matrix. Remark 4.10.…”
Section: P-matrixmentioning
confidence: 99%
“…Remark 4.10. Achache et al [2] shows that condition of Theorem 4.9 is slighter weaker then condition of Theorem 4.8 with help of an example. Now we discussed all diferent types of AVEs separately.…”
Section: P-matrixmentioning
confidence: 99%
See 3 more Smart Citations