Fast inclusion of interval matrix multiplication

Takeshi Ogita, Shin'ichi Oishi

研究成果: Article

6 引用 (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.

元の言語English
ページ(範囲)191-205
ページ数15
ジャーナルReliable Computing
11
発行部数3
DOI
出版物ステータスPublished - 2005 6 1

    フィンガープリント

ASJC Scopus subject areas

  • Software
  • Computational Mathematics
  • Applied Mathematics

これを引用