arXiv Analytics

Sign in

arXiv:2401.07949 [math.AP]AbstractReferencesReviewsResources

Periodic homogenization of geometric equations without perturbed correctors

Jiwoong Jang

Published 2024-01-15Version 1

Proving homogenization has been a subtle issue for geometric equations due to the discontinuity when the gradient vanishes. A sufficient condition for periodic homogenization using perturbed correctors is suggested in the literature [3] to overcome this difficulty. However, some noncoercive equations do not satisfy this condition. In this note, we prove homogenization of geometric equations without using perturbed correctors, and therefore we conclude homogenization for the noncoercive equations. Also, we provide a rate of periodic homogenization of coercive geometric equations by utilizing the fact that they remain coercive under perturbation. We also present an example that homogenizes with a rate $\Omega(\varepsilon|\log \varepsilon|)$.

Related articles: Most relevant | Search more
arXiv:1710.11257 [math.AP] (Published 2017-10-30)
Lectures on Periodic Homogenization of Elliptic Systems
arXiv:1707.03160 [math.AP] (Published 2017-07-11)
Regularity of Homogenized Boundary Data in Periodic Homogenization of Elliptic Systems
arXiv:2303.17113 [math.AP] (Published 2023-03-30)
On optimal rate of convergence in periodic homogenization of forced mean curvature flow of graphs in the laminar setting