Incomplete LU Factorization on Projection Method
نویسندگان
چکیده
منابع مشابه
Fine-Grained Parallel Incomplete LU Factorization
This paper presents a new fine-grained parallel algorithm for computing an incomplete LU factorization. All nonzeros in the incomplete factors can be computed in parallel and asynchronously, using one or more sweeps that iteratively improve the accuracy of the factorization. Unlike existing parallel algorithms, the new algorithm does not depend on reordering the matrix. Numerical tests show tha...
متن کاملILUT: A dual threshold incomplete LU factorization
In this paper we describe an Incomplete LU factorization technique based on a strategy which combines two heuristics. This ILUT factorization extends the usual ILU(0) factorization without using the concept of level of ll-in. There are two traditional ways of developing incomplete factorization preconditioners. The rst uses a symbolic factorization approach in which a level of ll is attributed ...
متن کاملOn Level Scheduling for Incomplete LU Factorization Preconditioners on Accelerators
The application of the finite element method for the numerical solution of partial differential equations naturally leads tolarge systems of linear equations represented by a sparse system matrix A and right hand side b. These systems are commonly solved using iterative solvers, particularly Krylov subspace methods, which are typically accelerated using preconditioners to obtain good convergenc...
متن کاملScalable Task-Oriented Parallelism for Structure Based Incomplete LU Factorization
ILU(k) is an important preconditioner widely used in many linear algebra solvers for sparse matrices. Unfortunately, there is still no highly scalable parallel ILU(k) algorithm. This paper presents the first such scalable algorithm. For example, the new algorithm achieves 50 times speedup with 80 nodes for general sparse matrices of dimension 160,000 that are diagonally dominant. The algorithm ...
متن کاملLevel-based Incomplete LU Factorization: Graph Model and Algorithms
A graph theoretic process that models level-based, incomplete LU factorization (ILU(`)) of sparse unsymmetric matrices is developed. The model leads to two incomplete fill path theorems that are generalizations of the original fill path theorem of Rose, Tarjan, and Lueker. Our S-level incomplete fill path theorem leads to the development of new, embarrassingly parallel algorithms for computing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cumhuriyet Science Journal
سال: 2016
ISSN: 1300-1949,1300-1949
DOI: 10.17776/csj.18615