• Title/Summary/Keyword: Jacobi scheme

Search Result 26, Processing Time 0.026 seconds

ON A MOVING GRID NUMBERICAL SCHEME FOR HAMILTON-JACOBI EQUATIONS

  • Hong, Bum-Il
    • Journal of the Korean Mathematical Society
    • /
    • v.33 no.2
    • /
    • pp.249-258
    • /
    • 1996
  • Analysis by the method of characteristics shows that if f and $u_0$ are smooth and $u_0$ has compact support, then the Hamilton-Jacobi equation $$ (H-J) ^{u_t + f(u_x) = 0, x \in R, t > 0, } _{u(x, 0) = u_0(x), x \in R, } $$ has a unique $C^1$ solution u on some maximal time interval $0 \leq t < T$ for which $lim_{t \to T}u(x, t) exists uniformly; but this limiting function is not continuously differentiable.

  • PDF

Preconditioned Multistage time stepping for the Multigrid Navier-Stokes Solver (다중 격자 Navier-Stokes 해석을 위한 예조건화된 다단계 시간 전진 기법)

  • Kim Yoonsik;Kwon Jang Hyuk;Choi Yun Ho;Lee Seungsoo
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2002.05a
    • /
    • pp.59-64
    • /
    • 2002
  • In this paper, the preconditioned multistage time stepping methods which are popular multigrid smoothers is implemented for the compressible Navier-Stokes calculation with full-coarsening multigrid method. The convergence characteristic of the point-Jacobi and Alternating direction line Jacobi(DDADI) preconditioners are studied. The performance of 2nd order upwind numerical fluxes such as 2nd order upwind TVD scheme and MUSCL-type linear reconstruction scheme are compared in the inviscid and viscous turbulent flow caculations.

  • PDF

Comparison of multigrid performance for higher order scheme with 5-point scheme

  • Han, Mun. S.;Kwak, Do Y.;Lee, Jun S.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.4 no.2
    • /
    • pp.135-142
    • /
    • 2000
  • We consider a multigrid algorithm for higher order finite difference scheme for the Poisson problem on rectangular domain. Several smoothers including Jacobi, Red-black Gauss-Seidel are tested and compared. Since higher order scheme gives much more accurate result then 5-point scheme, one may use small number of levels with higher order scheme and thus the overall cost is reduced quite a lot. The numerical experiment compares the two cases.

  • PDF

Convergence analysis of fixed-point iteration with Anderson Acceleration on a simplified neutronics/thermal-hydraulics system

  • Lee, Jaejin;Joo, Han Gyu
    • Nuclear Engineering and Technology
    • /
    • v.54 no.2
    • /
    • pp.532-545
    • /
    • 2022
  • In-depth convergence analyses for neutronics/thermal-hydraulics (T/H) coupled calculations are performed to investigate the performance of nonlinear methods based on the Fixed-Point Iteration (FPI). A simplified neutronics-T/H coupled system consisting of a single fuel pin is derived to provide a testbed. The xenon equilibrium model is considered to investigate its impact during the nonlinear iteration. A problem set is organized to have a thousand different fuel temperature coefficients (FTC) and moderator temperature coefficients (MTC). The problem set is solved by the Jacobi and Gauss-Seidel (G-S) type FPI. The relaxation scheme and the Anderson acceleration are applied to improve the convergence rate of FPI. The performances of solution schemes are evaluated by comparing the number of iterations and the error reduction behavior. From those numerical investigations, it is demonstrated that the number of FPIs is increased as the feedback is stronger regardless of its sign. In addition, the Jacobi type FPIs generally shows a slower convergence rate than the G-S type FPI. It also turns out that the xenon equilibrium model can cause numerical instability for certain conditions. Lastly, it is figured out that the Anderson acceleration can effectively improve the convergence behaviors of FPI, compared to the conventional relaxation scheme.

Topology optimization with functionally graded multi-material for elastic buckling criteria

  • Minh-Ngoc Nguyen;Dongkyu Lee;Joowon Kang;Soomi Shin
    • Steel and Composite Structures
    • /
    • v.46 no.1
    • /
    • pp.33-51
    • /
    • 2023
  • This research presents a multi-material topology optimization for functionally graded material (FGM) and nonFGM with elastic buckling criteria. The elastic buckling based multi-material topology optimization of functionally graded steels (FGSs) uses a Jacobi scheme and a Method of Moving Asymptotes (MMA) as an expansion to revise the design variables shown first. Moreover, mathematical expressions for modified interpolation materials in the buckling framework are also described in detail. A Solid Isotropic Material with Penalization (SIMP) as well as a modified penalizing material model is utilized. Based on this investigation on the buckling constraint with homogenization material properties, this method for determining optimal shape is presented under buckling constraint parameters with non-homogenization material properties. For optimal problems, minimizing structural compliance like as an objective function is related to a given material volume and a buckling load factor. In this study, conflicts between structural stiffness and stability which cause an unfavorable effect on the performance of existing optimization procedures are reduced. A few structural design features illustrate the effectiveness and adjustability of an approach and provide some ideas for further expansions.

