1 July 2016 in Mechanism and Machine Theory
1 December 2017 in Computers & Structures
5 June 2024 in International Journal for Numerical Methods in Engineering
The phase field modeling of fracture is able to simulate the nucleation and the propagation of complex crack patterns. However, the relatively small internal lengths that are required usually lead to very fine meshes and high computational costs, especially for three‐dimensional applications. In the present work, additional cost also comes from the implicit dynamics regularization of unstable crack propagations which potentially leads to a large variation of time steps when switching from quasi‐static to dynamic regimes. To reduce the time to solution in this context, this study proposes a domain decomposition framework and acceleration techniques for the phase field fracture staggered solver. The displacement subproblem and the phase field one are solved with parallel domain decomposition solvers. Dual domain decomposition methods provide low cost preconditioner well adapted to the phase field subproblem. For displacement subproblems undergoing unstable crack propagations, primal domain decomposition methods are preferred to be less sensitive to the treatment of floating substructures. Preconditioners performances are assessed and scalability studies over academic test cases, up to 324 subdomains, are presented. Finally, the robustness of the approach is illustrated on two semi‐industrial simulations.
9 January 2023 in International Journal for Numerical Methods in Engineering
Summary: This article introduces a robust and affordable method to compute nullspace and generalized inverse of finite element operators involved in dual domain decomposition methods. The methodology relies on the operator partial factorization and on the analysis of a well chosen Schur complement. The sparse linear operator is interpreted as a network and graph centrality measures are used to select the condensation variables. Eigenvector, Katz and Page Rank centralities are evaluated. An extension to deal with symmetric indefinite systems arising from mixed finite elements is also presented. The approach is assessed on highly heterogeneous problems and one industrial application is presented: the numerical homogenization of solid propellant.
18 December 2013 in Mechanics & Industry
This work presents the dynamic modeling of ball bearing which uses multibody dynamic formalism. Such formalism allows immediate integration of the model in dynamic simulations of helicopter main gear boxes. Ball bearing is considered non-lubricated in order to predict its behavior in case of lubrication system failure. Rolling contacts are treated with the method proposed by Kalker. This approach is based on polynomial approximation of relative displacement on the contact ellipse. For low computational cost and without any spatial discretization, it gives a good estimation of tangential traction and creep. Also, a regularization of the Kalker linear creep theory is proposed. It is used here to facilitate the global convergence of the Newton iterative process. It is well suited for multibody dynamic simulations which do not need a very fine treatment of rolling contact. A numerical example of a ball bearing under thrust load is presented. Cette étude présente un modèle dynamique de roulement à billes utilisant le formalisme de la dynamique multicorps. Ce dernier permet l’intégration immédiate du modèle dans les simulations dynamiques de boîtes de transmission de puissance d’hélicoptères. Le roulement est considéré non lubrifié afin de prédire son comportement en cas de défaillance du système de lubrification. Le modèle mis en place pour les contacts roulants pseudo-ponctuels, issu des travaux de J.J. Kalker, se fonde sur une approximation polynomiale du déplacement relatif sur l’ellipse de contact. Ce dernier fournit, pour un temps de calcul réduit et sans discrétisation spatiale, une bonne estimation des efforts et micro-glissements au contact. Aussi, une régularisation de la théorie linéaire de Kalker est proposée. Elle est utilisée pour faciliter la convergence globale de l’algorithme de Newton. Elle est également bien adaptée aux simulations dynamiques multicorps qui ne nécessitent pas une modélisation très fine du contact roulant. Un roulement à billes soumis à un effort axial est présenté comme exemple numérique.
8 February 2017 in Comptes Rendus Mathematique
Preconditioned Krylov subspace methods [7] are powerful tools for solving linear systems but sometimes they converge very slowly, and often after a long stagnation. A natural way to fix this is by enlarging the space in which the solution is computed at each iteration. Following this idea, we propose in this note two multipreconditioned algorithms: multipreconditioned orthomin and multipreconditioned biCG, which aim at solving general nonsingular linear systems in a small number of iterations. After describing the algorithms, we illustrate their behaviour on systems arising from the FETI domain decomposition method, where in order to enlarge the search space, each local component in the usual preconditioner is kept as a separate preconditioner.