• Communications of the Korean Mathematical Society
• /
• v.10 no.1
• /
• pp.39-48
• /
• 1995

The ADI method was introduced by Peaceman and Rachford [6] in 1955, to solve the discretized boundary value problems for elliptic and parabolic PDEs. The finite difference discretization of the model elliptic problem $$ (1) -\Delta u = f, \Omega = [0, 1] \times [0, 1] $$ $$ u = 0 on \delta \Omega $$ with 5-point centered finite difference discretization, with n +2 mesh-points in the x - direction and m + 2 points in the y direction, leads to the solution of a linear system of equations of the form $$ (2) Au = b $$ where A is a matrix of dimension $N = n \times m$. Without loss of generality and for the sake of simplicity, we will assume for the remainder of this paper that m = n, so that $N = n^2$.

• Journal of applied mathematics & informatics
• /
• v.4 no.1
• /
• pp.17-30
• /
• 1997

In this work we approximate the solution of initialboun-dary value problem using a Galerkin-finite element method for the spatial discretization and Implicit Runge-Kutta method for the spatial discretization and implicit Runge-Kutta methods for the time stepping. To deal with the nonlinear term f(x, t, u), we introduce the well-known extrapolation sheme which was used widely to prove the convergence in $L_2$-norm. We present computational results showing that the optimal order of convergence arising under $L_2$-norm will be preserved in $L_{\infty}$-norm.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.2E
• /
• pp.14-19
• /
• 2000

The forward propagated ultrasonic fields resulting from a circular plane or a concave transducer in layered fluid media as well as in homogeneous water are theoretically estimated by the angular spectrum method(ASMJ) combined with Rayleigh-Sommerfeld diffraction theory(RSDT), and measured by a precision 3-D scanning system with a needle-point hydrophone. To make the aliasing error negligible on the 2-D FFT in the theoretical estimation, the spatial discretization in the ASM are carefully considered for optimal selection of spatial sampling intervals and the size of discretization area. It is shown that the estimated fields agree reasonably with the measured ones.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.4 no.1
• /
• pp.32-40
• /
• 2004

An extension of the density-gradient model to include the non-local transport effect is presented. The governing equations can be derived from the first three moments of the Wigner distribution function with some approximations. A new nonlinear discretization scheme is applied to the model to reduce the discretization error. We also developed a new boundary condition for the $Si/SiO_2$ interface that includes the electron wavefunction penetration into the oxide to obtain more accurate C-V characteristics. We report the simulation results of a 25-nm metal-oxide-semiconductor field-effect transistor (MOSFET) device.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.89-91
• /
• 2007

In this paper, a new approach for a sampled-data representation of nonlinear system that has time-delayed multi-input is proposed. That is largely devoid of illconditioning and is suitable for any nonlinear problem. The new scheme is applied to nonlinear systems with two or three inputs; and then the delayed multi-input general equation is derived. The method is based on thematrix exponential theory. Itdoes not require excessive computational resources and lends itself to a short and robust piece of software that can be easily inserted into large simulation packages. A performance of the proposed method is evaluated using a nonlinear system with time-delay: maneuvering an automobile.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.05a
• /
• pp.217-220
• /
• 2003

본 논문에서는 특정 매개변수의 입력 없이 속성(attribute)에 따른 목적속성(class)값의 분포를 고려하여 연속형(conti-nuous) 값을 범주형(categorical)의 형태로 변환시키는 새로운 방법을 제안하였다. 각각의 속성에 대해 목적속성의 분포를 1차원 공간에 사상(mapping)하고, 각 목적속성의 밀도, 다른 목적속성과의 중복 정도 등의 기준에 따라 구간을 군집화 한다. 이렇게 생성된 군집들은 각각 목적속성을 예측할 수 있는 확률적 수치에 기반한 것으로, 각 속성이 제공하는 정보의 손실을 최소화하는 이산화 경계선을 갖고 있다. 제안된 데이터 이산화 방법의 향상된 성능은 C4.5 알고리즘과 UCI Machine Learning Data Repository 데이터를 사용하여 확인할 수 있다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.19 no.2
• /
• pp.123-135
• /
• 2015

In this paper, a reduced-order modeling(ROM) of Burgers equations is studied based on pseudo-spectral collocation method. A ROM basis is obtained by the proper orthogonal decomposition(POD). Crank-Nicolson scheme is applied in time discretization and the pseudo-spectral element collocation method is adopted to solve linearlized equation based on the Newton method in spatial discretization. We deliver POD-based algorithm and present some numerical experiments to show the efficiency of our proposed method.

• Journal of KSNVE
• /
• v.3 no.4
• /
• pp.353-359
• /
• 1993

In this study, the Taylor-Galerkin method is modified to take into consideration the third order term in the Taylor series of the fundamental variable. In the Taylor-Galerkin method, after expressing the governing equation of motion in conservation form, the temporal discretization is done first and then spatial discretization follows in contrast to the conventional approaches. A predictor-corrector type algorithm has been developed previously by the same author. A new computationally efficient direct algorithm is proposed in this study. A study on convergency and accuracy of the solution is carried out. Numerical examples show that this new algorithm exhibits the same order of accuracy with less computational effort.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.271-274
• /
• 2001

In this paper, optimal digital design is studied within the framework of sampled-data control theory. In particular, multirate discretization of analog controller is considered using an H$_2$optimality criterion. Solutions are obtained via multirate H$_2$optimization with a causality constraint due to the multirate structure. In design example, the comparison of the proposed methods is made with the conventional discretization methods, and demonstrate the superiority of the multirate design method.

• Structural Engineering and Mechanics
• /
• v.75 no.6
• /
• pp.685-699
• /
• 2020

Polygonal finite element provides a great flexibility in mesh generation of crack propagation problems where the topology of the domain changes significantly. However, the control of the discretization error in such problems is a main concern. In this paper, a polygonal-FEM is presented in modeling of crack propagation problems via an automatic adaptive mesh refinement procedure. The adaptive mesh refinement is accomplished based on the Zienkiewicz-Zhu error estimator in conjunction with a weighted SPR technique. Adaptive mesh refinement is employed in some steps for reduction of the discretization error and not for tracking the crack. In the steps that no adaptive mesh refinement is required, local modifications are applied on the mesh to prevent poor polygonal element shapes. Finally, several numerical examples are analyzed to demonstrate the efficiency, accuracy and robustness of the proposed computational algorithm in crack propagation problems.