Fast inclusion of interval matrix multiplication

Takeshi Ogita*, Shin'ichi Oishi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


This paper is concerned with interval matrix multiplication.New algorithms are proposed to calculate an inclusion of the product of interval matrices using rounding mode controlled computation. Thecomputational cost of the proposed algorithms is almost the same as that for calculating an inclusion of the product of point matrices.Numerical results are presented to illustrate that the new algorithms are much faster than the conventional algorithms and that the guaranteed accuracies obtained by the proposed algorithms are comparable to those of the conventional algorithms.

Original languageEnglish
Pages (from-to)191-205
Number of pages15
JournalReliable Computing
Issue number3
Publication statusPublished - 2005 Jun

ASJC Scopus subject areas

  • Software
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Fast inclusion of interval matrix multiplication'. Together they form a unique fingerprint.

Cite this