<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">465751725</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180323111835.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170327e19901201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/BF02238802</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/BF02238802</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Solving the linear least squares problem with very high relative accuracy</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[J. Gluchowska, A. Smoktunowicz]</subfield>
  </datafield>
  <datafield tag="246" ind1="1" ind2=" ">
   <subfield code="a">Die Lösung des linearen Problems der kleinsten Quadrate mit sehr hoher relativer Genauigkeit</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">A version of binary cascades iterative refinement (LSBCIR) for solving linear least squares problem min x ‖b-Ax‖2,A(m*n),m&gt;n=rank(A), to a prescribed accuracy ε&gt;0 is proposed and investigated. The time cost of the process in the sequential computation is of order $$mn^2 M(t_0 ) + mnM\left( {\left\lceil {\log _2 /\varepsilon } \right\rceil } \right)$$ , wheret 0 is a basic mantissa length andM(t)=Kt 2 is the time cost of two numbers multiplication infl(t).</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag, 1990</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Linear least squares problem</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">iterative refinement</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">algorithm</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Gluchowska</subfield>
   <subfield code="D">J.</subfield>
   <subfield code="u">Institute of Informatics, University of Warsaw, PKiN, VIIIp., p. 850, 00-901, Warsaw, Poland</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Smoktunowicz</subfield>
   <subfield code="D">A.</subfield>
   <subfield code="u">Institute of Informatics, University of Warsaw, PKiN, VIIIp., p. 850, 00-901, Warsaw, Poland</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Computing</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">45/4(1990-12-01), 345-354</subfield>
   <subfield code="x">0010-485X</subfield>
   <subfield code="q">45:4&lt;345</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">45</subfield>
   <subfield code="o">607</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/BF02238802</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.1007/BF02238802</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">Gluchowska</subfield>
   <subfield code="D">J.</subfield>
   <subfield code="u">Institute of Informatics, University of Warsaw, PKiN, VIIIp., p. 850, 00-901, Warsaw, Poland</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">Smoktunowicz</subfield>
   <subfield code="D">A.</subfield>
   <subfield code="u">Institute of Informatics, University of Warsaw, PKiN, VIIIp., p. 850, 00-901, Warsaw, Poland</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">Computing</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">45/4(1990-12-01), 345-354</subfield>
   <subfield code="x">0010-485X</subfield>
   <subfield code="q">45:4&lt;345</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">45</subfield>
   <subfield code="o">607</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="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-springer</subfield>
  </datafield>
 </record>
</collection>
