<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06006051</id>
  <dt>j</dt>
  <an>06006051</an>
  <augroup>
    <au>Ozaki, Katsuhisa</au>
    <au>Ogita, Takeshi</au>
    <au>Oishi, Shin'ichi</au>
    <au>Rump, Siegfried M.</au>
  </augroup>
  <ti>Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications.</ti>
  <so>Numer. Algorithms 59, No. 1, 95-118 (2012).</so>
  <py>2012</py>
  <pu>Springer, Dordrecht</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>error free matrix multiplication</ut>
    <ut>floating point arithmetic</ut>
    <ut>error free splitting of floating point numbers</ut>
    <ut>BLAS</ut>
    <ut>dot products of vectors</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/s11075-011-9478-1</li>
  </ligroup>
  <abgroup>
    <ab>The authors develop a fast and accurate method to evaluate matrix products error free. An error free splitting of floating point numbers with regards to number product is generalized to accurate dot products of vectors and error free matrix products. Floating point numbers, vectors and matrices are split into a sum of numbers, vectors and matrices, respectively, with a limited small number of nonzero leading bits and their products are expressed as non-evaluated sums of accurate floating point products until the matrix product stage is reached. There 3rd level BLAS are used to give fast and accurate matrix products. This method uses the more memory the deeper (shorter nonzero bit length) the splittings become.</ab>
    <rv>Frank Uhlig (Auburn)</rv>
  </abgroup>
</item>