• Journal of applied mathematics & informatics
• /
• 제6권2호
• /
• pp.523-538
• /
• 1999

A new preconditioning method is investigated to reduce the roundoff error in computing derivatives using Chebyshev col-location methods(CCM). Using this preconditioning causes ration of roundoff error of preconditioning method and CCm becomes small when N gets large. Also for accuracy enhancement of differentiation we use a domain decomposition approach. Error analysis shows that for this domain decomposition method error reduces proportional to the length of subintervals. Numerical results show that using domain decomposition and preconditioning simultaneously gives super accu-rate approximate values for first derivative of the function and good approximate values for moderately high derivatives.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제16권5호
• /
• pp.605-614
• /
• 2016

We develop a novel SAD circuit for power-efficient H.264 encoding, namely a-SAD. Here, some highest-order MSB's are approximated to single MSB. Our theoretical estimations show that our proposed design simultaneously improves performance and power of SAD circuit, achieving good power efficiency. We decide that the optimal number of approximated MSB's is four under 8-bit YUV-420 format, the largest number not to affect video quality and compression-rate in our video experiments. In logic simulations, our a-SAD circuit shows at least 9.3% smaller critical-path delay compared to existing SAD circuits. We compare power dissipation under iso-throughput scenario, where our a-SAD circuit obtains at least 11.6% power saving compared to other designs. We perform same simulations under two- and three-stage pipelined architecture. Here, our a-SAD circuit delivers significant performance (by 13%) and power (by 17% and 15.8% for two and three stages respectively) improvements.

• 대한자원환경지질학회:학술대회논문집
• /
• 대한자원환경지질학회 2002년도 춘계 공동학술발표회
• /
• pp.159-162
• /
• 2002

We tried to obtain an initial velocity model for prestack depth migration via waveform inversion. For application of any field data we chose a smooth background layered velocity model (v=v0 + k x z) as an initial velocity model. Newton type waveform inversion needs to invert huge Hessian matrix. In order to compute full Hessian matrix arising from full aperture data and full illumination zone, we meet insurmountable difficulties of paying astronomical computing cost. For the layered media, approximate Hessian emerging from single shot aperture data can be used repeatedly for split spread source configuration. In our work of using this Hessian characteristic of layered media we attempted to obtain the approximate velocity model as close as possible to the true velocity model in first iteration.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.941-944
• /
• 1988

To assure a successful completion of an assigned task without interruption, the hand of mechnical manipulator often travels along a preplanned path. This paper presents a method of obtaining a time sechdule of velocities and acceleration along the path, under the constraints. Because of the involvement of a linear performance index and a largr number of nonlinear constraints, the "method of approximate programming (AMP)" is applied. To overcome the false solutions AMP is modified. To reduce the computing time, a "direct approximate programming algorithm (DAPA)" is developed.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 추계학술대회 논문집 전력기술부문
• /
• pp.73-76
• /
• 2001

This paper presents a new systematic contingency selection, screening and ranking method for on-line transient security assessment. Transient stability of a particular generator is influenced most by fault near it. Fault at the transmission lines adjacent to the generators are selected as contingency. Two screening methods are developed using the sensitivity of modal synchronizing torque coefficient and computing an approximate critical clearing time(CCT) without time simulation. The first method, which considers only synchronizing power, may mislead in some cases since it does not consider the acceleration power. The approximate CCT method, which consider both the acceleration and deceleration power, worked well. Finally the Single Machine Equivalent(SIME) method is implemented using IPLAN of PSS/E for detailed stability analysis.

• 정보처리학회논문지D
• /
• 제11D권1호
• /
• pp.219-228
• /
• 2004

지금까지 비율(proportion)에 대한 신뢰구간의 근사적 추정량(approximate estimator)에 대한 여러 기법들이 제안되었으나, 시뮬레이션 결과에 대한 coverage 분석을 수행할 경우에는 정규분포에 기반 한 신뢰구간 추정량이 주로 이용되었다. 그 이유는 정규분포에 대한 근사법이 다른 근사법들 보다 실제 구현하는데 쉽게 여겨졌기 때문이다. 하지만, 최근에 arcsin 변환에 기반한 coverage 분석을 위한 근사법이 [12]에서 시뮬레이션 수행 시에 최종결과에 요구되는 정확도의 조절과 비율을 추정하기 위해서 사용되었다. 본 논문에서는 세 개의 신뢰구간 추정량 근사법(정규분포 기반 근사법, arcsin 변환 기반 근사법, 그리고 F-분포 기반 근사법)을 비교 분석하였다. 세 신뢰구간에 대한 추정량을 단일 프로세서와 다중 프로세서 상에서 참조모델(reference model)로 M/M/1/$\infty$와 W/D/l/$\infty$ 큐잉 시스템을 활용하여 정상상태(steady-state)에서의 평균치를 추정하는 시뮬레이션에 적용하였다.

• 한국지능시스템학회논문지
• /
• 제21권6호
• /
• pp.737-742
• /
• 2011

주행문제는 불확실한 외란의 영향을 받는 이동로봇 등의 시스템에 대하여 각종 제약조건들을 만족하도록 하는 제어 입력을 결정하는 과제를 포함한다. 이러한 과제는 제약조건을 갖는 확률 제어 문제로 모델링될 수 있다. 이러한 종류의 제어문제를 풀기 위하여, 최적 가치함수 개념에 의존하는 동적 계획법의 활용을 시도해볼 수 있다. 하지만, 대부분의 실제 문제에서 이러한 시도는 많은 어려움, 예컨대, 시스템의 완벽한 모델이 알려지지 않거나, 최적 제어정책을 구하기 위한 계산이 불가능하거나, 수없이 많은 계산 자원을 필요로 하는 등의 문제점을 안겨줄 수 있다. 이러한 동적 계획법의 어려움을 극복하기 위한 전략으로, 근사적 가치함수에 의존하여 준최적 제어정책을 구하는 근사적 동적 계획법을 사용할 수 있다. 본 논문에서는 최근에 제시된 근사 동적 계획법들을 복잡한 제약조건을 갖는 주행 문제에 적용하여 보고 그 결과로 얻어지는 성능 특성을 관찰해 본다.

• Journal of applied mathematics & informatics
• /
• 제5권3호
• /
• pp.749-758
• /
• 1998

We investigate some numerical methods for computing approximate solutions of a system of second order boundary value problems associated with obstacle unilateral and contact problems. We show that cubic spline method gives approximations which are better than that computed by higer order spline and finite difference techniques.

• 호남수학학술지
• /
• 제15권1호
• /
• pp.105-120
• /
• 1993

The auxiliary principle technique is used to prove the uniqueness and the existence of solutions for a class of nonlinear variational inequalities and suggest an innovative iterative algorithm for computing the approximate solution of variational inequalities. Error estimates for the finite element approximation of the solution of variational inequalities are derived, which refine the previous known results. An example is given to illustrate the applications of the results obtained. Several special cases are considered and studied.

• Journal of applied mathematics & informatics
• /
• 제27권3_4호
• /
• pp.693-702
• /
• 2009

In this paper, we introduce and study a system of mixed variational inequalities in Banach spaces. By using J-proximal mapping and its Lipschitz continuity for a nonconvex, lower semicontinuous, subdifferentiable, proper functional, an iterative algorithm for computing the approximate solutions of system of mixed variational inequalities is suggested and analyzed. The convergence criteria of the iterative sequences generated by iterative algorithm is also discussed.