<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>01434naa a22002051i 4500</leader>
  <controlfield tag="001">20</controlfield>
  <controlfield tag="003">KOSZ 005</controlfield>
  <controlfield tag="005">20191005093907.0</controlfield>
  <controlfield tag="008">151208s2002    ru  |  f     |000 ||eng d</controlfield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="c">BPK</subfield>
    <subfield code="d">KOSZ 005/ac</subfield>
  </datafield>
  <datafield tag="041" ind1=" " ind2=" ">
    <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="044" ind1=" " ind2=" ">
    <subfield code="a">RUS</subfield>
  </datafield>
  <datafield tag="080" ind1=" " ind2=" ">
    <subfield code="a">681.325</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Maslennikow, Oleg</subfield>
    <subfield code="d">1996 - 2010.</subfield>
    <subfield code="b">Politechnika Koszali&#x144;ska - Wydzia&#x142; Elektroniki,</subfield>
    <subfield code="c">Katedra In&#x17C;ynierii Komputerowej</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Design of fault-tolerant versions of the main linear algebra algorithms /</subfield>
    <subfield code="c">Oleg Masliennikov.</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Dane z Informatora o publikowanych wynikach prac naukowo-badawczych w 2002 roku Wydzia&#x142;u Elektroniki.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">The modification of the weighted checksum method, which allows to derive the fault-tolerant versions of most linear algebra algorithms is proposed. The purpose is detection and correction of calculation errors occurred due to transient hardware faults. Using the proposed method, the fault-tolerant version of Faddeeva algorithm is increased approximately on O(N2) multiply-add operations in comparsion with the orginal one. However, new algorithm enables to detect and correct a single error in an arbitrary row or column of input data matrices at the each algorithm step. Finally, the results of experimental verification of the proposed algorithm are represented.</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
    <subfield code="i">W :</subfield>
    <subfield code="t">Rejestracija, zberidannja i obrobka danih. -</subfield>
    <subfield code="g">2002, T. 4, nr 3, s. 41-54</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">ART</subfield>
    <subfield code="2">UKD</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">20</subfield>
    <subfield code="d">20</subfield>
  </datafield>
</record>
