• Title/Summary/Keyword: Finding error

Search Result 467, Processing Time 0.163 seconds

THE ORDER AND SPEED OF CONVERGENCE FOR THE k-FOLD PSEUDO-OLVER'S METHOD LOCATING A SIMPLE REAL ZERO

  • Kim, Young Ik
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.19 no.1
    • /
    • pp.49-56
    • /
    • 2006
  • A convergence behavior is under investigation near a simple real zero for the k-fold pseudo-Olver's method defined by extending the classical Olver's method. The order of convergence is shown to be at least k+3. The asymptotic error constant is explicitly given in terms of k and the corresponding simple zero. Various numerical examples with a proposed zero-finding algorithm are successfully confirmed with the use of symbolic and computational ability of Mathematica.

  • PDF

Optimal Restrictions on Regression Parameters For Linear Mixture Model

  • Ahn, Jung-Yeon;Park, Sung-Hyun
    • Journal of the Korean Statistical Society
    • /
    • v.28 no.3
    • /
    • pp.325-336
    • /
    • 1999
  • Collinearity among independent variables can have severe effects on the precision of response estimation for some region of interest in the experiments with mixture. A method of finding optimal linear restriction on regression parameter in linear model for mixture experiments in the sense of minimizing integrated mean squared error is studied. We use the formulation of optimal restrictions on regression parameters for estimating responses proposed by Park(1981) by transforming mixture components to mathematically independent variables.

  • PDF

Frequency weighted reduction using Lyapunov inequalities (Lyapunov 부등식을 이용한 주파수하중 차수축소)

  • 오도창;정은태;이상경
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.12-12
    • /
    • 2000
  • This paper consider a new weighted model reduction using block diagonal solutions of Lyapunov inequalities. With the input and/or output weighting function, the stability of reduced order system is quaranteed and a priori error bound is proposed. to achieve this, after finding the solutions of two Lyapunov inequalities and balancing the full order system, we find the reduced order systems using the direct truncation and the singular perturbation approximation. The proposed method is compared with other existing methods using numerical example.

  • PDF

Historical Considerations of Finding the Volume of a Pyramid (각뿔의 부피 구하기에 대한 수학사적 고찰)

  • Chung, Young Woo;Kim, Boo Yoon
    • East Asian mathematical journal
    • /
    • v.33 no.2
    • /
    • pp.149-175
    • /
    • 2017
  • The effort to find the volume of pyramids has been done by mathematicians for a long time, and many trial-and-error calculations and proofs give various perspectives and educational material. In the early days, finding the volume of pyramids was mainly studied by calculating the volume of triangular pyramids or quadrangular pyramids by cutting and the relationship between pyramids. Thereafter, methods based on infinite, infinitesimal, limit, etc. appeared, but the research topic was still about them. The purpose of this study is to examine the four themes appearing the mathematics history in terms of methodology, and to think about its implications from the viewpoint of improving the professionalism of the teachers.

The phase correction method for the interferometer direction-finding system (인터페로미터 방향탐지 시스템의 위상보정 방법)

  • Lee, Jung-hoon;Jo, Jeil
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.10a
    • /
    • pp.355-356
    • /
    • 2018
  • An interferometer is antenna system composed fo two or more elements that can be used to determine the diretion of arrival (DOA) of a received signal by measuring the relative phase between receiving elements. In order to minimize the error of the direction-finding accuracy in interferometer direction-finding system (DFS), the phase correction is accomplished. In this paper, the several methods for the phase correction are classified and the advantage and disadvantage of those methods are compared.

  • PDF

A Rational Quantity of Measurement for Finding Flatness of a Surface Table (정반 평면도 평가를 위한 측정점의 합리적인 개수의 결정)

  • Hyun, Chang-Hun;Shin, Sang-Cheol;Park, Hung-Sik
    • Journal of Industrial Technology
    • /
    • v.18
    • /
    • pp.181-186
    • /
    • 1998
  • The flatness is the most important nature for the surface table. For finding such a flatness, the surface is surveyed along a number of straight lines parallel to the edges of table, which form a grid. Next, the variations in height of the grid points are measured relative to a datum point. If the number of such points is increased. It is not necessarily to use many grid points for finding the original flatness of a measured surface table. So, it is necessary to find the rational quantity of such grid points. It is found that about 220 points per $1m^2$ of surface table for measurement is the rational quantity with less than about 15% error of the original flatness.

  • PDF

