An Error-Free Transformation for Matrix Multiplication with Reproducible Algorithms and Divide and Conquer Methods

Research output: Contribution to journalConference article

Abstract

This paper discusses accurate numerical algorithms for matrix multiplication. Matrix multiplication is a basic and important problem in numerical linear algebra. Numerical computations using floating-point arithmetic can be quickly performed on existing computers. However, the accumulation of rounding errors due to finite precision arithmetic is a critical problem. An error-free transformation for matrix multiplication is reviewed in this paper. Such a transformation is extremely useful for developing accurate numerical algorithms for matrix multiplication. One advantage of the transformation is that it exploits Basic Linear Algebra Subprograms (BLAS). We provide a rounding error analysis of reproducible algorithms for matrix multiplication based on the error-free transformation. In addition, we propose an error-free transformation for matrix multiplication that can be utilized with the divide and conquer methods.

Original languageEnglish
Article number012062
JournalJournal of Physics: Conference Series
Volume1490
Issue number1
DOIs
Publication statusPublished - 2020 Jun 9
Event5th International Conference on Mathematics: Pure, Applied and Computation, ICoMPAC 2019 - Surabaya, Indonesia
Duration: 2019 Oct 19 → …

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Fingerprint Dive into the research topics of 'An Error-Free Transformation for Matrix Multiplication with Reproducible Algorithms and Divide and Conquer Methods'. Together they form a unique fingerprint.

  • Cite this