A Semi-Explicit Algorithm for the Reconstruction of 3D Planar Cracks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1996

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.
Fichier principal
Vignette du fichier
RR-3063.pdf (1.23 Mo) Télécharger le fichier

Dates and versions

inria-00073629 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073629 , version 1

Cite

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⟩
291 View
292 Download

Share

Gmail Facebook X LinkedIn More