Domain Decomposition Based High Performance Parallel Computing

Details Domain Decomposition Based High Performance Parallel Computing Domain Decomposition Based High Performance Parallel Computing

2009-11-04

arxiv.org/abs/0911.0910v1

M. P. Raju and S. Khaitan, "Domain Decomposition Based High Performance Parallel Computing", International Journal of Computer

Computer Science

Distributed, Parallel, and Cluster Computing

International Journal of Computer Science Issues, IJCSI, Volume 5, pp27-32, October 2009

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Domain Decomposition Based High Performance Parallel Computing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Domain Decomposition Based High Performance Parallel Computing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Domain Decomposition Based High Performance Parallel Computing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-620909