• Title/Summary/Keyword: Approximation Method

Search Result 2,545, Processing Time 0.026 seconds

Node Monitoring Algorithm with Piecewise Linear Function Approximation for Efficient LDPC Decoding (Node Monitoring 알고리듬과 NP 방법을 사용한 효율적인 LDPC 복호방법)

  • Suh, Hee-Jong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.6 no.1
    • /
    • pp.20-26
    • /
    • 2011
  • In this paper, we propose an efficient algorithm for reducing the complexity of LDPC code decoding by using node monitoring (NM) and Piecewise Linear Function Approximation (NP). This NM algorithm is based on a new node-threshold method, and the message passing algorithm. Piecewise linear function approximation is used to reduce the complexity for more. This algorithm was simulated in order to verify its efficiency. Simulation results show that the complexity of our NM algorithm is reduced to about 20%, compared with thoes of well-known method.

The Semi-Analytic Structural Sensitivity Using Pade Approximation (Pade근사를 이용한 준해석 구조 민감도의 해석)

  • Dan, Ho-Jin;Lee, Byung-Chai
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.26 no.12
    • /
    • pp.2631-2635
    • /
    • 2002
  • The semi-analytic sensitivity analysis using Pade approximation is presented for linear elastic structures. Although the semi-analytic method has several advantages, accuracy of the method prevents it from practical application. One of promising remedies is the use of geometric series for the matrix inversion. Though series expansion of order three has been successfully applied to the calculation of the structural sensitivity in the most range of the design perturbation, it is prone to have a slow convergence for large perturbation. To overcome this shortage, Pade approximation is introduced so that it can broaden the trust region of the perturbation without adding expansion terms. Numerical results show that the confident sensitivity can be obtained with tiny expenses of computation effort.

APPROXIMATION METHOD FOR SCATTERED DATA FROM SHIFTS OF A RADIAL BASIS FUNCTION

  • Yoon, Jung-Ho
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.5_6
    • /
    • pp.1087-1095
    • /
    • 2009
  • In this paper, we study approximation method from scattered data to the derivatives of a function f by a radial basis function $\phi$. For a given function f, we define a nearly interpolating function and discuss its accuracy. In particular, we are interested in using smooth functions $\phi$ which are (conditionally) positive definite. We estimate accuracy of approximation for the Sobolev space while the classical radial basis function interpolation applies to the so-called native space. We observe that our approximant provides spectral convergence order, as the density of the given data is getting smaller.

  • PDF

Feature curve extraction from point clouds via developable strip intersection

  • Lee, Kai Wah;Bo, Pengbo
    • Journal of Computational Design and Engineering
    • /
    • v.3 no.2
    • /
    • pp.102-111
    • /
    • 2016
  • In this paper, we study the problem of computing smooth feature curves from CAD type point clouds models. The proposed method reconstructs feature curves from the intersections of developable strip pairs which approximate the regions along both sides of the features. The generation of developable surfaces is based on a linear approximation of the given point cloud through a variational shape approximation approach. A line segment sequencing algorithm is proposed for collecting feature line segments into different feature sequences as well as sequential groups of data points. A developable surface approximation procedure is employed to refine incident approximation planes of data points into developable strips. Some experimental results are included to demonstrate the performance of the proposed method.

NUMERICAL SIMULATION OF THE FRACTIONAL-ORDER CONTROL SYSTEM

  • Cai, X.;Liu, F.
    • Journal of applied mathematics & informatics
    • /
    • v.23 no.1_2
    • /
    • pp.229-241
    • /
    • 2007
  • Multi-term fractional differential equations have been used to simulate fractional-order control system. It has been demonstrated the necessity of the such controllers for the more efficient control of fractional-order dynamical system. In this paper, the multi-term fractional ordinary differential equations are transferred into equivalent a system of equations. The existence and uniqueness of the new system are proved. A fractional order difference approximation is constructed by a decoupled technique and fractional-order numerical techniques. The consistence, convergence and stability of the numerical approximation are proved. Finally, some numerical results are presented to demonstrate that the numerical approximation is a computationally efficient method. The new method can be applied to solve the fractional-order control system.

