Name
Abstract | ||
|---|---|---|
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 midpoint-radius form by Oishi-Rump and its fast variant by Ogita-Oishi. 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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.cam.2011.10.011 | J. Computational Applied Mathematics |
Keywords | Field | DocType |
dominant radius,floating-point interval matrix multiplication,interval matrix multiplication,real interval matrix multiplication,fast variant,interval arithmetic,fast algorithm,naive interval arithmetic,interval computation,matrix product,proposed algorithm,matrix multiplication | Multiplication algorithm,Interval matrix,Floating point,Matrix (mathematics),Algorithm,Multiplication,Interval arithmetic,Matrix multiplication,Mathematics,Computation | Journal |
Volume | Issue | ISSN |
236 | 7 | 0377-0427 |
Citations | PageRank | References |
5 | 0.58 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Katsuhisa Ozaki | 1 | 13 | 4.70 |
| Takeshi Ogita | 2 | 231 | 23.39 |
| Siegfried M. Rump | 3 | 774 | 102.83 |
| Shin'ichi Oishi | 4 | 280 | 37.14 |