Computer Science – Numerical Analysis
Scientific paper
2010-08-10
Journal of Computational and Applied Mathematics, Volume 236, Issue 3, 2011, Pages 319-325
Computer Science
Numerical Analysis
To appear in Journal of Computational and Applied Mathematics
Scientific paper
10.1016/j.cam.2011.07.017
The solution of large sparse linear systems is often the most time-consuming part of many science and engineering applications. Computational fluid dynamics, circuit simulation, power network analysis, and material science are just a few examples of the application areas in which large sparse linear systems need to be solved effectively. In this paper we introduce a new parallel hybrid sparse linear system solver for distributed memory architectures that contains both direct and iterative components. We show that by using our solver one can alleviate the drawbacks of direct and iterative solvers, achieving better scalability than with direct solvers and more robustness than with classical preconditioned iterative solvers. Comparisons to well-known direct and iterative solvers on a parallel architecture are provided.
No associations
LandOfFree
A domain decomposing parallel sparse linear system solver 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 A domain decomposing parallel sparse linear system solver, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A domain decomposing parallel sparse linear system solver will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-583684