Domain Decomposition Based High Performance Parallel Computing
Distributed, Parallel, and Cluster Computing
2009-11-05 v1
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.
Cite
@article{arxiv.0911.0910,
title = {Domain Decomposition Based High Performance Parallel Computing},
author = {Mandhapati P. Raju and Siddhartha Khaitan},
journal= {arXiv preprint arXiv:0911.0910},
year = {2009}
}
Comments
International Journal of Computer Science Issues, IJCSI, Volume 5, pp27-32, October 2009