Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-ndw9j Total loading time: 0 Render date: 2024-11-14T17:27:36.398Z Has data issue: false hasContentIssue false

6 - Network method for nonlinear composites

Published online by Cambridge University Press:  05 February 2013

Leonid Berlyand
Affiliation:
Pennsylvania State University
Alexander G. Kolpakov
Affiliation:
Università degli Studi di Cassino e del Lazio Meridionale
Alexei Novikov
Affiliation:
Pennsylvania State University
Get access

Summary

In this chapter we explain how to construct a discrete network for nonlinear high-contrast densely-packed composites. We use this presentation to demonstrate the so-called perforated medium technique in the analysis of high-contrast composites. We also use this investigation to demonstrate how the discrete network approximation arises from the interplay between geometry and asymptotic analysis. More specifically, the key mathematical feature of partial differential equations that describe high-contrast densely-packed composites is that their solutions exhibit asymptotically singular behavior, when particles are close to touching (high concentration). The singularities of the solutions occur exactly in the necks between almost touching particles. The location of these singularities can be characterized naturally by the geometric patterns of the distribution of the particles in the materials. Thus a geometric construction of a network is completely natural. As it is illustrated in this book, a rigorous mathematical justification is based on geometric and asymptotic arguments. These two arguments are coupled together. As a result, most of the constructions of asymptotic discrete network approximations for high-contrast composites are complicated, thus they are not attractive for practitioners. It is possible, however, to separate the geometric and the asymptotic arguments. It makes the construction of the network more transparent, and allows us to strengthen some of the previous results. In particular, it turns out that the validity of discrete network approximations could be verified for a class of composites, which is larger than the one that satisfies the δ-N close-packing condition.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2012

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.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×