L. Giraud

Learn More
This note presents some experiments on different clusters of SMPs, where both distributed and shared memory parallel programming paradigms can be naturally combined. Although the platforms exhibit the same macroscopic memory organization, it appears that their individual overall performance is closely dependent on the ability of their hardware to(More)
The numerical simulation of semiconductor devices is extremely demanding in term of computational time because it involves complex embedded numerical schemes. At the kernel of these schemes is the solution of very ill-conditioned large linear systems. In this paper, we present the various ingredients of some hybrid iterative schemes that play a central role(More)
In this paper we study the parallel scalability of variants of additive Schwarz precondition-ers for three dimensional non-overlapping domain decomposition methods. To alleviate the computational cost, both in terms of memory and floating-point complexity, we investigate variants based on a sparse approximation or on mixed 32-and 64-bit calculation. The(More)
In this paper we study the computational performance of variants of an algebraic additive Schwarz preconditioner for the Schur complement for the solution of large sparse linear systems. In earlier works, the local Schur complements were computed exactly using a sparse direct solver. The robustness of the preconditioner comes at the price of this memory and(More)
  • 1