Abstract
In the present work we consider the iterative solution of the Linear Complementarity Problem (LCP), with a nonsingular H + coefficient matrix A, by using all modulus-based matrix splitting iterative methods that have been around for the last couple of years. A deeper analysis shows that the iterative solution of the LCP by the modified Accelerated Overrelaxation (MAOR) iterative method is the "best", in a sense made precise in the text, among all those that have been proposed so far regarding the following three issues: i) The positive diagonal matrix-parameter Ω ? diag(A) involved in the method is Ω = diag(A), ii) The known convergence intervals for the two AOR parameters, ? and β, are the widest possible, and iii) The "best" possible MAOR iterative method is the modified Gauss-Seidel one.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
