کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6935110 1449559 2018 37 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Incomplete Sparse Approximate Inverses for Parallel Preconditioning
ترجمه فارسی عنوان
معکوس تقریبی ناقص تقریبا به طور پیش فرض برای موازی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
چکیده انگلیسی
In this paper, we propose a new preconditioning method that can be seen as a generalization of block-Jacobi methods, or as a simplification of the sparse approximate inverse (SAI) preconditioners. The “Incomplete Sparse Approximate Inverses” (ISAI) is in particular efficient in the solution of sparse triangular linear systems of equations. Those arise, for example, in the context of incomplete factorization preconditioning. ISAI preconditioners can be generated via an algorithm providing fine-grained parallelism, which makes them attractive for hardware with a high concurrency level. In a study covering a large number of matrices, we identify the ISAI preconditioner as an attractive alternative to exact triangular solves in the context of incomplete factorization preconditioning.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Parallel Computing - Volume 71, January 2018, Pages 1-22
نویسندگان
, , , ,