کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4640067 | 1341259 | 2012 | 20 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Fast algorithms for floating-point interval matrix multiplication
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computational and Applied Mathematics - Volume 236, Issue 7, January 2012, Pages 1795–1814
Journal: Journal of Computational and Applied Mathematics - Volume 236, Issue 7, January 2012, Pages 1795–1814
نویسندگان
Katsuhisa Ozaki, Takeshi Ogita, Siegfried M. Rump, Shin’ichi Oishi,