• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.14 no.1
• /
• pp.43-56
• /
• 2010

The representative numerical algorithms to solve the time dependent Navier-Stokes equations are projection type methods. Lots of projection schemes have been developed to find more accurate solutions. But most of projection methods [4, 11] suffer from inconsistency and requesting unknown datum. E and Liu in [5] constructed the gauge method which splits the velocity $u=a+{\nabla}{\phi}$ to make consistent and to replace requesting of the unknown values to known datum of non-physical variables a and ${\phi}$. The errors are evaluated in [9]. But gauge method is not still obvious to find out suitable combination of discrete finite element spaces and to compute boundary derivative of the gauge variable ${\phi}$. In this paper, we define 4 gauge algorithms via combining both 2 decomposition operators and 2 boundary conditions. And we derive variational derivative on boundary and analyze numerical results of 4 gauge algorithms in various discrete spaces combinations to search right discrete space relation.

• Korean Journal of Mathematics
• /
• v.21 no.2
• /
• pp.125-150
• /
• 2013

The stabilized Gauge-Uzawa method (SGUM), which is a second order projection type algorithm to solve the time-dependent Navier-Stokes equations, has been newly constructed in 2013 Pyo's paper. The accuracy of SGUM has been proved only for time discrete scheme in the same paper, but it is crucial to study for fully discrete scheme, because the numerical errors depend on discretizations for both space and time, and because discrete spaces between velocity and pressure can not be chosen arbitrary. In this paper, we find out properties of the fully discrete SGUM and estimate its errors and stability to solve the evolution Navier-Stokes equations. The main difficulty in this estimation arises from losing some cancellation laws due to failing divergence free condition of the discrete velocity function. This result will be extended to Boussinesq equations in the continuous research (part II) and is essential in the study of part II.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.7
• /
• pp.1001-1007
• /
• 2014

This paper proposes a method to reduce operation time using discrete cosine transform and to improve image quality by the DC gain correction. Conventional filtered back projection (FBP) filtering in the frequency domain using Fourier transform, but the filtering process uses complex number operations. To simplify the filtering process, we propose a filtering process using discrete cosine transform. In addition, the image quality of reconstructed images are improved by correcting DC gain of sinograms. To correct the DC gain, we propose to find an optimum DC weight is defined as the ratio of sinogram DC and optimum DC. Experimental results show that the proposed method gets better performance than the conventional method for phantom and clinical CT images.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.4
• /
• pp.627-644
• /
• 2009

The gauge-Uzawa method which has been constructed in [11] is a projection type method to solve the evolution Navier-Stokes equations. The method overcomes many shortcomings of projection methods and displays superior numerical performance [11, 12, 15, 16]. However, we have obtained only suboptimal accuracy via the energy estimate in [11]. In this paper, we study semi-discrete gauge-Uzawa method to prove optimal accuracy via energy estimate. The main key in this proof is to construct the intermediate equation which is formed to gauge-Uzawa algorithm. We will estimate velocity errors via comparing with the intermediate equation and then evaluate pressure errors via subtracting gauge-Uzawa algorithm from Navier-Stokes equations.

• Journal of the Korean Mathematical Society
• /
• v.34 no.3
• /
• pp.515-531
• /
• 1997

In this paper, finite difference method is applied to approximate the generalized solutions of Sobolev equations. Using the Steklov mollifier and Bramble-Hilbert Lemma, a priori error estimates in discrete $L^2$ as well as in discrete $H^1$ norms are derived frist for the semidiscrete methods. For the fully discrete schemes, both backward Euler and Crank-Nicolson methods are discussed and related error analyses are also presented.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1271-1274
• /
• 1997

The industrial automation market encompasses all aspects of the discrete process in the manufactring industries. Nowadays many manufacturers are increasingly moving to increase plant capacity, and are trying to produce better quality at the lower costs. We have studied a modern projection-automation system to achieve the communication network which makes connection among all of the projection machines and connect them to a central computer. This communication system have to be very flexible and fast. Also we have studied the communication interface for the automatic production system including the hardware elements and the communication software.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.35 no.8
• /
• pp.333-340
• /
• 1986

This paper presents an approach for determining the discrete reduced-order models for largescale system by using matrix sign function. We define projection operators based on the matrix sign function and develop the algorithm for model-reduction by using them. Simulation studies show that the proposed altgorithm is very useful.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.5
• /
• pp.897-915
• /
• 2011

In this paper, we develop a symmetric Galerkin method with interior penalty terms to construct fully discrete approximations of the solution for nonlinear Sobolev equations. To analyze the convergence of discontinuous Galerkin approximations, we introduce an appropriate projection and derive the optimal $L^2$ error estimates.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.953-966
• /
• 2010

In this paper, we develop discontinuous Galerkin methods with penalty terms, namaly symmetric interior penalty Galerkin methods to solve nonlinear parabolic equations. By introducing an appropriate projection of u onto finite element spaces, we prove the optimal convergence of the fully discrete discontinuous Galerkin approximations in ${\ell}^2(L^2)$ normed space.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.15 no.3
• /
• pp.233-251
• /
• 2011

The Gauge-Uzawa method [GUM] in [9] which is a projection type algorithm to solve evolution Navier-Stokes equations has many advantages and superior performance. But this method has been studied for backward Euler time discrete scheme which is the first order technique, because the classical second order GUM requests rather strong stability condition. Recently, the second order time discrete GUM was modified to be unconditionally stable and estimated errors in [12]. In this paper, we contemplate several GUMs which can be derived by the same manner within [12], and we dig out properties of them for both stability and accuracy. In addition, we evaluate an stability condition for the classical GUM to construct an adaptive GUM for time to make free from strong stability condition of the classical GUM.