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

ASJC Scopus subject areas

  • ソフトウェア
  • 計算数学
  • 応用数学

フィンガープリント

「Fast inclusion of interval matrix multiplication」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル