A fast algorithm for reiterated homogenization
This paper is concerned with the efficient evaluation of the homogenized coefficients of the reiterated homogenization problems of linear partial differential equation. The authors propose an efficient method for a wide subclass of reiterated homogenization problems, where the coefficients have the form of a certain composition of binary operators. This case is able to represent many practical and important reiterated homogenization structures due to the flexibility of the binary operators. The main idea of the proposed approach is to introduce a novel object called the homogenization map, approximate it through adaptive interpolation, and replace solutions of the cell problems with fast evaluations of the interpolant. The efficiency and accuracy of the proposed algorithm is demonstrated by numerical results for both two and three dimensional problems.
- Fast homogenization algorithm based on asymptotic theory and multiscale schemes
- Numerical Homogenization of Elliptic Multiscale Problems by Subspace Decomposition
- A fast numerical homogenization algorithm for finite element analysis
- Convergence rates for elliptic reiterated homogenization problems
- On reiterated homogenization identities
- Fast homogenization algorithm based on asymptotic theory and multiscale schemes
- Stochastic multiscale heat transfer analysis of heterogeneous materials with multiple random configurations
- A dilation-based seamless multiscale method for elliptic problems
- A fast algorithm for semi-analytically solving the homogenization boundary value problem for block locally-isotropic heterogeneous media
This page was built for publication: A fast algorithm for reiterated homogenization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2443510)
