2020
DOI: 10.4208/csiam-am.2020-0035
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Online-Offline Method for Elliptic Homogenization Problems

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 52 publications
0
3
0
Order By: Relevance
“…If we use some other numerical upscaling methods, e.g., [18,32,19,29], then b ε h ∈ M(λ , Λ ; D) with certain constants λ and Λ , which depend on λ and Λ, but not exactly the same. To quantity the approximation error for the effective matrix, we define e(HMM): = max x∈ K2 (A − A h )(x) F , where…”
Section: The Nitsche Hybrid Methodmentioning
confidence: 99%
See 1 more Smart Citation
“…If we use some other numerical upscaling methods, e.g., [18,32,19,29], then b ε h ∈ M(λ , Λ ; D) with certain constants λ and Λ , which depend on λ and Λ, but not exactly the same. To quantity the approximation error for the effective matrix, we define e(HMM): = max x∈ K2 (A − A h )(x) F , where…”
Section: The Nitsche Hybrid Methodmentioning
confidence: 99%
“…, where à is the effective matrix associated with ãε . Since there is no analytical formula for Ã, we use the least-squares based method in [32,29] to obtain a higher-order approximation to A so that e(HMM) is negligible, which is denoted by Ãh . The homogenized solution u 0 is computed by solving Problem (1.3) with…”
Section: 3mentioning
confidence: 99%
“…We let ε = 0.0063 for the sake of comparison with those in [2] and compute u ε over a uniform mesh with mesh size 3.33e − 4. By Corollary 2.2 and the identity (2.6), the effective matrix A = χ K0 a + (1 − χ K0 ) A and the approximating effective matrix A h = χ K0 a+(1−χ K0 ) A h , where A h is an approximation of the effective matrix associated with a ε through a fast solver based on the discrete least-squares reconstruction in the framework of HMM (see [28] and [25] for details of such fast algorithm). We reconstruct A h to high accuracy so that the reconstruction error is negligible.…”
Section: Numerical Examplesmentioning
confidence: 99%