Performance evaluation of multiple precision matrix multiplications using parallelized Strassen and Winograd algorithms

@article{Kouya2016PerformanceEO,
  title={Performance evaluation of multiple precision matrix multiplications using parallelized Strassen and Winograd algorithms},
  author={Tomonori Kouya},
  journal={JSIAM Lett.},
  year={2016},
  volume={8},
  pages={21-24}
}
  • Tomonori Kouya
  • Published 2016
  • Mathematics, Computer Science
  • JSIAM Lett.
  • It is well known that Strassen and Winograd algorithms can reduce the computational costs associated with dense matrix multiplication. We have already shown that they are also very effective for software-based multiple precision floating-point arithmetic environments such as the MPFR/GMP library. In this paper, we show that we can obtain the same effectiveness for double-double (DD) and quadruple-double (QD) environments supported by the QD library, and that parallelization can increase the… CONTINUE READING
    2 Citations
    Reduction of Multiplications in Convolutional Neural Networks

    References

    SHOWING 1-7 OF 7 REFERENCES
    Matrix multiplication via arithmetic progressions
    • 1,190
    • Highly Influential
    • PDF
    Gaussian elimination is not optimal
    • 2,219
    • Highly Influential
    • PDF
    Maryland
    • 44
    • PDF
    Matrix Computations (4th ed.), Maryland
    • 2013
    The MPFR library
    • http://www.mpfr.org/. 8 50.3 26.7 15.1 1.E-64 1.E-58 1.E-52 1.E-46 1.E-40 1.E-34 1.E-28 1.E-22 1.E-16 1.E-10 1.E-04 0.0 10.0 20.0 30.0 40.0 50.0 60.0 70.0 80.0 Normal LU 1 2 3 4 5 6 7 8 9 10 M a x. R e la ti v e E rr o r C o m p .T im e
    • 1024
    The gnu multiple precision arithmetic library
    • 605