A Preconditioned Multisplitting and Schwarz Method for Linear Complementarity Problem

<table class="table-group" id="tab3"><tr><td><table class="table"><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr class="thead"><td align="left" rowspan="2"><svg height="11.3125" id="M215" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 14.9875 11.3125" width="14.9875" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.113)"><path d="M857 650l-6 -28q-44 -4 -61.5 -16.5t-29.5 -48.5q-11 -32 -37 -166l-78 -399h-29l-351 537h-4l-56 -276q-24 -120 -24 -164q0 -35 17.5 -46t75.5 -15l-6 -28h-245l7 28q41 2 62 14t31 44q10 30 41 171l53 245q8 44 6.5 60.5t-14.5 33.5q-10 15 -27 19.5t-64 6.5l6 28h153
l350 -516h5l48 257q25 131 25 171q0 34 -17.5 45t-77.5 15l7 28h240z" id="x1D441"></path></g>
</svg> * <svg height="11.3125" id="M216" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 14.9875 11.3125" width="14.9875" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.113)"><path d="M857 650l-6 -28q-44 -4 -61.5 -16.5t-29.5 -48.5q-11 -32 -37 -166l-78 -399h-29l-351 537h-4l-56 -276q-24 -120 -24 -164q0 -35 17.5 -46t75.5 -15l-6 -28h-245l7 28q41 2 62 14t31 44q10 30 41 171l53 245q8 44 6.5 60.5t-14.5 33.5q-10 15 -27 19.5t-64 6.5l6 28h153
l350 -516h5l48 257q25 131 25 171q0 34 -17.5 45t-77.5 15l7 28h240z" id="x1D441"></path></g>
</svg></td><td align="center"> MMS</td><td align="center"> GSOR </td></tr><tr class="thead"><td align="center"> Iterative steps</td><td align="center"> Iterative steps </td></tr><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr><td align="left"> 32 * 32</td><td align="center"> 21</td><td align="center"> 30 </td></tr><tr><td align="left"> 64 * 64</td><td align="center"> 21</td><td align="center"> 31 </td></tr><tr><td align="left"> 128 * 128</td><td align="center"> 22</td><td align="center"> 33 </td></tr><tr class="table-tr"><td colspan="3"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Comparison of MMS and GSOR with preconditioned methods (<svg height="11.175" id="M214" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 15.0375 11.175" width="15.0375" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.113)"><path d="M865 650q-1 -4 -4 -14t-4 -14q-62 -5 -77 -19.5t-29 -82.5l-74 -394q-12 -61 -0.5 -77t75.5 -21l-6 -28h-273l8 28q64 5 82 21t29 76l36 198h-380l-37 -197q-11 -64 0.5 -78.5t79.5 -19.5l-6 -28h-268l6 28q60 6 75.5 21.5t26.5 76.5l75 394q13 66 2 81.5t-77 20.5l8 28
h263l-6 -28q-58 -5 -75.5 -21t-30.5 -81l-26 -153h377l29 153q12 67 2 81t-74 21l5 28h268z" id="x1D43B"></path></g>
</svg>-matrix).

Journal of Applied Mathematics

tab3

Table 3

Table 3: A Preconditioned Multisplitting and Schwarz Method for Linear Complementarity Problem 