HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

A Semi-Explicit Algorithm for the Reconstruction of 3D Planar Cracks

Abstract : This paper deals with a semi-explicit algorithm to reconstruct 2D segment cracks, or 3D planar cracks, in the framework of overspecified boundary data. The algorithm is based on the reciprocity gap concept, introduced by S. Andrieux and A. Ben Abda, which provides explicitely the line (or the plane) support of the cracks. A numerical reconstruction of the cracks, which are actually the support of the solution jump across this plane, is then performed by computing the Fourier expansion of the solution jump itself. After the numerical analysis of the method, some numerical results are presented and commented.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 1:22:39 PM
Last modification on : Thursday, February 3, 2022 - 11:15:55 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:52:33 PM


  • HAL Id : inria-00073629, version 1



Tarek Bannour, Amel Ben Abda, Mohamed Jaoua. A Semi-Explicit Algorithm for the Reconstruction of 3D Planar Cracks. [Research Report] RR-3063, INRIA. 1996. ⟨inria-00073629⟩



Record views


Files downloads