A Simultaneous Perturbation Stochastic Approximation (SPSA)-Based Model Approximation and its Application for Power System Stabilizers

  • Ko, Hee-Sang;Lee, Kwang-Y.;Kim, Ho-Chan
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.4
    • /
    • pp.506-514
    • /
    • 2008
  • This paper presents an intelligent model; named as free model, approach for a closed-loop system identification using input and output data and its application to design a power system stabilizer (PSS). The free model concept is introduced as an alternative intelligent system technique to design a controller for such dynamic system, which is complex, difficult to know, or unknown, with input and output data only, and it does not require the detail knowledge of mathematical model for the system. In the free model, the data used has incremental forms using backward difference operators. The parameters of the free model can be obtained by simultaneous perturbation stochastic approximation (SPSA) method. A linear transformation is introduced to convert the free model into a linear model so that a conventional linear controller design method can be applied. In this paper, the feasibility of the proposed method is demonstrated in a one-machine infinite bus power system. The linear quadratic regulator (LQR) method is applied to the free model to design a PSS for the system, and compared with the conventional PSS. The proposed SPSA-based LQR controller is robust in different loading conditions and system failures such as the outage of a major transmission line or a three phase to ground fault which causes the change of the system structure.

Valuation of American Option Prices Under the Double Exponential Jump Diffusion Model with a Markov Chain Approximation (이중 지수 점프확산 모형하에서의 마코브 체인을 이용한 아메리칸 옵션 가격 측정)

  • Han, Gyu-Sik
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.38 no.4
    • /
    • pp.249-253
    • /
    • 2012
  • This paper suggests a numerical method for valuation of American options under the Kou model (double exponential jump diffusion model). The method is based on approximation of underlying asset price using a finite-state, time-homogeneous Markov chain. We examine the effectiveness of the proposed method with simulation results, which are compared with those from the conventional numerical method, the finite difference method for PIDE (partial integro-differential equation).

Valuation of European and American Option Prices Under the Levy Processes with a Markov Chain Approximation

  • Han, Gyu-Sik
    • Management Science and Financial Engineering
    • /
    • v.19 no.2
    • /
    • pp.37-42
    • /
    • 2013
  • This paper suggests a numerical method for valuation of European and American options under the two L$\acute{e}$vy Processes, Normal Inverse Gaussian Model and the Variance Gamma model. The method is based on approximation of underlying asset price using a finite-state, time-homogeneous Markov chain. We examine the effectiveness of the proposed method with simulation results, which are compared with those from the existing numerical method, the lattice-based method.

Vertex Selection Scheme for Shape Approximation Based on Dynamic Programming (동적 프로그래밍에 기반한 윤곽선 근사화를 위한 정점 선택 방법)

  • 이시웅;최재각;남재열
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.3
    • /
    • pp.121-127
    • /
    • 2004
  • This paper presents a new vertex selection scheme for shape approximation. In the proposed method, final vertex points are determined by "two-step procedure". In the first step, initial vertices are simply selected on the contour, which constitute a subset of the original contour, using conventional methods such as an iterated refinement method (IRM) or a progressive vertex selection (PVS) method In the second step, a vertex adjustment Process is incorporated to generate final vertices which are no more confined to the contour and optimal in the view of the given distortion measure. For the optimality of the final vertices, the dynamic programming (DP)-based solution for the adjustment of vertices is proposed. There are two main contributions of this work First, we show that DP can be successfully applied to vertex adjustment. Second, by using DP, the global optimality in the vertex selection can be achieved without iterative processes. Experimental results are presented to show the superiority of our method over the traditional methods.

Order Based Performance Evaluation of a CONWIP System with Compound Poisson Demands (복합포아송 수요를 갖는 CONWIP 시스템의 주문관점에서의 성능평가)

  • Park, Chan-Woo;Lee, Hyo-Seong
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.32 no.1
    • /
    • pp.137-146
    • /
    • 2007
  • In this study we consider a CONWIP system studied in Park and Lee [1] in which the processing times at each station follow a Coxian distribution and the demands for the finished products arrive according to a compound Poisson process. The demands that are not satisfied Immediately are either backordered or lost according to the number of demands that exist at their arrival instants. For this system using the results in [1] we develop an approximation method to calculate order based performance measures such as the mean time of fulfilling a customer order and the mean number of customer orders. To test the accuracy of the approximation method, the results obtained from the approximation method are compared with those obtained by simulation. Comparisons with simulation have shown that the approximate method provides fairly good results.