Mantas Mikaitis

Sharper Bounds on the Required Fixed-Point Precision for Emulating Floating-Point Matrix Multiplication

Precision emulation algorithms, such as the Ozaki schemes, can leverage low-precision matrix multiply–accumulate to approximate the product \(AB\) , where \(A\) and \(B\) are high-precision floating-point matrices, via fixed-point arithmetic. A key difficulty of these approaches...