Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications (Q662894)

From MaRDI portal
Revision as of 21:38, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
scientific article

    Statements

    Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 February 2012
    0 references
    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.
    0 references
    0 references
    error free matrix multiplication
    0 references
    floating point arithmetic
    0 references
    error free splitting of floating point numbers
    0 references
    BLAS
    0 references
    dot products of vectors
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers