• Title/Summary/Keyword: Navier-Stokes-P1

Search Result 37, Processing Time 0.024 seconds

Study on Preconditioning of the clavier-Stokes Equations Using 3-Dimensional Unstructured Meshes (3차원 비정렬격자계를 이용한 Navier-Stokes해의 Preconditioning에 관한 연구)

  • Nam, Young-Sok;Choi, Hyoung-Gwon;Yoo, Jung-Yul
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.25 no.11
    • /
    • pp.1581-1593
    • /
    • 2001
  • An efficient variable-reordering method for finite element meshes is used and the effect of variable-reordering is investigated. For the element renumbering of unstructured meshes, Cuthill-McKee ordering is adopted. The newsy reordered global matrix has a much narrower bandwidth than the original one, making the ILU preconditioner perform bolter. The effect of variable reordering on the convergence behaviour of saddle point type matrix it studied, which results from P2/P1 element discretization of the Navier-Stokes equations. We also propose and test 'level(0) preconditioner'and 'level(2) ILU preconditioner', which are another versions of the existing 'level(1) ILU preconditioner', for the global matrix generated by P2/P1 finite element method of incompressible Navier-Stokes equations. We show that 'level(2) ILU preconditioner'performs much better than the others only with a little extra computations.

Parallel Preconditioner for the Domain Decomposition Method of the Discretized Navier-Stokes Equation (이산화된 Navier-Stokes 방정식의 영역분할법을 위한 병렬 예조건화)

  • Choi, Hyoung-Gwon;Yoo, Jung-Yul;Kang, Sung-Woo
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.27 no.6
    • /
    • pp.753-765
    • /
    • 2003
  • A finite element code for the numerical solution of the Navier-Stokes equation is parallelized by vertex-oriented domain decomposition. To accelerate the convergence of iterative solvers like conjugate gradient method, parallel block ILU, iterative block ILU, and distributed ILU methods are tested as parallel preconditioners. The effectiveness of the algorithms has been investigated when P1P1 finite element discretization is used for the parallel solution of the Navier-Stokes equation. Two-dimensional and three-dimensional Laplace equations are calculated to estimate the speedup of the preconditioners. Calculation domain is partitioned by one- and multi-dimensional partitioning methods in structured grid and by METIS library in unstructured grid. For the domain-decomposed parallel computation of the Navier-Stokes equation, we have solved three-dimensional lid-driven cavity and natural convection problems in a cube as benchmark problems using a parallelized fractional 4-step finite element method. The speedup for each parallel preconditioning method is to be compared using upto 64 processors.

LOCAL REGULARITY CRITERIA OF THE NAVIER-STOKES EQUATIONS WITH SLIP BOUNDARY CONDITIONS

  • Bae, Hyeong-Ohk;Kang, Kyungkeun;Kim, Myeonghyeon
    • Journal of the Korean Mathematical Society
    • /
    • v.53 no.3
    • /
    • pp.597-621
    • /
    • 2016
  • We present regularity conditions for suitable weak solutions of the Navier-Stokes equations with slip boundary data near the curved boundary. To be more precise, we prove that suitable weak solutions become regular in a neighborhood boundary points, provided the scaled mixed norm $L^{p,q}_{x,t}$ with 3/p + 2/q = 2, $1{\leq}q$ < ${\infty}$ is sufficiently small in the neighborhood.

