Improvement of error-free splitting for accurate matrix multiplication
From MaRDI portal
Publication:2349545
DOI10.1016/j.cam.2015.04.010zbMath1320.65070OpenAlexW2031740465MaRDI QIDQ2349545
Shin'ichi Oishi, Katsuhisa Ozaki, Takeshi Ogita
Publication date: 22 June 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2015.04.010
Uses Software
Cites Work
- Unnamed Item
- Fast enclosure for solutions of Sylvester equations
- Verified error bounds for solutions of Sylvester matrix equations
- Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
- Error estimation of floating-point summation and dot product
- Computing predecessor and successor in rounding to nearest
- Fast inclusion of interval matrix multiplication
- A floating-point technique for extending the available precision
- Improved Error Bounds for Inner Products in Floating-Point Arithmetic
- Tight and efficient enclosure of matrix multiplication by using optimized BLAS
- Ultimately Fast Accurate Summation
- A Fortran 90-based multiprecision system
- Accurate and Efficient Floating Point Summation
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Design, implementation and testing of extended and mixed precision BLAS
- Accurate Sum and Dot Product
This page was built for publication: Improvement of error-free splitting for accurate matrix multiplication