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.
Type de document :
Communication dans un congrès
INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, Jun 2017, Zurich, Switzerland. 〈http://www.iccs-meeting.org/〉
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

https://hal-brgm.archives-ouvertes.fr/hal-01500880
Contributeur : Hideo Aochi <>
Soumis le : lundi 3 avril 2017 - 17:13:06
Dernière modification le : jeudi 6 juillet 2017 - 01:03:54

Fichier

SmaiAochi2017.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01500880, version 1

Collections

Citation

Farid Smaï, Hideo Aochi. Study of Algorithms for Fast Computation of Crack Expansion Problem. INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, Jun 2017, Zurich, Switzerland. 〈http://www.iccs-meeting.org/〉. 〈hal-01500880〉

Partager

Métriques

Consultations de la notice

48

Téléchargements de fichiers

66