<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>0120-419X</journal-id>
<journal-title><![CDATA[Revista Integración]]></journal-title>
<abbrev-journal-title><![CDATA[Integración - UIS]]></abbrev-journal-title>
<issn>0120-419X</issn>
<publisher>
<publisher-name><![CDATA[Universidad Industrial de Santander]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0120-419X2013000100001</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[An extension of the I + Smax preconditioner for the Gauss-Seidel method]]></article-title>
<article-title xml:lang="es"><![CDATA[Una extensión del precondicionador I + Smax para el método de Gauss-Seidel]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[ARENAS]]></surname>
<given-names><![CDATA[ISNARDO]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[CASTILLO]]></surname>
<given-names><![CDATA[PAUL]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[YONG]]></surname>
<given-names><![CDATA[XUERONG]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,University of Puerto Rico Department of Mathematical Sciences ]]></institution>
<addr-line><![CDATA[US ]]></addr-line>
<country>Puerto Rico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2013</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2013</year>
</pub-date>
<volume>31</volume>
<numero>1</numero>
<fpage>1</fpage>
<lpage>14</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0120-419X2013000100001&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S0120-419X2013000100001&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S0120-419X2013000100001&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[. A preconditioning technique based on the application of a fixed but arbitrary number of I +Smax steps is proposed. A reduction of the spectral radius of the Gauss-Seidel iteration matrix is theoretically analyzed for diagonally dominant Z-matrices. In particular, it is shown that after a finite number of steps this matrix reduces to null matrix. To illustrate the performance of the proposed technique numerical experiments on a wide variety of matrices are presented. Point and block versions of the preconditioner are numerically studied.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[Se propone una técnica de precondicionamiento para el método de Gauss-Seidel basada en la aplicación de una cantidad de pasos arbitrarios pero fijos del precondicionador I+Smax. Se analiza de manera teórica la reducción del radio espectral de la matriz de iteración del método de Gauss-Seidel para Z-matrices diagonalmente dominantes. En particular, se demuestra que después de un número finito de pasos esta matriz se reduce a una matriz nula. Para ilustrar la eficacia de la técnica propuesta se presentan experimentos numéricos para una amplia variedad de matrices. Se estudian numéricamente versiones puntuales y de bloques del precondicionador.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Preconditioning]]></kwd>
<kwd lng="en"><![CDATA[Gauss-Seidel method]]></kwd>
<kwd lng="en"><![CDATA[regular splitting]]></kwd>
<kwd lng="en"><![CDATA[point and block preconditioners]]></kwd>
<kwd lng="es"><![CDATA[Precondicionamiento]]></kwd>
<kwd lng="es"><![CDATA[método Gauss-Seidel]]></kwd>
<kwd lng="es"><![CDATA[descomposiciones regulares]]></kwd>
<kwd lng="es"><![CDATA[precondicionadores de punto y bloque]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[   <font size="2" face="Verdana">     <p align="center"><font size="4"><i><b>An extension of the I</b> + S<sub>max</sub> <b>preconditioner for    <br> the Gauss-Seidel method</b></i></font></p>      <p align="center">ISNARDO ARENAS<sup>*</sup>, PAUL CASTILLO, XUERONG YONG    <br> University of Puerto Rico, Department of Mathematical Sciences, Mayag&uuml;ez, Puerto Rico, 00681, US.</p>  <hr>     <p align="justify"><b><i>Abstract</i></b>. A preconditioning technique based on the application of a fixed but arbitrary number of <i>I +S<sub>max</sub></i> steps is proposed. A reduction of the spectral radius of the Gauss-Seidel iteration matrix is theoretically analyzed for diagonally dominant <i>Z</i>-matrices. In particular, it is shown that after a finite number of steps this matrix reduces to null matrix. To illustrate the performance of the proposed technique numerical experiments on a wide variety of matrices are presented. Point and block versions of the preconditioner are numerically studied.    <br> <b><i>Keywords:</i></b> Preconditioning, Gauss-Seidel method, regular splitting, point and block preconditioners.    <br> <b><i>MSC2010:</i></b> XX00YY, AA99BB</p> <hr>     <p align="center"><font size="3"><i><b>Una extensi&oacute;n del precondicionador I</b> + S<sub>max</sub> <b>para el    <br> m&eacute;todo de Gauss-Seidel</b></i></font></p>      ]]></body>
<body><![CDATA[<p align="justify"><b><i>Resumen</i></b>. Se propone una t&eacute;cnica de precondicionamiento para el m&eacute;todo de Gauss-Seidel basada en la aplicaci&oacute;n de una cantidad de pasos arbitrarios pero fijos del precondicionador <i>I+S<sub>max</sub></i>. Se analiza de manera te&oacute;rica la reducci&oacute;n del radio espectral de la matriz de iteraci&oacute;n del m&eacute;todo de Gauss-Seidel para Z-matrices diagonalmente dominantes. En particular, se demuestra que despu&eacute;s de un n&uacute;mero finito de pasos esta matriz se reduce a una matriz nula. Para ilustrar la eficacia de la t&eacute;cnica propuesta se presentan experimentos num&eacute;ricos para una amplia variedad de matrices. Se estudian num&eacute;ricamente versiones puntuales y de bloques del precondicionador.    <br> <i><b>Palabras claves</b></i>: Precondicionamiento, m&eacute;todo Gauss-Seidel, descomposiciones regulares, precondicionadores de punto y bloque.</p> <hr>     <p align="justify">Texto Completo disponible en <a href ="pdf\rein\v31n1\v31n1a01.pdf" target="_blank">PDF</a></p> <hr>     <p align="left"><font size="3"><b><i>References</i></b></font></p>      <!-- ref --><p align="justify">&#91;1&#93; Axelsson O., <i>Iterative Solution Methods</i>, Cambridge University Press, New York, 1994.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000017&pid=S0120-419X201300010000100001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></p>      <!-- ref --><p align="justify">&#91;2&#93; Berman A. and Plemmons R.J., <i>Nonnegative Matrices in the Mathematical Sciences</i>, Classics in Applied Mathematics, 9, SIAM, 1994.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000019&pid=S0120-419X201300010000100002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></p>      <!-- ref --><p align="justify">&#91;3&#93; Castillo P. and Sequeira F.A., &quot;Computational aspects of the Local Discontinuous Galerkin method on unstructured grids in three dimensions&quot;, <i>Mathematical and Computer Modelling</i> 57 (2013), 2279-2288.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000021&pid=S0120-419X201300010000100003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></p>      ]]></body>
<body><![CDATA[<!-- ref --><p align="justify">&#91;4&#93; Du J., Zheng B. and Wang L., &quot;New iterative methods for solving linear systems&quot;, <i>J. Appl. Anal. Comput.</i> 1 (2011), no. 3, 351-360.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000023&pid=S0120-419X201300010000100004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></p>      <!-- ref --><p align="justify">&#91;5&#93; Durlofsky L.J., &quot;Accuracy of mixed and control volume finite element approximations to Darcy velocity and related quantities&quot;, <i>Water Resources Research</i> 30 (1994), no.4, 965-973.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000025&pid=S0120-419X201300010000100005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></p>      <!-- ref --><p align="justify">&#91;6&#93; Gunawardena A.D., Jain S.K. and Snyder L., &quot;Modified iterative methods for consistent linear systems&quot;, <i>Linear Algebra Appl</i>. 154-156 (1991), 123-143.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000027&pid=S0120-419X201300010000100006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></p>      <!-- ref --><p align="justify">&#91;7&#93; Hadjidimos A., Noutsos D. and Tzoumas M., &quot;More on modifications and improvements of classical iterative schemes for M-matrices&quot;, <i>Linear Algebra Appl</i>. 364 (2003), 253-279.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000029&pid=S0120-419X201300010000100007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></p>      <!-- ref --><p align="justify">&#91;8&#93; Kohno T., Kotakemori H., Niki H. and Usui M., &quot;Improving the modified Gauss-Seidel method for Z-matrices&quot;, <i>Linear Algebra Appl</i>. 267 (1997), 113-123.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000031&pid=S0120-419X201300010000100008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></p>      ]]></body>
<body><![CDATA[<!-- ref --><p align="justify">&#91;9&#93; Kotakemori H., Harada K., Morimoto M. and Niki H., &quot;A comparison theorem for the iterative method with preconditioner <i>(I +S<sub>max</sub>)&quot;, J. Comput. Appl. Math</i>. 145 (2002), no. 2, 373-378.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000033&pid=S0120-419X201300010000100009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></p>      <!-- ref --><p align="justify">&#91;10&#93; Kotakemori H., Niki H. and Okamoto N., &quot;Accelerated iterative method for Z-matrices&quot;, <i>J. Comput. Appl. Math.</i> 75 (1996), no. 1, 87-97.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000035&pid=S0120-419X201300010000100010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></p>      <!-- ref --><p align="justify">&#91;11&#93; Liu Q., Chen G. and Cai J., &quot;Convergence analysis of the preconditioned Gauss-Seidel method for H-matrices&quot;, <i>Comput. Math. Appl.</i> 56 (2008), no. 8, 2048-2053.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000037&pid=S0120-419X201300010000100011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></p>      <!-- ref --><p align="justify">&#91;12&#93; Milaszewicz J.P., &quot;Improving Jacobi and Gauss-Seidel iterations&quot;, <i>Linear Algebra Appl.</i> 93 (1987), 161-170.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000039&pid=S0120-419X201300010000100012&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></p>      <!-- ref --><p align="justify">&#91;13&#93; Mokari-Bolhassan M.E. and Trick T.N., &quot;A new iterative algorithm for the solutions of large scale systems&quot;, 28th Midwest Symposium on Circuits and Systems Louisville, Kentucky, 1985.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000041&pid=S0120-419X201300010000100013&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></p>      ]]></body>
<body><![CDATA[<!-- ref --><p align="justify">&#91;14&#93; Morimoto M., Harada K., Sakakihara M. and Sawami H., &quot;The Gauss-Seidel iterative method with the preconditioning matrix <i>(I + S + SM)&quot;, Japan J. Appl. Math.</i> 21 (2004), 25-34.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000043&pid=S0120-419X201300010000100014&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></p>      <!-- ref --><p align="justify">&#91;15&#93; Niki H., Harada K., Morimoto M. and Sakakihara M., &quot;The survey of preconditioners used for accelerating the rate of convergence in the Gauss-Seidel method&quot;, <i>J. Comput. Applied. Math.</i> 164-165 (2004), 587-600.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000045&pid=S0120-419X201300010000100015&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></p>      <!-- ref --><p align="justify">&#91;16&#93; Shao J.L., Huang T.Z. and Zhang G.F., &quot;Linear system based approach for solving some related problems of M-matrices&quot;, <i>Linear Algebra Appl.</i> 432 (2010), 327-337.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000047&pid=S0120-419X201300010000100016&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></p>      <!-- ref --><p align="justify">&#91;17&#93; Shen H., Shao X., Huang Z. and Li C., &quot;Preconditioned Gauss-Seidel iterative method for Z matrices linear systems&quot;, <i>Bull. Korean. Math. Soc.</i> 48 (2011), 303-314.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000049&pid=S0120-419X201300010000100017&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></p>      <!-- ref --><p align="justify">&#91;18&#93; Varga R.S., <i>Matrix Iterative Analysis</i>, Springer Series in Computational Mathematics, Springer, Berlin, 2000.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000051&pid=S0120-419X201300010000100018&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></p>      ]]></body>
<body><![CDATA[<!-- ref --><p align="justify">&#91;19&#93; Zheng B. and Miao S.X., &quot;Two new modified Gauss-Seidel methods for linear systems with M-matrices&quot;, <i>J. Comput. Appl. Math.</i> 233 (2009), 922-930.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000053&pid=S0120-419X201300010000100019&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></p>  <hr>     <p align="left"><sup>*</sup>Corresponding author: <i>E-mail:</i> <a href="mailto:isnardo.arenas@upr.edu">isnardo.arenas@upr.edu</a>.    <br> Received: 03 December 2012, Accepted: 23 March 2013.</p> </font>      ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[O]]></surname>
<given-names><![CDATA[Axelsson]]></given-names>
</name>
</person-group>
<source><![CDATA[Iterative Solution Methods]]></source>
<year>1994</year>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Berman]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Plemmons]]></surname>
<given-names><![CDATA[R.J]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Nonnegative Matrices in the Mathematical Sciences: Classics in Applied Mathematics]]></article-title>
<source><![CDATA[SIAM]]></source>
<year>1994</year>
<page-range>9</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Castillo]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Sequeira]]></surname>
<given-names><![CDATA[F.A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Computational aspects of the Local Discontinuous Galerkin method on unstructured grids in three dimensions]]></article-title>
<source><![CDATA[Mathematical and Computer Modelling]]></source>
<year>2013</year>
<volume>57</volume>
<page-range>2279-2288</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Du]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Zheng]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[New iterative methods for solving linear systems]]></article-title>
<source><![CDATA[J. Appl. Anal. Comput]]></source>
<year>2011</year>
<volume>1</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>351-360</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Durlofsky]]></surname>
<given-names><![CDATA[L.J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Accuracy of mixed and control volume finite element approximations to Darcy velocity and related quantities]]></article-title>
<source><![CDATA[Water Resources Research]]></source>
<year>1994</year>
<volume>30</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>965-973</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gunawardena]]></surname>
<given-names><![CDATA[A.D.]]></given-names>
</name>
<name>
<surname><![CDATA[Jain]]></surname>
<given-names><![CDATA[S.K.]]></given-names>
</name>
<name>
<surname><![CDATA[Snyder]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Modified iterative methods for consistent linear systems]]></article-title>
<source><![CDATA[Linear Algebra Appl]]></source>
<year>1991</year>
<volume>154-156</volume>
<page-range>123-143</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hadjidimos]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Noutsos]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Tzoumas]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[More on modifications and improvements of classical iterative schemes for M-matrices]]></article-title>
<source><![CDATA[Linear Algebra Appl]]></source>
<year>2003</year>
<volume>364</volume>
<page-range>253-279</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kohno]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
<name>
<surname><![CDATA[Kotakemori]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Niki]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Usui]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Improving the modified Gauss-Seidel method for Z-matrices]]></article-title>
<source><![CDATA[Linear Algebra Appl]]></source>
<year>1997</year>
<volume>267</volume>
<page-range>113-123</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kotakemori]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Harada]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
<name>
<surname><![CDATA[Morimoto]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Niki]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A comparison theorem for the iterative method with preconditioner (I +Smax)]]></article-title>
<source><![CDATA[J. Comput. Appl. Math]]></source>
<year>2002</year>
<volume>145</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>373-378</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kotakemori]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Niki]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Okamoto]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Accelerated iterative method for Z-matrices]]></article-title>
<source><![CDATA[J. Comput. Appl. Math]]></source>
<year>1996</year>
<volume>75</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>87-97</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Cai]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Convergence analysis of the preconditioned Gauss-Seidel method for H-matrices]]></article-title>
<source><![CDATA[Comput. Math. Appl.]]></source>
<year>2008</year>
<volume>56</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>2048-2053</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Milaszewicz]]></surname>
<given-names><![CDATA[J.P.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Improving Jacobi and Gauss-Seidel iterations]]></article-title>
<source><![CDATA[Linear Algebra Appl]]></source>
<year>1987</year>
<volume>93</volume>
<page-range>161-170</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mokari-Bolhassan]]></surname>
<given-names><![CDATA[M.E.]]></given-names>
</name>
<name>
<surname><![CDATA[Trick]]></surname>
<given-names><![CDATA[T.N.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A new iterative algorithm for the solutions of large scale systems]]></article-title>
<source><![CDATA[]]></source>
<year>1985</year>
<conf-name><![CDATA[ 28th Midwest Symposium on Circuits and Systems Louisville, Kentucky]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Morimoto]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Harada]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
<name>
<surname><![CDATA[Sakakihara]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Sawami]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[The Gauss-Seidel iterative method with the preconditioning matrix (I + S + SM)]]></article-title>
<source><![CDATA[Japan J. Appl. Math]]></source>
<year>2004</year>
<volume>21</volume>
<page-range>25-34</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Niki]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Harada]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
<name>
<surname><![CDATA[Morimoto]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Sakakihara]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[The survey of preconditioners used for accelerating the rate of convergence in the Gauss-Seidel method]]></article-title>
<source><![CDATA[J. Comput. Applied. Math.]]></source>
<year>2004</year>
<volume>164-165</volume>
<page-range>587-600</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shao]]></surname>
<given-names><![CDATA[J.L.]]></given-names>
</name>
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[T.Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[G.F.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Linear system based approach for solving some related problems of M-matrices]]></article-title>
<source><![CDATA[Linear Algebra Appl]]></source>
<year>2010</year>
<volume>432</volume>
<page-range>327-337</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shen]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Shao]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Preconditioned Gauss-Seidel iterative method for Z matrices linear systems]]></article-title>
<source><![CDATA[Bull. Korean. Math. Soc.]]></source>
<year>2011</year>
<volume>48</volume>
<page-range>303-314</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Varga]]></surname>
<given-names><![CDATA[R.S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Matrix Iterative Analysis]]></source>
<year>2000</year>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zheng]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Miao]]></surname>
<given-names><![CDATA[S.X.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Two new modified Gauss-Seidel methods for linear systems with M-matrices]]></article-title>
<source><![CDATA[J. Comput. Appl. Math.]]></source>
<year>2009</year>
<volume>233</volume>
<page-range>922-930</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
