<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">606167331</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128100702.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150801xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s10665-014-9699-0</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s10665-014-9699-0</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Partitioning strategies for the block Cimmino algorithm</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[L. Drummond, Iain Duff, Ronan Guivarch, Daniel Ruiz, Mohamed Zenadi]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In the context of the block Cimmino algorithm, we study preprocessing strategies to obtain block partitionings that can be applied to general linear systems of equations $$\mathbf{A}\mathbf{x}= \mathbf{b}$$ A x = b . We study strategies that transform the matrix $$\mathbf{A}\mathbf{A}^\mathrm{{T}}$$ A A T into a matrix with a block tridiagonal structure. This provides a partitioning of the linear system for row projection methods because block Cimmino is essentially equivalent to block Jacobi on the normal equations, and the resulting partition will yield a two-block partition of the original matrix. Therefore, the resulting block partitioning should improve the rate of convergence of block row projection methods such as block Cimmino. We discuss a method for obtaining a partitioning using a dropping strategy that gives more blocks at the cost of relaxing the two-block partitioning. We then use a hypergraph partitioning that works directly on the matrix $$\mathbf{A}$$ A to reduce directly the connections between blocks. We give numerical results showing the performance of these techniques both in their effect on the convergence of the block Cimmino algorithm and in their ability to exploit parallelism.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media Dordrecht, 2014</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Cuthill McKee</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Hypergraph partitioning</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Iterative methods</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Sparse matrices</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Unsymmetric matrices</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Drummond</subfield>
   <subfield code="D">L.</subfield>
   <subfield code="u">Computational Research Division, Lawrence Berkeley National Laboratory, One Cyclotron Road, 94720, Berkeley, CA, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Duff</subfield>
   <subfield code="D">Iain</subfield>
   <subfield code="u">Centre Européen de Recherche et de Formation Avancée en Calcul Scientifique (CERFACS), 42 Ave G. Coriolis, 31057, Toulouse Cedex, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Guivarch</subfield>
   <subfield code="D">Ronan</subfield>
   <subfield code="u">ENSEEIHT-IRIT, 2 rue Charles Camichel, BP 7122, 31071, Toulouse Cedex 7, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Ruiz</subfield>
   <subfield code="D">Daniel</subfield>
   <subfield code="u">ENSEEIHT-IRIT, 2 rue Charles Camichel, BP 7122, 31071, Toulouse Cedex 7, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Zenadi</subfield>
   <subfield code="D">Mohamed</subfield>
   <subfield code="u">ENSEEIHT-IRIT, 2 rue Charles Camichel, BP 7122, 31071, Toulouse Cedex 7, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Journal of Engineering Mathematics</subfield>
   <subfield code="d">Springer Netherlands</subfield>
   <subfield code="g">93/1(2015-08-01), 21-39</subfield>
   <subfield code="x">0022-0833</subfield>
   <subfield code="q">93:1&lt;21</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">93</subfield>
   <subfield code="o">10665</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s10665-014-9699-0</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s10665-014-9699-0</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Drummond</subfield>
   <subfield code="D">L.</subfield>
   <subfield code="u">Computational Research Division, Lawrence Berkeley National Laboratory, One Cyclotron Road, 94720, Berkeley, CA, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Duff</subfield>
   <subfield code="D">Iain</subfield>
   <subfield code="u">Centre Européen de Recherche et de Formation Avancée en Calcul Scientifique (CERFACS), 42 Ave G. Coriolis, 31057, Toulouse Cedex, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Guivarch</subfield>
   <subfield code="D">Ronan</subfield>
   <subfield code="u">ENSEEIHT-IRIT, 2 rue Charles Camichel, BP 7122, 31071, Toulouse Cedex 7, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Ruiz</subfield>
   <subfield code="D">Daniel</subfield>
   <subfield code="u">ENSEEIHT-IRIT, 2 rue Charles Camichel, BP 7122, 31071, Toulouse Cedex 7, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Zenadi</subfield>
   <subfield code="D">Mohamed</subfield>
   <subfield code="u">ENSEEIHT-IRIT, 2 rue Charles Camichel, BP 7122, 31071, Toulouse Cedex 7, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Journal of Engineering Mathematics</subfield>
   <subfield code="d">Springer Netherlands</subfield>
   <subfield code="g">93/1(2015-08-01), 21-39</subfield>
   <subfield code="x">0022-0833</subfield>
   <subfield code="q">93:1&lt;21</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">93</subfield>
   <subfield code="o">10665</subfield>
  </datafield>
 </record>
</collection>
