A new Approach for the Modulus-Based Matrix Splitting Algorithms

A new Approach for the Modulus-Based Matrix Splitting Algorithms

We investigate the modulus-based matrix splitting iteration algorithms for solving the linear complementarity problems (LCPs) and propose a new model to solve it. The structure of the new model is straightforward and can be extended to other issues of type of complementarity. Convergence analysis of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE access 2019, Vol.7, p.100143-100146
Hauptverfasser: Wang, Wenpeng, Zhou, Zhi, Edalatpanah, S. A., Najafi, S. E.
Format: Artikel
Sprache:eng
Schlagworte:
Acceleration
Algorithms
Convergence
convergence analysis
Iterative algorithms
iterative method
Iterative methods
Linear complementarity problem
Mathematical analysis
Mathematical model
Matrix methods
matrix splitting
Numerical models
Splitting
Symmetric matrices
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We investigate the modulus-based matrix splitting iteration algorithms for solving the linear complementarity problems (LCPs) and propose a new model to solve it. The structure of the new model is straightforward and can be extended to other issues of type of complementarity. Convergence analysis of the new approach for the symmetric positive definite matrix is also discussed. The numerical results of the proposed approach are compared with the existing algorithms to show its efficiency.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2019.2930562