• Title/Summary/Keyword: approximation error

Search Result 723, Processing Time 0.033 seconds

Rule of Combination Using Expanded Approximation Algorithm (확장된 근사 알고리즘을 이용한 조합 방법)

  • Moon, Won Sik
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.3
    • /
    • pp.21-30
    • /
    • 2013
  • Powell-Miller theory is a good method to express or treat incorrect information. But it has limitation that requires too much time to apply to actual situation because computational complexity increases in exponential and functional way. Accordingly, there have been several attempts to reduce computational complexity but side effect followed - certainty factor fell. This study suggested expanded Approximation Algorithm. Expanded Approximation Algorithm is a method to consider both smallest supersets and largest subsets to expand basic space into a space including inverse set and to reduce Approximation error. By using expanded Approximation Algorithm suggested in the study, basic probability assignment function value of subsets was alloted and added to basic probability assignment function value of sets related to the subsets. This made subsets newly created become Approximation more efficiently. As a result, it could be known that certain function value which is based on basic probability assignment function is closely near actual optimal result. And certainty in correctness can be obtained while computational complexity could be reduced. by using Algorithm suggested in the study, exact information necessary for a system can be obtained.

G3 HEXIC Bézier CURVES APPROXIMATING CONIC SECTIONS

  • HYEONG MOON YOON;YOUNG JOON AHN
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.28 no.1
    • /
    • pp.22-32
    • /
    • 2024
  • In this paper we present a method of conic section approximation by hexic Bézier curves. The hexic Bézier approximants are G3 Hermite interpolations of conic sections. We show that there exists at least one hexic Bézier approximant for each weight of the conic section The hexic Bézier approximant depends one parameter and it can be obtained by solving a quartic polynomial, which is solvable algebraically. We present the explicit upper bound of the Hausdorff distance between the conic section and the hexic Bézier approximant. We also prove that our approximation method has the maximal order of approximation. The numerical examples for conic section approximation by hexic Bézier curves are given and illustrate our assertions.

Linear Unequal Error Protection Codes based on Terminated Convolutional Codes

  • Bredtmann, Oliver;Czylwik, Andreas
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.12-20
    • /
    • 2015
  • Convolutional codes which are terminated by direct truncation (DT) and zero tail termination provide unequal error protection. When DT terminated convolutional codes are used to encode short messages, they have interesting error protection properties. Such codes match the significance of the output bits of common quantizers and therefore lead to a low mean square error (MSE) when they are used to encode quantizer outputs which are transmitted via a noisy digital communication system. A code construction method that allows adapting the code to the channel is introduced, which is based on time-varying convolutional codes. We can show by simulations that DT terminated convolutional codes lead to a lower MSE than standard block codes for all channel conditions. Furthermore, we develop an MSE approximation which is based on an upper bound on the error probability per information bit. By means of this MSE approximation, we compare the convolutional codes to linear unequal error protection code construction methods from the literature for code dimensions which are relevant in analog to digital conversion systems. In numerous situations, the DT terminated convolutional codes have the lowest MSE among all codes.

A NOTE ON APPROXIMATION OF SOLUTIONS OF A K-POSITIVE DEFINITE OPERATOR EQUATIONS

  • Osilike, M.O.;Udomene, A.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.38 no.2
    • /
    • pp.231-236
    • /
    • 2001
  • In this note we construct a sequence of Picard iterates suitable for the approximation of solutions of K-positive definite operator equations in arbitrary real Banach spaces. Explicit error estimate is obtained and convergence is shown to be as fast as a geometric progression.

  • PDF

Differential non-linearity correction for successive approximation ADC

  • Yamada, Hikaru
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1987.10a
    • /
    • pp.847-850
    • /
    • 1987
  • In this paper a new method to correct the differential non-linearity(D NL) error for a successive approximation is proposed. The DNL of ADC is very important characteristic in the field of radiation pulse height analysis or measurement of probability density function. The results of computer simulations are shown to demonstrate the feasibility of the proposed correction method.

  • PDF

The First Passage Time of Stock Price under Stochastic Volatility

  • Nguyen, Andrew Loc
    • Journal of the Korean Data and Information Science Society
    • /
    • v.15 no.4
    • /
    • pp.879-889
    • /
    • 2004
  • This paper gives an approximation to the distribution function of the .rst passage time of stock price when volatility of stock price is modeled by a function of Ornstein-Uhlenbeck process. It also shows how to obtain the error of the approximation.

  • PDF

A study on a new method of LQG/LTR for nonminimum phase plant by using zero structure (영점구조를 이용한 비 최소위상 플랜트의 새로운 LQG/LTR 방법연구)

  • 서병설;강진식
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1991.10a
    • /
    • pp.208-212
    • /
    • 1991
  • LQG/LTR method cannot applied to nonminimum phase plant. In this paper, we present a new approximation method which guaratee the approximation error equal to zero and exact loop transfer recovery. Zero structure of plant and approximated plant are considered in approximation procedure. It is shown that the properties of plant and approximated plant at pole and zero frequency response are exactly same. It is shown by example that the suggested method can avoide the NMP plant constraint arised in designing LQG/LTR.

  • PDF

Nonparametric Estimation of Mean Residual Life by Partial Moment Approximation under Proportional Hazard Model

  • Cha, Young-Joon
    • Journal of the Korean Data and Information Science Society
    • /
    • v.15 no.4
    • /
    • pp.965-971
    • /
    • 2004
  • In this paper we consider several nonparametric estimators for the mean residual life by using the partial moment approximation under the proportional hazard model. Also we compare the magnitude of mean square error of the proposed nonparametric estimators for mean residual life under the proportional hazard model.

  • PDF