Skip to Main content Skip to Navigation

Une méthode de décomposition de domaine mixte non-intrusive pour le calcul parallèle d’assemblages

Abstract : Abstract : Assemblies are critical elements for industrial structures. Strong non-linearities such as frictional contact, as well as poorly controlled preloads make complex all accurate sizing. Present in large numbers on industrial structures (a few million for an A380), this involves managing numerical problems of very large size. The numerous interfaces of frictional contact are sources of difficulties of convergence for the numerical simulations. It is therefore necessary to use robust but also reliable methods. The use of iterative methods based on domain decomposition allows to manage extremely large numerical models. This needs to be coupled with adaptedtechniques in order to take into account the nonlinearities of contact at the interfaces between subdomains. These methods of domain decomposition are still scarcely used in industries. Internal developments in finite element codes are often necessary, and thus restrain this transfer from the academic world to the industrial world.In this thesis, we propose a non-intrusive implementation of these methods of domain decomposition : that is, without development within the source code. In particular, we are interested in the Latin method whose philosophy is particularly adapted to nonlinear problems. It consists in decomposing the structure into sub-domains that are connected through interfaces. With the Latin method the non-linearities are solved separately from the linear differential aspects. Then the resolution is based on an iterative scheme with two search directions that make the global linear problems and the nonlinear local problems dialogue.During this thesis, a totally non-intrusive tool was developed in Code_Aster to solve assembly problems by a mixed domain decomposition technique. The difficulties posed by the mixed aspect of the Latin method are solved by the introduction of a non-local search direction. Robin conditions on the subdomain interfaces are taken into account simply without modifying the sources of Code_Aster. We proposed an algebraic rewriting of the multi-scale approach ensuring the extensibility of the method. We were also interested in coupling the Latin method in domain decomposition to a Krylov algorithm. Applied only to a substructured problem with perfect interfaces, this coupling accelerates the convergence. Preloaded structures with numerous contact interfaces have been processed. Simulations that could not be carried out by a direct computationwith Code_Aster were performed via this non-intrusive domain decomposition strategy.
Complete list of metadata
Contributor : ABES STAR :  Contact
Submitted on : Friday, September 15, 2017 - 2:25:08 PM
Last modification on : Wednesday, August 3, 2022 - 3:59:42 AM
Long-term archiving on: : Saturday, December 16, 2017 - 12:59:28 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01588293, version 1


Paul Oumaziz. Une méthode de décomposition de domaine mixte non-intrusive pour le calcul parallèle d’assemblages. Mécanique des solides [physics.class-ph]. Université Paris Saclay (COmUE), 2017. Français. ⟨NNT : 2017SACLN030⟩. ⟨tel-01588293⟩



Record views


Files downloads