Generalization of error-free transformation for matrix multiplication and its application

スポンサーリンク

概要

• 論文の詳細を見る

• This paper is concerned with accurate numerical algorithms for matrix multiplication. Recently, an error-free transformation from a product of two floating-point matrices into an unevaluated sum of floating-point matrices has been developed by the authors. Combining this technique and accurate summation algorithms, new algorithms for accurate matrix multiplication could be investigated. In this paper, it is mentioned that the previous work is not the unique way to achieve an error-free transformation and the constraint of the error-free transformation is clarified. For the application, a new algorithm is developed reducing the number of matrix products compared to the previous algorithm.

• The Institute of Electronics, Information and Communication Engineersの論文

著者

• Ozaki Katsuhisa

  Department Of Mathematical Sciences School Of Sciences Tokai University

• Ogita Takeshi

  Division of Mathematical Sciences, School of Arts and Sciences, Tokyo Woman's Christian University

• Ozaki Katsuhisa

  Department of Mathematical Sciences, Shibaura Institute of Technology

• Rump Siegfried

  Faculty of Science and Engineering, Waseda University

関連論文

• Spherical Data and Ray Tracing of Surfaces in n-dimensional Space
• Generalization of error-free transformation for matrix multiplication and its application
• A modified algorithm for accurate inverse Cholesky factorization

スポンサーリンク