Title
Fast Inclusion of Interval Matrix Multiplication
Abstract
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.
Year
DOI
Venue
2005
10.1007/s11155-005-3615-2
Reliable Computing
Keywords
Field
DocType
matrix multiplication
Discrete mathematics,Interval matrix,Matrix calculus,Matrix (mathematics),Algorithm,Rounding,Multiplication,Interval arithmetic,Matrix multiplication,Mathematics,Computation
Journal
Volume
Issue
ISSN
11
3
1573-1340
Citations 
PageRank 
References 
6
0.66
5
Authors
2
Name
Order
Citations
PageRank
Takeshi Ogita123123.39
Shin'ichi Oishi228037.14