Cogprints

Domain Decomposition Based High Performance Parallel Computing

Raju , Mandhapati P. and Khaitan, Siddhartha (2009) Domain Decomposition Based High Performance Parallel Computing. [Journal (Paginated)]

Full text available as:

[img]
Preview
PDF (M. P. Raju and S. Khaitan, "Domain Decomposition Based High Performance Parallel Computing", International Journal of Computer Science Issues, IJCSI, Volume 5, pp27-32, October 2009) - Published Version
243Kb

Abstract

The study deals with the parallelization of finite element based Navier-Stokes codes using domain decomposition and state-ofart sparse direct solvers. There has been significant improvement in the performance of sparse direct solvers. Parallel sparse direct solvers are not found to exhibit good scalability. Hence, the parallelization of sparse direct solvers is done using domain decomposition techniques. A highly efficient sparse direct solver PARDISO is used in this study. The scalability of both Newton and modified Newton algorithms are tested.

Item Type:Journal (Paginated)
Keywords:finite element, PARDISO solver, distributed computing, domain decomposition, Newton method
Subjects:Computer Science > Machine Vision
ID Code:6722
Deposited By:International Journal of Computer Science Issues, IJCSI
Deposited On:14 Nov 2009 11:28
Last Modified:11 Mar 2011 08:57

Metadata

Repository Staff Only: item control page