FINITE ELEMENT ANALYSIS FOR A MIXED LAGRANGIAN FORMULATION OF INCOMPRESSIBLE NAVIER-STOKES EQUATIONS

  • Kim, Hong-Chul
    • Journal of the Korean Mathematical Society
    • /
    • v.34 no.1
    • /
    • pp.87-118
    • /
    • 1997
  • This paper is concerned with a mixed Lagrangian formulation of the wiscous, stationary, incompressible Navier-Stokes equations $$ (1.1) -\nu\Delta u + (u \cdot \nabla)u + \nabla_p = f in \Omega $$ and $$ (1.2) \nubla \cdot u = 0 in \Omega $$ along with inhomogeneous Dirichlet boundary conditions on a portion of the boundary $$ (1.3) u = ^{0 on \Gamma_0 _{g on \Gamma_g, $$ where $\Omega$ is a bounded open domain in $R^d, d = 2 or 3$, or with a boundary $\Gamma = \partial\Omega$, which is composed of two disjoint parts $\Gamma_0$ and $\Gamma_g$.

  • PDF

Rate of Convergence in Inviscid Limit for 2D Navier-Stokes Equations with Navier Fricition Condition for Nonsmooth Initial Data

  • Kim, Namkwon
    • Journal of Integrative Natural Science
    • /
    • v.6 no.1
    • /
    • pp.53-56
    • /
    • 2013
  • We are interested in the rate of convergence of solutions of 2D Navier-Stokes equations in a smooth bounded domain as the viscosity tends to zero under Navier friction condition. If the initial velocity is smooth enough($u{\in}W^{2,p}$, p>2), it is known that the rate of convergence is linearly propotional to the viscosity. Here, we consider the rate of convergence for nonsmooth velocity fields when the gradient of the corresponding solution of the Euler equations belongs to certain Orlicz spaces. As a corollary, if the initial vorticity is bounded and small enough, we obtain a sublinear rate of convergence.

STUDY ON THE SPLITTING ALGORITHMSOF THE INCOMPRESSIBLE NAVIER-STOKES EQUATIONS USING P1P1/P2P1 FINITE ELEMENT FORMULATION (P2P1/P1P1 유한요소 공식을 이용한 비압축성 Navier-Stokes 방정식의 분리 해법에 대한 연구)

  • Cho Myung H.;Choi Hyoung G.;Yoo Jung Y.;Park Jae I.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2005.10a
    • /
    • pp.117-124
    • /
    • 2005
  • Splitting algorithms of the incompressible Navier-Stokes equations using P1P1/P2P1 finite element formulation are newly proposed. P1P1 formulation allocates velocity and pressure at the same nodes, while P2P1 formulation allocates pressure only at the vertex nodes and velocity at both the vertex and mid nodes. For comparison of the elapsed time and accuracy of the two methods, they have been applied to the well-known benchmark problems. The three cases chosen are the two-dimensional steady and unsteady flows around a fixed cylinder, decaying vortex, and impinging slot jet. It is shown that the proposed P2P1 semi-splitting method performs better than the conventional P1P1 splitting method in terms of both accuracy and computation time.

  • PDF

CHARACTERISTICS OF MATRICES IN THE P2P1 FINITE ELEMENT METHODS FOR SOLVING THE INCOMPRESSIBLE NAVIER-STOKES EQUATION (P2P1 유한요소를 이용한 비압축성 Navier-Stokes 방정식 해법들의 행렬 특성)

  • Cho, Myung-H.;Choi, Hyoung-G.;Yoo, Jung-Y.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2009.04a
    • /
    • pp.245-251
    • /
    • 2009
  • Numerical algorithms for solving the incompressible Navier-Stokes equations using P2P1 finite element are compared regarding the eigenvalues of matrices. P2P1 element allocates pressure at vertex nodes and velocity at both vertex and mid nodes. Therefore, compared to the P1P1 element, the number of pressure variables in the P2P1 element decreases to 1/4 in the case of two-dimensional problems and to 1/8 in the three-dimensional problems. Fully-implicit-integrated, semi-implicit- integrated and semi-segregated finite element formulations using P2P1 element are compared in terms of elapsed time, accuracy and eigenvlue distribution (condition number). For the comparison,they have been applied to the well-known benchmark problems. That is, the two-dimensional unsteady flows around a fixed circular cylinder and decaying vortex flow are adopted to check spatial accuracy.

  • PDF

Topology Optimization of Incompressible Flow Using P1 Nonconforming Finite Elements (P1 비순응 요소를 이용한 비압축성 유동 문제의 위상최적화)

  • Jang, Gang-Won;Chang, Se-Myong
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.36 no.10
    • /
    • pp.1139-1146
    • /
    • 2012
  • An alternative approach for topology optimization of steady incompressible Navier-Stokes flow problems is presented by using P1 nonconforming finite elements. This study is the extended research of the earlier application of P1 nonconforming elements to topology optimization of Stokes problems. The advantages of the P1 nonconforming elements for topology optimization of incompressible materials based on locking-free property and linear shape functions are investigated if they are also valid in fluid equations with the inertia term. Compared with a mixed finite element formulation, the number of degrees of freedom of P1 nonconforming elements is reduced by using the discrete divergence-free property; the continuity equation of incompressible flow can be imposed by using the penalty method into the momentum equation. The effect of penalty parameters on the solution accuracy and proper bounds will be investigated. While nodes of most quadrilateral nonconforming elements are located at the midpoints of element edges and higher order shape functions are used, the present P1 nonconforming elements have P1, {1, x, y}, shape functions and vertex-wisely defined degrees of freedom. So its implentation is as simple as in the standard bilinear conforming elements. The effectiveness of the proposed formulation is verified by showing examples with various Reynolds numbers.

Study on the Segregation Algorithms of the Incompressible Navier-Stokes Equations Using P1P1/P2P1 Finite Element Formulation (P1P1/P2P1 유한요소 공식을 이용한 배압축성 Navier-Stokes 방정식의 분리 해법에 대한 연구)

  • Choi Hyoung-G.;Yoo Jung-Y.;Park Jae-I.;Cho Myung-H.
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.30 no.3 s.246
    • /
    • pp.262-269
    • /
    • 2006
  • Segregation algorithms of the incompressible Wavier-Stokes equations using P1P1/P2P1 finite element formulation are newly proposed. P1P1 formulation allocates velocity and pressure at the same nodes, while P2P1 formulation allocates pressure only at the vertex nodes and velocity at both the vertex and the midpoint nodes. For a comparison of both the elapsed time and the accuracy between the two methods, they have been applied to the well-known benchmark problems. The three cases chosen are the two-dimensional steady and unsteady flows around a fixed cylinder, decaying vortex, and impinging slot jet. It is shown that the proposed P2P1 semi-segregation algorithm performs better than the conventional P1P1 segregation algorithm in terms of both accuracy and computation time.