<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">378914200</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180305123549.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">161128e20040201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1515/156939804322802594</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)gruyter-10.1515/156939804322802594</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Paasonen</subfield>
   <subfield code="D">V. I.</subfield>
   <subfield code="u">Institute of Computational Technologies, Siberian Branch of the Russian Academy of Sciences, Novosibirsk 630090, Russia</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Compact difference schemes for inhomogeneous boundary value problems</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[V. I. Paasonen]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In this paper, we investigate the method of the numerical solution of boundary value problems in inhomogeneous domains composed of homogeneous multidimensional parallelepipeds. The method is the symbiosis of high-order difference schemes in homogeneous subdomains and multipoint one-dimensional boundary conditions at interfaces.Due to splitting, the boundary value problem reduces to systems of linear algebraic equations with matrices different from a tridiagonal matrix by the availability of separate 'long' rows with more than three nonzero elements. Two algorithms are investigated to solve these systems. The first algorithm is based on the immediate transformation of the system of equations to a tridiagonal form. The second one is a generalization of the known sweep parallelizing method.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Copyright 2004, Walter de Gruyter</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Russian Journal of Numerical Analysis and Mathematical Modelling</subfield>
   <subfield code="d">Walter de Gruyter</subfield>
   <subfield code="g">19/1(2004-02-01), 65-81</subfield>
   <subfield code="x">0927-6467</subfield>
   <subfield code="q">19:1&lt;65</subfield>
   <subfield code="1">2004</subfield>
   <subfield code="2">19</subfield>
   <subfield code="o">rnam</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1515/156939804322802594</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</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="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.1515/156939804322802594</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">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Paasonen</subfield>
   <subfield code="D">V. I.</subfield>
   <subfield code="u">Institute of Computational Technologies, Siberian Branch of the Russian Academy of Sciences, Novosibirsk 630090, Russia</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">Russian Journal of Numerical Analysis and Mathematical Modelling</subfield>
   <subfield code="d">Walter de Gruyter</subfield>
   <subfield code="g">19/1(2004-02-01), 65-81</subfield>
   <subfield code="x">0927-6467</subfield>
   <subfield code="q">19:1&lt;65</subfield>
   <subfield code="1">2004</subfield>
   <subfield code="2">19</subfield>
   <subfield code="o">rnam</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="b">CC0</subfield>
   <subfield code="u">http://creativecommons.org/publicdomain/zero/1.0</subfield>
   <subfield code="2">nationallicence</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="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-gruyter</subfield>
  </datafield>
 </record>
</collection>
