A Relaxed Maximum-Based Normal \texorpdfstring{$S$}{S}-Iteration Method for Generalized Absolute Value Equations (Q7367845)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Relaxed Maximum-Based Normal \texorpdfstring{$S$}{S}-Iteration Method for Generalized Absolute Value Equations |
No description defined |
Statements
A Relaxed Maximum-Based Normal \texorpdfstring{$S$}{S}-Iteration Method for Generalized Absolute Value Equations (English)
0 references
5 October 2026
0 references
math.OC
0 references
math.NA
0 references
Abhishek Kumar Singh Sengar
0 references
Bharat Kumar
0 references
Deepmala
0 references
A relaxed maximum-based normal $S$-iteration method (RMNSI) for solving generalized absolute value equations (GAVEs). RMNSI avoids selecting an auxiliary matrix and requires only a single factorization of $A+B$, assuming it's non-singular, guaranteeing global convergence from any starting point and R-linear convergence.
0 references
Relaxed Maximum-Based
0 references
Generalized Absolute Value
0 references
Fixed-Point Iteration
0 references
Global Convergence
0 references
Linear Systems
0 references
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
