P. Le Tallec - Academia.edu (original) (raw)

Related Authors

Charbel Farhat

Abdoulaye Samaké

Universite des Sciences de Techniques et de technologies de Bamako

Uploads

Papers by P. Le Tallec

Research paper thumbnail of Algebraic Two-Level Preconditioners for the Schur Complement Method

SIAM Journal on Scientific Computing, 2001

The solution of elliptic problems is challenging on parallel distributed memory computers as thei... more The solution of elliptic problems is challenging on parallel distributed memory computers as their Green's functions are global. To address this issue, we present a set of preconditioners for the Schur complement domain decomposition method. They implement a global coupling mechanism, through coarse space components, similar to the one proposed in 3]. The de nition of the coarse space components is algebraic, they are de ned using the mesh partitioning information and simple interpolation operators. These preconditioners are implemented on distributed memory computers without introducing any new global synchronization in the preconditioned conjugate gradient iteration. The numerical and parallel scalability of those preconditioners is illustrated on two-dimensional model examples that have anisotropy and/or discontinuity phenomena.

Research paper thumbnail of Algebraic Two-Level Preconditioners for the Schur Complement Method

SIAM Journal on Scientific Computing, 2001

The solution of elliptic problems is challenging on parallel distributed memory computers as thei... more The solution of elliptic problems is challenging on parallel distributed memory computers as their Green's functions are global. To address this issue, we present a set of preconditioners for the Schur complement domain decomposition method. They implement a global coupling mechanism, through coarse space components, similar to the one proposed in 3]. The de nition of the coarse space components is algebraic, they are de ned using the mesh partitioning information and simple interpolation operators. These preconditioners are implemented on distributed memory computers without introducing any new global synchronization in the preconditioned conjugate gradient iteration. The numerical and parallel scalability of those preconditioners is illustrated on two-dimensional model examples that have anisotropy and/or discontinuity phenomena.

Log In