Cart (Loading....) | Create Account
Close category search window

On parallel performance of an implicit discontinuous Galerkin compressible flow solver based on different linear solvers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Ali, A. ; Centre for Adv. Studies in Pure & Appl. Math., Bahauddin Zakariya Univ. (BZU), Multan, Pakistan ; Syed, K.S. ; Hassan, A. ; Ahmad, I.
more authors

Parallelization of an Implicit discontinuous Galerkin method based on Taylor series basis for the compressible flows on unstructured meshes is developed for distributed memory architectures, specifically for cost effective compute clusters. The system of linear equations arising from the implicit time integration is solved using three choices of linear solvers: SGS(k) (Symmetric Gauss-Seidel with k iterations), LU-SGS (Lower-Upper Symmetric Gauss-Seidel), and a well known Krylov subspace iterative solver GMRES (Generalized Minimum Residual) preconditioned with LUSGS. The comparative study of the parallel performance of the flow solver based on the different linear solvers is tested on a number of parallel platforms; ranging from compute clusters to multicore machines. The parallelization is based on computational domain partitioning using the well-known mesh partitioning software, METIS, and SPMD (Single Program Multiple Data) message-passing programming paradigm using MPI (Message Passing Interface) library, which is a de facto industry standard for portable programming.

Published in:

Multitopic Conference (INMIC), 2011 IEEE 14th International

Date of Conference:

22-24 Dec. 2011

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.