Divergence Structure Homogenization
- Check the recent reference:
Discrete Geometric Structures in Homogenization and Inverse Homogenization Mathieu Desbrun, Roger D. Donaldson, Houman Owhadi http://arxiv.org/abs/0904.2601
- Notes on computing homogenized coeffs in the divergence structure case
Here there are two points of view which can be taken advantage of:
- the variational point of view: minimizing a quadratic functional of the gradient
- the PDE point of view: have a cell problem to solve, but it's for a vector function.
Contents |
Homogenization theory for divergence form operators.
Gamma convergence theory and the homogenization theorem
Recall that, the time-dependent divergence structure PDE
is the gradient descent Euler-Lagrange equation for the corresponding variational problem
Now suppose A(x) = Aε(x), an ε periodic function in Rn. To analyze how the divergence form
converges in the limit
, it is advantageous to approach it in the variation form and apply the theory of Γ convergence. The theory of Gamma convergence give necessary conditions for the convergence of minimizers of an integral functional.
The main tool at hand is the Homogenization Theorem. It states that that, given f(x,p), 1-periodic in x and has the growth condition,
for some
, then on a bounded open set Ω the functional
| ∫ | f(x / ε,Du)dx |
| Ω |
converges in the sense of Γ-convergence to the functional
| ∫ | fhom(Du)dx |
| Ω |
where fhom(p) is given by the asymptotic homogenization formula:
It turns out, for convex f(x,p), the asymptotic homogenization formula simplifies to a cell problem; that is, a minimization over a single cell (0,1)n:
The divergence structure case
Now we return to our original problem. For the divergence form, assume first that,
for some 0 < α' < β' and that A is symmetric. Then, we have,
f(x,p) = pTA(x)p
which satisfies the growth condition with q = 1. Then it is known that the homogenized integral is of the form fhom(p) = pTA0p for some constant symmetric matrix A0. Indeed, if we can compute A0, then the "homogenized" divergence form is
.
To compute A0, consider the case n = 2, where (with abuse of notation) x = (x,y). Then the cell problem formula implies,
Also, if P1,P2 are the minimizers to the two cell problems above, respectively, the off diagonal elements can also be computed:
Computeing the minimizers P1,P2
Thus the difficulty, from a numerical standpoint, is to compute the minimizers P1,P2. The Euler-Lagrange equation for the minimization is,
for k = 0,1 and Ak is the k-th column of A. Of course, the solution to the Euler-Lagrange equation unique only up to a additive constant, so we must add another condition. For the finite difference method, a convenient way to impose uniqueness is by setting a point boundary condition Pk(0,0) = 0.
Numerical approach
The finite difference approach to solving the Euler-Lagrange equation for Pk with the point boundary condition at the origin amounts to solving a
linear system, similar to the 9-point Laplacian. The integral to evaluate (A0)i,j was computed by the midpoint rule.
Software tools
- Finite differences in MATLAB
- FreeFEM http://www.freefem.org/
Examples
We first tested a case where the exact solution is known. Computations were done on a 80 by 80 grid. Let:
A(x) = (sin(2πx) + 2)(cos(2πx + 2)) * I
where I is the identity matrix. The exact solution is:
(A0)1,1 = 3.464101616
(A0)1,2 = 0
(A0)2,1 = 0
(A0)2,2 = 3.464101616
The computed solution was:
(A0)1,1 = 3.464103141
(A0)1,2 = − 5.685650478e − 16
(A0)2,1 = 8.260059303e − 16
(A0)2,2 = 3.464103141
The auxiliary functions P1,P2 are plotted below.
References
1. A. Braides and A. Defranceschi, Homogenization of Multiple Integrals, Oxford, 1998. (Chapter 14, especially section 14.5)
2. G. Dal Maso, An Introduction to \Gamma-convergence, Birkhauser, 1993. (Chapter 24)
the majority of this page is contributed by Ryo Takei

