A fast numerical homogenization algorithm for finite element analysis (Q4953253)
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 1444214
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast numerical homogenization algorithm for finite element analysis |
scientific article; zbMATH DE number 1444214 |
Statements
9 May 2000
0 references
numerical homogenization
0 references
Cholesky factorization
0 references
elimination tree
0 references
matrix re-ordering
0 references
recursive triangulation algorithm
0 references
finite element
0 references
Schur's complement techniques
0 references
parallel computation
0 references
shallow waters
0 references
A fast numerical homogenization algorithm for finite element analysis (English)
0 references
0.7953250408172607
0 references
0.7831326127052307
0 references
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.
0 references