### Abstract

This paper is concerned with the tight enclosure of matrix multiplication AB for two floating-point matrices A and B. The aim of this paper is to compute component-wise upper and lower bounds of the exact result C of the matrix multiplication AB by floating-point arithmetic. Namely, an interval matrix enclosing C is obtained. In this paper, new algorithms for enclosing C are proposed. The proposed algorithms are designed to mainly exploit the level 3 operations in BLAS. Although the proposed algorithms take around twice as much costs as a standard algorithm promoted by Oishi and Rump, the accuracy of the result by the proposed algorithms is better than that of the standard algorithm. At the end of this paper, we present numerical examples showing the efficiency of the proposed algorithms.

Original language | English |
---|---|

Pages (from-to) | 237-248 |

Number of pages | 12 |

Journal | Numerical Linear Algebra with Applications |

Volume | 18 |

Issue number | 2 |

DOIs | |

Publication status | Published - 2011 Mar 1 |

### Keywords

- Interval arithmetic
- Matrix multiplication
- Verified numerical computation

### ASJC Scopus subject areas

- Algebra and Number Theory
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Tight and efficient enclosure of matrix multiplication by using optimized BLAS'. Together they form a unique fingerprint.

## Cite this

*Numerical Linear Algebra with Applications*,

*18*(2), 237-248. https://doi.org/10.1002/nla.724