<?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>01917naa a22002171i 4500</leader>
  <controlfield tag="001">15</controlfield>
  <controlfield tag="003">KOSZ 005</controlfield>
  <controlfield tag="005">20191005093907.0</controlfield>
  <controlfield tag="008">151208s2002    pl  |  f     |100 ||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">POL</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">Algorithm-based fault tolerance in linear algebra tasks /</subfield>
    <subfield code="c">Oleg Masliennikov.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">The modification of weighted checksum method is proposed, which allows to derive the fault tolerant versions of most linear algebra algorithms. The purpose is detection and correction of calculation errors occurred due to transient hardware faults. Usine the proposed method, the fault-tolerant version of Faddeeva algorithm is designed in this paper. The computational complexity of new algorithm is increased approximately on O(N2~)) multiply-add operations in comparison with the original one. However, new algorithm enables to detect and to correct a single error in an arbitrary row or column of input data matrices at the each algorithm step. Hence, it is possible to correct up to N2~) and (N2~)/2+N P) single errors during realization of whole Jordan-Gauss and Faddeeva algorithms respectively. Finally, the results of experimental verification of the proposed algorithm are represented.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Uk&#x142;ady elektroniczne.</subfield>
  </datafield>
  <datafield tag="655" ind1=" " ind2="0">
    <subfield code="a">Materia&#x142;y konferencyjne.</subfield>
  </datafield>
  <datafield tag="711" ind1="2" ind2="2">
    <subfield code="a">International Conference on Signals and Electronic Systems ICSES 2002</subfield>
    <subfield code="d">(2002 ;</subfield>
    <subfield code="c">Wroc&#x142;aw / &#x15A;wierad&#xF3;w Zdr&#xF3;j, Polska).</subfield>
    <subfield code="p">ICSES'2002</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
    <subfield code="i">W:</subfield>
    <subfield code="t">ICSES'2002 : proceedings of the International Conference on Signals and Electronic Systems, Wroc&#x142;aw - &#x15A;wierad&#xF3;w Zdr&#xF3;j, Poland 24-27 September 2002 / [ed. by R. Makowski]. -</subfield>
    <subfield code="d">Wroc&#x142;aw : Wroc&#x142;awskie Towarzystwo Naukowe,  2002. -</subfield>
    <subfield code="g">s. 313-318</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">ROZ</subfield>
    <subfield code="2">UKD</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">15</subfield>
    <subfield code="d">15</subfield>
  </datafield>
</record>
