Browse

Nonconforming Finite Element Methods for Stokes and Elliptic Problems
스토크스 문제와 타원형 편미분 방정식에 대한 비순응 유한요소법

Cited 0 time in Web of Science Cited 0 time in Scopus
Authors
심광신
Advisor
신동우
Major
자연과학대학 수리과학부
Issue Date
2014-02
Publisher
서울대학교 대학원
Keywords
nonconforming finite elementnonparametric finite elementthe incompressible Stokes equationsthe elliptic problemthe planar linear elasticity problem
Description
학위논문 (박사)-- 서울대학교 대학원 : 수리과학부, 2014. 2. 신동우.
Abstract
A new class of nonparametric nonconforming quadrilateral finite elements is introduced in Chapter 1, which has the midpoint continuity and the mean value continuity at the interfaces of elements simultaneously as the rectangular
DSSY element [8]. The parametric DSSY element for general quadrilaterals requires five degrees of freedom to have an optimal order of convergence[4], while the new nonparametric DSSY elements require only four degrees of
freedom. The design of new elements is based on the decomposition of a bilinear transform into a simple bilinear map followed by a suitable affine map. Numerical results are presented to compare the new elements with the parametric DSSY element.

In Chapter 2, as in two dimension, a class of onparametric DSSY element in three dimensional hexahedral mesh is designed. It satisfies the optimal convergence property in genuine hexahedral mesh (consisting of six flat faces)
with six local basis functions contrast to the parametric DSSY element. Also, the case of hexahedron mesh with non-flat faces is discussed. The numerical results for the genuine hexahedral mesh and the non-flat hexahedral mesh are presented.

A new nonparametric nonconforming quadrilateral finite element is introduced in Chapter 3. The finite element is based on the nonparametric DSSY element introduced in Chapter 1 and constructed to have the minimal value of H1-seminorm on each element as in [11]. From this, the finite element has the maximal inf-sup constant and performs better than the nonparametric DSSY element introduced in Chapter 1 in the aspect of computing time. Numerical results are presented to show the speedup of computation by comparing with [13].
Language
English
URI
https://hdl.handle.net/10371/121275
Files in This Item:
Appears in Collections:
College of Natural Sciences (자연과학대학)Dept. of Mathematical Sciences (수리과학부)Theses (Ph.D. / Sc.D._수리과학부)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse