<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Algorithm-based fault tolerance in linear algebra tasks</title>
  </titleInfo>
  <name type="personal">
    <namePart>Maslennikow, Oleg</namePart>
    <namePart type="termsOfAddress">Politechnika Koszalińska - Wydział Elektroniki, Katedra Inżynierii Komputerowej</namePart>
    <namePart type="date">1996 - 2010</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="conference">
    <namePart>International Conference on Signals and Electronic Systems ICSES 2002 (2002 ; Wrocław / Świeradów Zdrój, Polska).</namePart>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">conference publication</genre>
  <genre authority="">Materiały konferencyjne.</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">pl</placeTerm>
    </place>
    <dateIssued encoding="marc">2002</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
  </physicalDescription>
  <abstract>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.</abstract>
  <targetAudience authority="marctarget">specialized</targetAudience>
  <note type="statement of responsibility">Oleg Masliennikov.</note>
  <subject authority="lcsh">
    <topic>Układy elektroniczne</topic>
  </subject>
  <relatedItem type="host" displayLabel="W:">
    <titleInfo>
      <title>ICSES'2002 : proceedings of the International Conference on Signals and Electronic Systems, Wrocław - Świeradów Zdrój, Poland 24-27 September 2002 / [ed. by R. Makowski]. -</title>
    </titleInfo>
    <originInfo>
      <publisher>Wrocław : Wrocławskie Towarzystwo Naukowe,  2002. -</publisher>
    </originInfo>
    <part>
      <text>s. 313-318</text>
    </part>
  </relatedItem>
  <recordInfo>
    <recordContentSource authority="marcorg"/>
    <recordCreationDate encoding="marc">151208</recordCreationDate>
    <recordChangeDate encoding="iso8601">20191005093907.0</recordChangeDate>
    <recordIdentifier source="KOSZ 005">15</recordIdentifier>
  </recordInfo>
</mods>
