کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
524194 868567 2008 18 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On finding approximate supernodes for an efficient block-ILU(k) factorization
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
On finding approximate supernodes for an efficient block-ILU(k) factorization
چکیده انگلیسی

Among existing preconditioners, the level-of-fill ILU has been quite popular as a general-purpose technique. Experimental observations have shown that, when coupled with block techniques, these methods can be quite effective in solving realistic problems arising from various applications. In this work, we consider an extension of this kind of method which is suitable for parallel environments. Our method is developed from the framework of high performance sparse direct solvers. The main idea we propose is to define an adaptive blockwise incomplete factorization that is much more accurate (and numerically more robust) than the scalar incomplete factorizations commonly used to precondition iterative solvers. These requirements lead to a robust class of parallel preconditioners based on generalized versions of block ILU techniques.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Parallel Computing - Volume 34, Issues 6–8, July 2008, Pages 345–362
نویسندگان
, , ,