Accéder directement au contenu Accéder directement à la navigation
Article dans une revue

Study of Algorithms for Fast Computation of Crack Expansion Problem

Abstract : A problem of quasi-static growth of an arbitrary shaped-crack along an interface requires many times of iterations not only for finding a spatial distribution of discontinuity but also for determining the crack tip. This is crucial when refining model resolution and also when the phenomena progresses quickly from one step to another. We propose a mathematical reformu-lation of the problem as a nonlinear equation and adopt different numerical methods to solve it efficiently. Compared to a previous work of the authors, the resulting code shows a great improvement of performance. This gain is important for further application of aseismic slip process along the fault interface, in the context of plate convergence as well as the reactivation of fault systems in reservoirs.
Liste complète des métadonnées
Contributeur : Frédérique COUFFIGNAL Connectez-vous pour contacter le contributeur
Soumis le : mercredi 22 juin 2022 - 18:14:20
Dernière modification le : mercredi 3 août 2022 - 04:06:16


Fichiers éditeurs autorisés sur une archive ouverte




Farid Smaï, Hideo Aochi. Study of Algorithms for Fast Computation of Crack Expansion Problem. Procedia Computer Science, Elsevier, 2017, 108, pp.745-754. ⟨10.1016/j.procs.2017.05.273⟩. ⟨hal-01500880v2⟩



Consultations de la notice


Téléchargements de fichiers