Accelerated Multiple Precision Matrix Multiplication using Strassen's Algorithm and Winograd's Variant

@article{Kouya2014AcceleratedMP,
  title={Accelerated Multiple Precision Matrix Multiplication using Strassen's Algorithm and Winograd's Variant},
  author={Tomonori Kouya},
  journal={JSIAM Lett.},
  year={2014},
  volume={6},
  pages={81-84}
}
  • Tomonori Kouya
  • Published 2014
  • Mathematics, Computer Science
  • JSIAM Lett.
  • The Strassen algorithm and Winograd's variant accelerate matrix multiplication by using fewer arithmetic operations than standard matrix multiplication. Although many papers have been published to accelerate single- as well as double-precision matrix multiplication by using these algorithms, no research to date has been undertaken to accelerate multiple precision matrix multiplication. In this paper, we propose a multiple precision matrix multiplication program for matrices of any size and test… CONTINUE READING
    4 Citations

    References

    SHOWING 1-8 OF 8 REFERENCES
    Strassen's Matrix Multiplication on GPUs
    • 39
    • PDF
    Implementation of Strassen's Algorithm for Matrix Multiplication
    • 126
    • PDF
    Matrix multiplication via arithmetic progressions
    • 1,190
    • PDF
    Gaussian elimination is not optimal
    • 2,219
    • PDF
    Accuracy and stability of numerical algorithms
    • 2,529
    • PDF
    Accuracy and Stability of Numerical Algorithms (2nd
    • 2002
    Matrix Computations
    • 6,466
    • PDF
    Matrix Computations (4th ed.)
    • bits, Lower: 1024 bits)
    • 2013