• Journal of applied mathematics & informatics
• /
• 제18권1_2호
• /
• pp.553-562
• /
• 2005

It is well-known that the smoothness of 4-point interpolatory Deslauriers-Dubuc(DD) subdivision scheme is $C^{1}$. N. Dyn[3] proved that 4-point interpolatory subdivision scheme is $C^{1}$ by means of eigenanalysis. In this paper we take advantage of Laurent polynomial method to get the same result, and give new way of strict proof on Laurent polynomial method.

• 한국통신학회논문지
• /
• 제35권9C호
• /
• pp.743-747
• /
• 2010

본 논문은 빠른 연산(수렴)을 위한 적응 반복 하이브리드 영상 복원 알고리즘을 제안한다. 공간 영역의 국부제약 정보 설정을 위해 국부 영역의 분산, 평균, 국부 최대값을 이용하였다. 반복 기법을 이용하여 매 반복 해에서 얻어진 복원 영상으로부터 상기 제약 정보를 설정하고, 국부 완화도 결정을 위해 사용된다. 제안된 방식은 일반적인 RCLS(Regularized Constrained Least Squares) 방식에 비해 빠른 수렴속도와 더 좋은 성능을 얻을 수 있다.

• 전자공학회논문지S
• /
• 제34S권9호
• /
• pp.109-117
• /
• 1997

A new relaxation algorithm based on distribution of matched errors and possibility is proposed to solve efficiently correspondence problem. This algorithm can be applied to various method, such as BMA, feature-, and region-based matching methods, by modifying its smoothness function. It consists of two stages which are transformation and iteration process. In transformation stage, the errors obtained by any matching algorithm are transformed to possibility values according to these statistical distribution. Each grade of possility is updated by some constraints which are defined as smoothness, uniqueness, and discontinuity factor in iteration stage. The discontinuity factor is used to reserve discontinuity of disparity. In conventional methods, it is difficult to find proper weights and stop condition, because only two factors, smoothness and uniqueness, have been used. However, in the proposed mthod, the more smoothing is not ocurred because of discontinuity factor. And it is efective to the various image, even if the image has a severe noise and repeating patterns. In addition, it is shown that the convergence rate and the quality of output are improved.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제4권2호
• /
• pp.85-97
• /
• 2000

A quadrature rule for the solution of Cauchy singular integral equation is constructed and investigated. This method to calculate numerically singular integrals uses classical Jacobi quadratures adopting Hunter's method. The proposed method is convergent under a reasonable assumption on the smoothness of the solution.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 Proceedings of the Korea Automatic Control Conference, 11th (KACC); Pohang, Korea; 24-26 Oct. 1996
• /
• pp.16-19
• /
• 1996

In this paper, a sliding mode control scheme that guarantees the smoothness of the control signal and the exponential error convergence is proposed for robot manipulators. The proposed method inserts a low pass filter (LPF) in front of the plant, and the virtual controller is designed for the virtual plant - the combination of the LPF and the robot manipulator. The virtual control signal contains high frequency components because of a switching function. The real control signal, however, always shows a smooth curve since it is an output of the LPF. In addition to the smoothness of the control signal is always assured, the overall system is in the sliding mode at all times, that is, its performance is always invariant under the existence of parameter uncertainties and external disturbances. The closed-loop system is shown to be globally exponentially stable.

• 한국통신학회논문지
• /
• 제28권3C호
• /
• pp.232-238
• /
• 2003

본 논문에서는 공간 영역의 제약 정보를 이용한 적응 영상 복원 방식을 제안한다. 공간 영역의 제약정보로는 국부 정보의 평균, 분산 및 최대 값을 이용하였으며, 반복 기법을 이용하여 매 반복 해에서 얻어진 복원 영상으로부터 상기 제약 정보를 설정하게 되고, 위의 제약 정보는 임의의 입력 값에 의해 정의되는 매개 변수와 더불어 복원 영상의 국부 완화 정도를 결정하게 된다. 제안된 방식을 이용하여 복원영상을 얻기 위해 비 적응 복원 방식보다 빠른 수렴속도를 갖게 됨을 알 수 있으며, 국부적으로 제어된 완화 정도를 지닌 복윈 영상을 얻을 수 있었다. 제안된 방식의 성능은 실험을 통해서 확인할 수 있었다.

• Korean Journal of Mathematics
• /
• 제25권1호
• /
• pp.99-116
• /
• 2017

The aim of this article is to introduce a new form of Kantorovich $Sz{\acute{a}}sz$-type operators involving Charlier polynomials. In this manuscript, we discuss the rate of convergence, better error estimates. Further, we investigate order of approximation in the sense of local approximation results with the help of Ditzian-Totik modulus of smoothness, second order modulus of continuity, Peetre's K-functional and Lipschitz class.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제20권1호
• /
• pp.1-15
• /
• 2016

The continuous analysis, such as smoothness and uniform convergence, for polynomials and polynomial-like functions using differential operators have been studied considerably, parallel to the study of discrete analysis for these functions, using difference operators. In this work, for the difference operator ${\nabla}_h$ with size h > 0, we verify that for an integer $m{\geq}0$ and a strictly decreasing sequence $h_n$ converging to zero, a continuous function f(x) satisfying $${\nabla}_{h_n}^{m+1}f(kh_n)=0,\text{ for every }n{\geq}1\text{ and }k{\in}{\mathbb{Z}}$$, turns to be a polynomial of degree ${\leq}m$. The proof used the polynomial convergence, and additionally, we investigated several conditions on convergence to polynomials.

• Structural Engineering and Mechanics
• /
• 제73권1호
• /
• pp.1-16
• /
• 2020

Finite elements based on the partition of unity (PU) approximation have powerful capabilities for p-adaptivity and solutions with high smoothness without remeshing of the domain. Recently, the PU approximation was successfully applied to the three-node shell finite element, properly eliminating transverse shear locking and showing excellent convergence properties and solution accuracy. However, the enrichment with the PU approximation results in a significant increase in the number of degrees of freedom; therefore, it requires greater computational cost, thus making it less suitable for practical engineering. To circumvent this disadvantage, we propose a new strategy to decrease the total number of degrees of freedom in the existing PU-based shell element, without loss of optimal convergence and accuracy. To alleviate the locking phenomenon, we use the method of mixed interpolation of tensorial components and perform convergence studies to show the accuracy and capability of the proposed shell element. The excellent performances of the new shell elements are illustrated in three benchmark problems.

• Journal of the Korean Statistical Society
• /
• 제18권2호
• /
• pp.107-117
• /
• 1989

A stronger result than that of Park and Marron (1994) is proved here on the asymptotic distribution of the plug-in bandwidth selector. The new result is that the plug-in bandwidth selector may have the rate of convergence ($n^{-4/13}$ with less smoothness conditions on the unknown density functions than as described in Park and Marron's paper. Together with this, a class of various plug-in bandwidth selectors are considered and their asymptotic distributions are given. Finally, some ideas of possible improvements on those plug-in bandwidth selectors are provided.