Study of Algorithms for Fast Computation of Crack Expansion Problem - BRGM - Bureau de recherches géologiques et minières Access content directly
Journal Articles Procedia Computer Science Year : 2017

Study of Algorithms for Fast Computation of Crack Expansion Problem

Farid Smaï
Hideo Aochi

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.
Fichier principal
Vignette du fichier
SmaiAochi2017.pdf (530.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01500880 , version 1 (03-04-2017)
hal-01500880 , version 2 (22-06-2022)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More