Application of Parallel Algebraic Multigrid Algorithms in Geophysics
نویسندگان
چکیده
منابع مشابه
Reducing Complexity in Parallel Algebraic Multigrid Preconditioners
Algebraic multigrid (AMG) is a very efficient iterative solver and preconditioner for large unstructured linear systems. Traditional coarsening schemes for AMG can, however, lead to computational complexity growth as problem size increases, resulting in increased memory use and execution time, and diminished scalability. Two new parallel AMG coarsening schemes are proposed, that are based on so...
متن کاملMapping Robust Parallel Multigrid Algorithms
SUMMARY The convergence rate of standard multigrid algorithms degenerates on problems with stretched grids or anisotropic operators. The usual cure for this is the use of line or plane relaxation. However, multigrid algorithms based on line and plane relaxation have limited and awkward parallelism and are quite diicult to map eeectively to highly parallel architectures. Newer multigrid algorith...
متن کاملParallel algebraic multigrid based on subdomain blocking
The algebraic multigrid AMG approach provides a purely algebraic means to tackle the e cient solution of systems of equations posed on large unstructured grids in D and D While sequential AMG has been used for increasingly large problems with several million unknowns its application to even larger applications requires a parallel version Since in contrast to geometric multigrid the hierarchy of...
متن کاملDistance-two interpolation for parallel algebraic multigrid
Algebraic multigrid (AMG) is one of the most efficient and scalable parallel algorithms for solving sparse linear systems on unstructured grids. However, for large 3D problems, the coarse grids that are normally used in AMG often lead to growing complexity in terms of memory use and execution time per AMG V-cycle. Sparser coarse grids, such as those obtained by the parallel modified independent...
متن کاملParallel Algebraic Algorithms
In algebra, and particularly in the study of the algebraic structures known as fields, there are a number of problems that enjoy efficient sequential algorithms. Many of these sequential algorithms do not present immediately obvious parallel algorithms, but from a theoretical perspective, it is still interesting to study the parallel complexity of these problems. We investigate three specific a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Engineering
سال: 2012
ISSN: 1877-7058
DOI: 10.1016/j.proeng.2012.01.377