.png){kind=icon}
.png){kind=icon}
Return
Multiscale methods for problems with complex geometry
.png){kind=icon}
OA
AI
DOI：10.1016/j.cma.2017.03.023.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a multiscale method for elliptic problems on complex domains, e.g. domains with cracks or complicated boundary. For local singularities this paper also offers a discrete alternative to enrichment techniques such as XFEM. We construct corrected coarse test and trail spaces which takes the fine scale features of the computational domain into account. The corrections only need to be computed in regions surrounding fine scale geometric features. We achieve linear convergence rate in the energy norm for the multiscale solution. Moreover, the conditioning of the resulting matrices is not affected by the way the domain boundary cuts the coarse elements in the background mesh. The analytical findings are verified in a series of numerical experiments. (C) 2017 Elsevier B.V. All rights reserved.
Keywords:
multiscale method
complex geometry
a priori error bound
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.3W
Citations:
5.6W