Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-26T01:32:49.456Z Has data issue: false hasContentIssue false

Attainability by simply connected domains of optimal bounds for the polarization tensor

Published online by Cambridge University Press:  26 April 2006

HABIB AMMARI
Affiliation:
Centre de Mathématiques Appliquées, CNRS UMR 7641 and Ecole Polytechnique, 91128 Palaiseau Cedex, France email: [email protected], [email protected], [email protected]
YVES CAPDEBOSCQ
Affiliation:
Laboratoire de Mathématiques, Université de Versailles Saint-Quentin-en-Yvelines, 78035 Versailles Cedex, France email: [email protected]
HYEONBAE KANG
Affiliation:
Department of Mathematical Sciences and RIM, Seoul National University, Seoul 151-747, Korea email: [email protected]
EUNJOO KIM
Affiliation:
Centre de Mathématiques Appliquées, CNRS UMR 7641 and Ecole Polytechnique, 91128 Palaiseau Cedex, France email: [email protected], [email protected], [email protected]
MIKYOUNG LIM
Affiliation:
Centre de Mathématiques Appliquées, CNRS UMR 7641 and Ecole Polytechnique, 91128 Palaiseau Cedex, France email: [email protected], [email protected], [email protected]

Abstract

The notion of polarization tensor is employed for the derivation of the leading-order boundary perturbations in the steady-state voltage potentials that are due to the presence of conductivity inclusions of small diameter. Recently, Capdeboscq and Vogelius obtained optimal bounds of Hashin-Shtrikman type for the trace of the polarization tensor, showing that every pair satisfying these optimal bounds arises as the eigenvalues of a polarization tensor associated with a coated ellipse. In this paper, we give numerical evidence of the fact that the set of possible polarization tensor eigenvalue pairs can also be obtained using simply connected domains. Our numerical computations are based on a boundary integral method.

Type
Papers
Copyright
2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)