Fast algorithms for floating-point interval matrix multiplication

Katsuhisa Ozaki*, Takeshi Ogita, Siegfried M. Rump, Shin'Ichi Oishi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)


We discuss several methods for real interval matrix multiplication. First, earlier studies of fast algorithms for interval matrix multiplication are introduced: naive interval arithmetic, interval arithmetic by midpointradius form by OishiRump and its fast variant by OgitaOishi. Next, three new and fast algorithms are developed. The proposed algorithms require one, two or three matrix products, respectively. The point is that our algorithms quickly predict which terms become dominant radii in interval computations. We propose a hybrid method to predict which algorithm is suitable for optimizing performance and width of the result. Numerical examples are presented to show the efficiency of the proposed algorithms.

Original languageEnglish
Pages (from-to)1795-1814
Number of pages20
JournalJournal of Computational and Applied Mathematics
Issue number7
Publication statusPublished - 2012 Jan


  • Interval arithmetic
  • Matrix multiplication
  • Verified numerical computations

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Fast algorithms for floating-point interval matrix multiplication'. Together they form a unique fingerprint.

Cite this