• Journal of applied mathematics & informatics
• /
• v.6 no.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
• /
• v.16 no.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.

• Proceedings of the KSEEG Conference
• /
• 2002.04a
• /
• 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.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• 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.

• Proceedings of the KIEE Conference
• /
• 2001.11b
• /
• 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.

• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.219-228
• /
• 2004

Confidence interval estimators for proportions using normal approximation have been commonly used for coverage analysis of simulation output even though alternative approximate estimators of confidence intervals for proportions were proposed. This is -because the normal approximation was easier to use in practice than the other approximate estimators. Computing technology has no problem with dealing these alternative estimators. Recently, one of the approximation methods for coverage analysis which is based on arcsin transformation has been used for estimating proportion and for controlling the required precision in [12]. In this paper, we compare three approximate interval estimators, based on a normal distribution approximation, an arcsin transformation and an F-distribution approximation, of a single proportion. Three estimators were applied to sequential coverage analysis of steady-state means, in simulations of the M/M/1/$\infty$ and W/D/l/$\infty$ queueing systems on a single processor and multiple processors.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.6
• /
• pp.737-742
• /
• 2011

Navigation problems include the task of determining the control input under various constraints for systems such as mobile robots subject to uncertain disturbance. Such tasks can be modeled as constrained stochastic control problems. In order to solve these control problems, one may try to utilize the dynamic programming(DP) methods which rely on the concept of optimal value function. However, in most real-world problems, this trial would give us many difficulties; for examples, the exact system model may not be known; the computation of the optimal control policy may be impossible; and/or a huge amount of computing resource may be in need. As a strategy to overcome the difficulties of DP, one can utilize ADP(approximate dynamic programming) methods, which find suboptimal control policies resorting to approximate value functions. In this paper, we apply recently proposed ADP methods to a class of navigation problems having complex constraints, and observe the resultant performance characteristics.

• Journal of applied mathematics & informatics
• /
• v.5 no.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.

• Honam Mathematical Journal
• /
• v.15 no.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
• /
• v.27 no.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.