Skip to Main content Skip to Navigation
New interface
Theses

Robust domain decomposition methods for symmetric positive definite problems

Abstract : The objective of this thesis is to design domain decomposition methods which are robust even for hard problems that arise when simulating industrial or real life objects. For instance one particular challenge which the company Michelin is faced with is the fact that tires are made of rubber and steel which are two materials with very different behavior laws. With classical domain decomposition methods, as soon as the partition into subdomains does not accommodate the discontinuities between the different materials convergence deteriorates. For three popular domain decomposition methods (Ad- ditive Schwarz, FETI and BDD) we have proved that by solving a generalized eigenvalue problem in each of the subdomains we can identify automatically which are the modes responsible for slow convergence. In other words we can divide the original problem into two problems : the first one where we can guarantee that the domain decomposition method will converge quickly and the second where we cannot. The final idea is to apply projections to solve these two problems independently (this is also known as deflation) : on the first we apply the domain decomposition method and on the second (we call it the coarse space) we use a direct solver which we know will be robust. We guarantee theoretically that the resulting two level solver is robust. The other main feature of our algorithms is that they can be implemented as black box solvers meaning that heterogeneous materials is only one type of difficulty that they can identify and circumvent.
Document type :
Theses
Complete list of metadata

Cited literature [113 references]  Display  Hide  Download

https://theses.hal.science/tel-00958252
Contributor : ABES STAR :  Contact
Submitted on : Wednesday, March 12, 2014 - 9:57:42 AM
Last modification on : Saturday, November 20, 2021 - 3:50:08 AM
Long-term archiving on: : Thursday, June 12, 2014 - 10:55:55 AM

File

These_archivage_3071623.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-00958252, version 1

Citation

Nicole Spillane. Robust domain decomposition methods for symmetric positive definite problems. General Mathematics [math.GM]. Université Pierre et Marie Curie - Paris VI, 2014. English. ⟨NNT : 2014PA066005⟩. ⟨tel-00958252⟩

Share

Metrics

Record views

448

Files downloads

355