The network approximation theorem for an infinite number of bodies

• Published in: Introduction to the Network Approximation Method for Materials Modeling Vol. Series Number 148; pp. 116 - 154
• Main Authors: Berlyand, Leonid, Kolpakov, Alexander G., Novikov, Alexei
• Format: Book Chapter
• Language: English
• Published: United Kingdom Cambridge University Press 13.12.2012
• Subjects: Applied mathematics; Mathematical modelling; Mathematical physics
• ISBN: 110702823X; 9781107028234
• DOI: 10.1017/CBO9781139235952.006

In this chapter, we present a method that allows one to obtain an a priori error estimate for the discrete network approximation independent of the total number of filling particles. Such estimates are referred to as homogenization estimates. These estimates can be derived under the natural δ-N close-packing condition (Berlyand and Novikov, 2002), which, loosely speaking, allows for “holes” (regions containing no particles) to be present in the medium of order NR (see Figure 5.1). Here, R is the radius of the particles and N is the number of particles in the perimeter of the largest hole in the conducting cluster (see Figure 5.2). We demonstrate that the error of the network approximation is determined not by the total number of particles in the composite material but by the perimeter of these “holes”. The explicit dependence of the network approximation and its error on the irregular geometry of the particle array is explicitly evaluated.Formulation of the mathematical modelWe consider here the composite material described in Section 3.1.1. It is a two-dimensional rectangular specimen of a two-phase composite material that consists of a matrix filled by a large number of ideally conducting disks that do not intersect. In this chapter, we do not assume any restriction on the number of particles and prove the network approximation theorem independent of the total number of particles.