| dc.creator | Hadjidimos, A. | en |
| dc.creator | Tzoumas, M. | en |
| dc.date.accessioned | 2015-11-23T10:29:21Z | |
| dc.date.available | 2015-11-23T10:29:21Z | |
| dc.date.issued | 2009 | |
| dc.identifier | 10.1016/j.laa.2009.02.024 | |
| dc.identifier.issn | 0024-3795 | |
| dc.identifier.uri | http://hdl.handle.net/11615/28272 | |
| dc.description.abstract | The Linear Complementarity Problem (LCP) has many applications as, e.g., in the solution of Linear and Convex Quadratic Programming, in Free Boundary Value problems of Fluid Mechanics, etc. In the present work we assume that the matrix coefficient M is an element of R(n,n) of the LCP is symmetric positive definite and we introduce the (optimal) nonstationary extrapolation to improve the convergence rates of the well-known Modulus Algorithm and Block Modulus Algorithm for its solution. Two illustrative numerical examples show that the (Optimal) Nonstationary Extrapolated Block Modulus Algorithm is far better than all the previous similar Algorithms. (C) 2009 Elsevier Inc. All rights reserved. | en |
| dc.source | Linear Algebra and Its Applications | en |
| dc.source.uri | <Go to ISI>://WOS:000266580400017 | |
| dc.subject | LCP | en |
| dc.subject | P-matrices | en |
| dc.subject | Real symmetric positive definite matrices | en |
| dc.subject | Iterative | en |
| dc.subject | schemes | en |
| dc.subject | Extrapolation | en |
| dc.subject | (Block) Modulus Algorithm | en |
| dc.subject | MULTISPLITTING RELAXATION METHODS | en |
| dc.subject | ITERATIVE METHODS | en |
| dc.subject | CONVERGENCE | en |
| dc.subject | MATRIX | en |
| dc.subject | OVERRELAXATION | en |
| dc.subject | Mathematics, Applied | en |
| dc.subject | Mathematics | en |
| dc.title | Nonstationary Extrapolated Modulus Algorithms for the solution of the Linear Complementarity Problem | en |
| dc.type | journalArticle | en |
