A fast numerical homogenization algorithm for finite element analysis

From MaRDI portal





One classical way to solve problems governed by partial differential equations with coefficients that vary arbitrarily in space is to use homogenization techniques. This paper proposes a fast and flexible alternative which consists to homogenize the discrete problem instead of the original continuous problem. This method uses a recursive triangulation algorithm to produce a mesh which fits the homogenization needs; next, a standard finite element discretization on this mesh gives the global rigidity matrix. And then, the ``numerical homogenization is performed on this matrix by using Schur's complement techniques. It is worth to mention that this method can be well adapted to parallel computation. Some examples from shallow waters illustrate the efficiency of the method, step by step. This method works for two-dimensional problems discretized by using triangles. It should be possible to extend it to three-dimensional problems.











This page was built for publication: A fast numerical homogenization algorithm for finite element analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953253)