A semi-explicit algorithm for the reconstruction of 3D planar cracks
- 1 August 1997
- journal article
- Published by IOP Publishing in Inverse Problems
- Vol. 13 (4) , 899-917
- https://doi.org/10.1088/0266-5611/13/4/002
Abstract
This paper deals with a semi-explicit algorithm to reconstruct two-dimensional (2D) segment cracks, or three-dimensional (3D) planar cracks, in the framework of overspecified boundary data. The algorithm is based on the reciprocity gap concept, introduced by Andrieux and Ben Abda, which provides explicitly 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 on.Keywords
This publication has 9 references indexed in Scilit:
- Identification of planar cracks by complete overdetermined data: inversion formulaeInverse Problems, 1996
- Identification of cracks in three-dimensional bodies by many boundary measurementsInverse Problems, 1996
- Unique Determination of Multiple Cracks by Two MeasurementsSIAM Journal on Control and Optimization, 1996
- Determining Linear Cracks by Boundary Measurements: Lipschitz StabilitySIAM Journal on Mathematical Analysis, 1996
- On finding a surface crack from boundary measurementsInverse Problems, 1995
- A computational algorithm to determine crack locations from electrostatic boundary measurements. The case of multiple cracksInternational Journal of Engineering Science, 1994
- A Uniqueness Result Concerning the Identification of a Collection of Cracks from Finitely Many Electrostatic Boundary MeasurementsSIAM Journal on Mathematical Analysis, 1992
- A computational algorithm to determine cracks from electrostatic boundary measurementsInternational Journal of Engineering Science, 1991
- Stable determination of conductivity by boundary measurementsApplicable Analysis, 1988