• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.5 no.2
• /
• pp.25-37
• /
• 2001

We consider the finite element method applied to nonlinear Sobolev equation with smooth data and demonstrate for arbitrary order ($k{\geq}2$) finite element spaces the optimal rate of convergence in $L_{\infty}\;W^{1,{\infty}}({\Omega})$ and $L_{\infty}(L_{\infty}({\Omega}))$ (quasi-optimal for k = 1). In other words, the nonlinear Sobolev equation can be approximated equally well as its linear counterpart. Furthermore, we also obtain superconvergence results in $L_{\infty}(W^{1,{\infty}}({\Omega}))$ for the difference between the approximate solution and the generalized elliptic projection of the exact solution.

• International journal of advanced smart convergence
• /
• v.7 no.4
• /
• pp.92-100
• /
• 2018

This paper presents a link adaptation scheme for adaptive full duplex (AFD) systems. The signal modulation levels and communication link patterns are adaptively selected according to the changing channel conditions. The link pattern selection process consists of two successive steps such as a transmit-receive antenna pair selection based on maximum sum rate or minimum maximum symbol error rate, and an adaptive modulation based on maximum minimum norm. In AFD systems, the antennas of both nodes are jointly determined with modulation levels depending on the channel conditions. An adaptive algorithm with relatively low complexity is also proposed to select the link parameters. Simulation results show that the proposed AFD system offers significant bit error rate (BER) performance improvement compared with conventional full duplex systems with perfect or imperfect self-interference cancellation under the same fixed sum rate.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.6
• /
• pp.55-61
• /
• 2014

This paper related with the ECMA (Enchanced CMA) algorithm performance which is possible to simultaneously compensation of the amplitude and phase by appling the minimum disturbance techniques in the CMA adatpve equalizer. The ECMA can improving the gradient noise amplification problem, stability and roburstness performance by the minimum disturbance technique that is the minimization of the equalizer tap weight variation in the point of squared euclidiean norm and the decision directed mode, and then the now cost function were proposed in order to simultaneouly compensation of amplitude and phase of the received signal with the minimum increment of computational operations. The performance of ECMA algorithm was compared to present MCMA by the computer simulation. For proving the performance, the recovered signal constellation that is the output of equalizer output signal and the residual isi and Maximum Distortion charateristic and MSE learning curve that are presents the convergence performance in the equalizer and the overall frequency transfer function of channel and equalizer were used. As a result of computer simulation, the ECMA has more better compensation capability of amplitude and phase in the recovered constellation, and the convergence time of adaptive equalization has improved compared to the MCMA.

• Journal of the Korean Society for Precision Engineering
• /
• v.25 no.2
• /
• pp.72-79
• /
• 2008

In the redundant actuation system which has more actuators than a system's mobility, there are various method to determine actuated torques because those are not determined uniquely. This paper presents a torque distribution method using weighted-pseudoinverse to optimize the maximum torque of various actuated inputs of the redundant system. The various weighting factor of weighted-pseudoinverse is studied to reduce maximum actuated torque. This method is experimentally applied to 3RRR parallel robot, which shows that presented method can efficiently reduce the maximum actuated torque.

• Korean Journal of Mathematics
• /
• v.5 no.2
• /
• pp.151-167
• /
• 1997

We estimate the interior Lipschitz norm and maximum of the solution for degenerate parabolic equations with absorption. Also obtain the growth rate of the solution $u$ in terms of time $t$. From this we show the uniqueness of solution with respect to the initial trace.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.22 no.3
• /
• pp.201-215
• /
• 2018

In this paper we consider a class of singularly perturbed system of delay differential equations of convection diffusion type with integral boundary conditions. A finite difference scheme on an appropriate piecewise Shishkin type mesh is suggested to solve the problem. We prove that the method is of almost first order convergent. An error estimate is derived in the discrete maximum norm. Numerical experiments support our theoretical results.

• Communications of the Korean Mathematical Society
• /
• v.34 no.3
• /
• pp.1015-1027
• /
• 2019

A class of systems of singularly perturbed convection diffusion type equations with integral boundary conditions is considered. A numerical method based on a finite difference scheme on a Shishkin mesh is presented. The suggested method is of almost first order convergence. An error estimate is derived in the discrete maximum norm. Numerical examples are presented to validate the theoretical estimates.

• Communications of the Korean Mathematical Society
• /
• v.38 no.1
• /
• pp.281-298
• /
• 2023

A class of systems of Caputo fractional differential equations with integral boundary conditions is considered. A numerical method based on a finite difference scheme on a uniform mesh is proposed. Supremum norm is used to derive an error estimate which is of order κ − 1, 1 < κ < 2. Numerical examples are given which validate our theoretical results.

• Journal of the Korea Furniture Society
• /
• v.21 no.3
• /
• pp.261-272
• /
• 2010

The aim of the present study was to investigate the relations between wooden toy and development of infant and young children by taking only the commercialized wooden furniture which would be suitable for the developmental area for infant and young children, among the physical environment influencing the balanced development and development for them. The recommended standard for them was the commercialized good and the only advanced toys for the development of infant and young children was primary selected, in case of different furniture for same purpose with regardless of manufacturer, country of origin and price. The selected wooden toys for development of infant and young children covered the following test conditions. They keep the soft and clean surfaces and the corners are the round-finished so safe. The dyeing and coloring are so clear like the rainbow-colored in compliance with the international safety norm, and the paint material used are harmless to the people, because they have already passed the European Safety Norm EN 71 which is the most authoritative and strict standard in the world and contained accordingly little heavy metals, toxic substances and also allergy pigment under the maximum permissible standard. The size of wooden toys are not small enough for infant and young children to be able to swallow and this is important check point, because infants tend to feel the object in their own touching and therefore to have everything to the lip. The paint used was the toys-oriented goods and proved by the test regarding saliva and sweat.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.20 no.2
• /
• pp.107-121
• /
• 2016

We analyze the complexity of the LLL algorithm, invented by Lenstra, Lenstra, and $Lov{\acute{a}}sz$ as a a well-known lattice reduction (LR) algorithm which is previously known as having the complexity of $O(N^4{\log}B)$ multiplications (or, $O(N^5({\log}B)^2)$ bit operations) for a lattice basis matrix $H({\in}{\mathbb{R}}^{M{\times}N})$ where B is the maximum value among the squared norm of columns of H. This implies that the complexity of the lattice reduction algorithm depends only on the matrix size and the lattice basis norm. However, the matrix structures (i.e., the correlation among the columns) of a given lattice matrix, which is usually measured by its condition number or determinant, can affect the computational complexity of the LR algorithm. In this paper, to see how the matrix structures can affect the LLL algorithm's complexity, we derive a more tight upper bound on the complexity of LLL algorithm in terms of the condition number and determinant of a given lattice matrix. We also analyze the complexities of the LLL updating/downdating schemes using the proposed upper bound.