Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Hideo Aochi Connect in order to contact the contributor
Submitted on : Monday, April 3, 2017 - 5:13:06 PM
Last modification on : Wednesday, November 3, 2021 - 7:00:23 AM


Files produced by the author(s)


  • HAL Id : hal-01500880, version 1



Farid Smaï, Hideo Aochi. Study of Algorithms for Fast Computation of Crack Expansion Problem. INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, Jun 2017, Zurich, Switzerland. ⟨hal-01500880⟩



Les métriques sont temporairement indisponibles