TY - JOUR

T1 - Improving the rate of convergence of high-order finite elements on polyhedra II

T2 - Mesh refinements and interpolation

AU - Bacuta, Constantin

AU - Nistor, Victor

AU - Zikatanov, Ludmil T.

N1 - Funding Information:
Constantin Bacuta was supported by the University of Delaware Research Foundation and NSF Grant DMS-0713125. Victor Nistor was supported by NSF grant DMS 0555831. Ludmil T. Zikatanov was supported by a NSF grants DMS-058110, DMS-0619587, and by Lawrence Livermore National Laboratory under subcontract number B551021.

PY - 2007/7

Y1 - 2007/7

N2 - We construct a sequence of meshes T′k that provides quasi-optimal rates of convergence for the solution of the Poisson equation on a bounded polyhedral domain with right-hand side in Hm-1, m ≥ 2. More precisely, let Ω ⊂ ℝ3 be a bounded polyhedral domain and let u ∈ H1 (Ω) be the solution of the Poisson problem- Δu = f ∈ Hm-1(Ω), m ≥ 2, u = 0 on . Also, let Sk be the finite element space of continuous, piecewise polynomials of degree m ≥ 2 on T′k and let uk ∈ Sk be the finite element approximation of u, then ∥u - uk∥H1(Ω) ≤ C dim(Sk) -m/3∥f∥Hm-1(ω), with C independent of k and f. Our method relies on the a priori estimate ∥u∥D ≤ C∥f∥Hm-1(Ω) in certain anisotropic weighted Sobolev spaces [image omitted], with a > 0 small, determined only by Ω. The weight is the distance to the set of singular boundary points (i.e., edges). The main feature of our mesh refinement is that a segment AB in Tk' will be divided into two segments AC and CB in T′k+1 as follows: |AC| = |CB| if A and B are equally singular and |AC| = k|AB| if A is more singular than B. We can choose 2-m/a. This allows us to use a uniform refinement of the tetrahedra that are away from the edges to construct T′k.

AB - We construct a sequence of meshes T′k that provides quasi-optimal rates of convergence for the solution of the Poisson equation on a bounded polyhedral domain with right-hand side in Hm-1, m ≥ 2. More precisely, let Ω ⊂ ℝ3 be a bounded polyhedral domain and let u ∈ H1 (Ω) be the solution of the Poisson problem- Δu = f ∈ Hm-1(Ω), m ≥ 2, u = 0 on . Also, let Sk be the finite element space of continuous, piecewise polynomials of degree m ≥ 2 on T′k and let uk ∈ Sk be the finite element approximation of u, then ∥u - uk∥H1(Ω) ≤ C dim(Sk) -m/3∥f∥Hm-1(ω), with C independent of k and f. Our method relies on the a priori estimate ∥u∥D ≤ C∥f∥Hm-1(Ω) in certain anisotropic weighted Sobolev spaces [image omitted], with a > 0 small, determined only by Ω. The weight is the distance to the set of singular boundary points (i.e., edges). The main feature of our mesh refinement is that a segment AB in Tk' will be divided into two segments AC and CB in T′k+1 as follows: |AC| = |CB| if A and B are equally singular and |AC| = k|AB| if A is more singular than B. We can choose 2-m/a. This allows us to use a uniform refinement of the tetrahedra that are away from the edges to construct T′k.

UR - http://www.scopus.com/inward/record.url?scp=34547962871&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34547962871&partnerID=8YFLogxK

U2 - 10.1080/01630560701493263

DO - 10.1080/01630560701493263

M3 - Article

AN - SCOPUS:34547962871

SN - 0163-0563

VL - 28

SP - 775

EP - 824

JO - Numerical Functional Analysis and Optimization

JF - Numerical Functional Analysis and Optimization

IS - 7-8

ER -