Shape Optimization of Energy Flow Problems Using Level Set Method (레벨 셋 기법을 이용한 에너지 흐름 문제의 형상 최적화)

  • Seung-Hyun, Ha;Seonho, Cho
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2004.10a
    • /
    • pp.411-418
    • /
    • 2004
  • Using a level set method we develop a shape optimization method applied to energy flow problems in steady state. The boundaries are implicitly represented by the level set function obtainable from the 'Hamilton-Jacobi type' equation with the 'Up-wind scheme.' The developed method defines a Lagrangian function for the constrained optimization. It minimizes a generalized compliance, satisfying the constraint of allowable volume through the variations of implicit boundary. During the optimization, the boundary velocity to integrate the Hamilton-Jacobi equation is obtained from the optimality condition for the Lagrangian function. Compared with the established topology optimization method, the developed one has no numerical instability such as checkerboard problems and easy representation of topological shape variations.

  • PDF

Level Set based Optimization of Electromagnetic System using Multi-Material (Level Set Method를 이용한 전자기 시스템의 다물질 최적설계)

  • Lee, Jang-Won;Shim, Ho-Kyung;Lee, Heon;Wang, Se-Myung
    • Proceedings of the KIEE Conference
    • /
    • 2008.07a
    • /
    • pp.653-654
    • /
    • 2008
  • This paper presents a topological shape optimization for electromagnetic system using a level set method. The optimization is progressed by updating the implicit level set function from the Hamilton-Jacobi equation. The up-wind scheme is used for numerical implementation of the Hamilton-Jacobi equation. In order to validate the proposed optimization, the core part of a C-core actuator is optimized by three cases using different materials; (single steel), (two steels), and (steel and magnet).

  • PDF

Topological Shape Optimization of Multi-Domain for Electromagnetic Systems using Level Set Method (전자기 시스템의 다물질 형상 최적설계를 위한 Level Set 방법 적용)

  • Lee, Jang-Won;Shim, Ho-Kyung;Wang, Se-Myung
    • Proceedings of the KIEE Conference
    • /
    • 2008.10c
    • /
    • pp.23-25
    • /
    • 2008
  • This paper presents a topological shape optimization for electromagnetic system using a Level Set method. The optimization is progressed by updating the implicit Level Set function from the Hamilton-Jacobi equation. The up-wind scheme is used for numerical implementation of the Hamilton-Jacobi equation. In order to validate the proposed optimization, the core part of a C-core actuator is optimized by three cases using different materials; (single steel), (two steels), and (steel and magnet).

  • PDF

CONTINUOUS HAMILTONIAN DYNAMICS AND AREA-PRESERVING HOMEOMORPHISM GROUP OF D2

  • Oh, Yong-Geun
    • Journal of the Korean Mathematical Society
    • /
    • v.53 no.4
    • /
    • pp.795-834
    • /
    • 2016
  • The main purpose of this paper is to propose a scheme of a proof of the nonsimpleness of the group $Homeo^{\Omega}$ ($D^2$, ${\partial}D^2$) of area preserving homeomorphisms of the 2-disc $D^2$. We first establish the existence of Alexander isotopy in the category of Hamiltonian homeomorphisms. This reduces the question of extendability of the well-known Calabi homomorphism Cal : $Diff^{\Omega}$ ($D^1$, ${\partial}D^2$)${\rightarrow}{\mathbb{R}}$ to a homomorphism ${\bar{Cal}}$ : Hameo($D^2$, ${\partial}D^2$)${\rightarrow}{\mathbb{R}}$ to that of the vanishing of the basic phase function $f_{\underline{F}}$, a Floer theoretic graph selector constructed in [9], that is associated to the graph of the topological Hamiltonian loop and its normalized Hamiltonian ${\underline{F}}$ on $S^2$ that is obtained via the natural embedding $D^2{\hookrightarrow}S^2$. Here Hameo($D^2$, ${\partial}D^2$) is the group of Hamiltonian homeomorphisms introduced by $M{\ddot{u}}ller$ and the author [18]. We then provide an evidence of this vanishing conjecture by proving the conjecture for the special class of weakly graphical topological Hamiltonian loops on $D^2$ via a study of the associated Hamiton-Jacobi equation.

Finite Element Analysis of Shape Rolling Process using Destributive Parallel Algorithms on Cray T3E (병렬 컴퓨터를 이용한 형상 압연공정 유한요소 해석의 분산병렬처리에 관한 연구)

  • Gwon, Gi-Chan;Yun, Seong-Gi
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.5 s.176
    • /
    • pp.1215-1230
    • /
    • 2000
  • Parallel Approaches using Cray T3E which is NIPP (Massively Parallel Processors) machine are presented for the efficient computation of the finite element analysis of 3-D shape rolling processes. D omain decomposition method coupled with parallel linear equation solver is used. Domain decomposition is applied for obtaining element tangent stifffiess matrices and residual vectors. Direct and iterative parallel algorithms are used for solving the linear equations. Direct algorithm is_parallel version of direct banded matrix solver. For iterative algorithms, the well-known preconditioned conjugate gradient solver with Jacobi preconditioner is also employed. Moreover a new effective iterative scheme with block inverse matrix preconditioner, which is named by present authors, is presented and its results are compared with the one using Jacobi preconditioner. PVM and MPI are used for message passing and synchronization between processors. The performance and efficiency of each algorithm is discussed and comparisons are made among different algorithms.