Speeding-up for error back-propagation algorithm using micro-genetic algorithms (미소-유전 알고리듬을 이용한 오류 역전파 알고리듬의 학습 속도 개선 방법)

  • 강경운;최영길;심귀보;전홍태
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10a
    • /
    • pp.853-858
    • /
    • 1993
  • The error back-propagation(BP) algorithm is widely used for finding optimum weights of multi-layer neural networks. However, the critical drawback of the BP algorithm is its slow convergence of error. The major reason for this slow convergence is the premature saturation which is a phenomenon that the error of a neural network stays almost constant for some period time during learning. An inappropriate selections of initial weights cause each neuron to be trapped in the premature saturation state, which brings in slow convergence speed of the multi-layer neural network. In this paper, to overcome the above problem, Micro-Genetic algorithms(.mu.-GAs) which can allow to find the near-optimal values, are used to select the proper weights and slopes of activation function of neurons. The effectiveness of the proposed algorithms will be demonstrated by some computer simulations of two d.o.f planar robot manipulator.

  • PDF

Design of Reed Solomon Encoder/Decoder for Compact Disks (컴팩트 디스크를 위한 Reed Solomon 부호기/복호기 설계)

  • 김창훈;박성모
    • Proceedings of the IEEK Conference
    • /
    • 2000.11b
    • /
    • pp.281-284
    • /
    • 2000
  • This paper describes design of a (32, 28) Reed Solomon decoder for optical compact disk with double error detecting and correcting capability. A variety of error correction codes(ECCs) have been used in magnetic recordings, and optical recordings. Among the various types of ECCs, Reed Solomon(RS) codes has emerged as one the most important ones. The most complex circuit in the RS decoder is the part for finding the error location numbers by solving error location polynomial, and the circuit has great influence on overall decoder complexity. We use RAM based architecture with Euclid's algorithm, Chien search algorithm and Forney algorithm. We have developed VHDL model and peformed logic synthesis using the SYNOPSYS CAD tool. The total umber of gate is about 11,000 gates.

  • PDF

A Study on Measurement Error Factors of Theodolite System (데오도라이트 시스템의 측정 오차 요인에 관한 연구)

  • 박홍철;윤용식;최석원
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2003.06a
    • /
    • pp.272-275
    • /
    • 2003
  • Theodolite measurement system is non-contacted 3-dimensional measurement system. The system accuracy is 0.5 mm or better for distance 0 ~ 100 m. And the system is used for the measurement of a product for middle and large scale. This study was performed for finding the measurement error factors of the system. We could know that the main error factors are temperature, illumination and expertness. And we could find the measurement errors are $\pm$ 0.045 mm at temperature conditions is 2$0^{\circ}C$ and $\pm$ 0.012 mm at illumination condition is 300 lux. Also the results had significant differences by combinations of operator's expertness.

  • PDF

Fuzzy Logic Based Temporal Error Concealment for H.264 Video

  • Lee, Pei-Jun;Lin, Ming-Long
    • ETRI Journal
    • /
    • v.28 no.5
    • /
    • pp.574-582
    • /
    • 2006
  • In this paper, a new error concealment algorithm is proposed for the H.264 standard. The algorithm consists of two processes. The first process uses a fuzzy logic method to select the size type of lost blocks. The motion vector of a lost block is calculated from the current frame, if the motion vectors of the neighboring blocks surrounding the lost block are discontinuous. Otherwise, the size type of the lost block can be determined from the preceding frame. The second process is an error concealment algorithm via a proposed adapted multiple-reference-frames selection for finding the lost motion vector. The adapted multiple-reference-frames selection is based on the motion estimation analysis of H.264 coding so that the number of searched frames can be reduced. Therefore the most accurate mode of the lost block can be determined with much less computation time in the selection of the lost motion vector. Experimental results show that the proposed algorithm achieves from 0.5 to 4.52 dB improvement when compared to the method in VM 9.0.

  • PDF