A fast algorithm for reiterated homogenization (Q2443510)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6280535
Language Label Description Also known as
default for all languages
No label defined
    English
    A fast algorithm for reiterated homogenization
    scientific article; zbMATH DE number 6280535

      Statements

      A fast algorithm for reiterated homogenization (English)
      0 references
      0 references
      0 references
      7 April 2014
      0 references
      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.
      0 references
      reiterated homogenization
      0 references
      upscaling
      0 references
      effective coefficients
      0 references
      homogenization map
      0 references
      fast algorithms
      0 references
      adaptive sampling
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references