کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
8901088 1631728 2018 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Memory-usage advantageous block recursive matrix inverse
ترجمه فارسی عنوان
استفاده از حافظه استفاده معکوس ماتریس برگشت پذیر
کلمات کلیدی
ماتریس های بلوک، ماتریسهای بزرگ، مکمل شوگر، معکوس بازگشتی ماتریسی، استفاده کم از حافظه،
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
چکیده انگلیسی
The inversion of extremely high order matrices has been a challenging task because of the limited processing and memory capacity of conventional computers. In a scenario in which the data does not fit in memory, it is worth to consider exchanging less memory usage for more processing time in order to enable the computation of the inverse which otherwise would be prohibitive. We propose a new algorithm to compute the inverse of block partitioned matrices with a reduced memory footprint. The algorithm works recursively to invert one block of a k × k block matrix M, with k ≥ 2, based on the successive splitting of M. It computes one block of the inverse at a time, in order to limit memory usage during the entire processing. Experimental results show that, despite increasing computational complexity, matrices that otherwise would exceed the memory-usage limit can be inverted using this technique.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 328, 1 July 2018, Pages 125-136
نویسندگان
, , , ,