Volume 47, Number 1, January-March 2013
|Page(s)||59 - 71|
|Published online||07 March 2013|
Iterative methods with analytical preconditioning technique to linear complementarity problems: application to obstacle problems
Department of Mathematics, Faculty of Sciences, Islamic Azad
2 Young Researchers Club, Lahijan Branch, Islamic Azad University, Lahijan, Iran
Received: 29 February 2012
Accepted: 3 December 2012
For solving linear complementarity problems LCP more attention has recently been paid on a class of iterative methods called the matrix-splitting. But up to now, no paper has discussed the effect of preconditioning technique for matrix-splitting methods in LCP. So, this paper is planning to fill in this gap and we use a class of preconditioners with generalized Accelerated Overrelaxation (GAOR) methods and analyze the convergence of these methods for LCP. Furthermore, Comparison between our methods and other non-preconditioned methods for the studied problem shows a remarkable agreement and reveals that our models are superior in point of view of convergence rate and computing efficiency. Besides, by choosing the appropriate parameters of these methods, we derive same results as the other iterative methods such as AOR, JOR, SOR etc. Finally the method is tested by some numerical experiments.
Mathematics Subject Classification: 90C33 / 65F10
Key words: Linear complementarity problems / preconditioning / iterative methods / H-matrix / obstacle problems
© EDP Sciences, ROADEF, SMAI, 2013
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.