• Title/Summary/Keyword: Discrete Approximation

Search Result 247, Processing Time 0.029 seconds

On the Numerical Inversion of the Laplace Transform by the Use of an Optimized Legendre Polynomial

  • Al-Shuaibi, Abdulaziz
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.4 no.1
    • /
    • pp.49-65
    • /
    • 2000
  • A method for inverting the Laplace transform is presented, using a finite series of the classical Legendre polynomials. The method recovers a real-valued function f(t) in a finite interval of the positive real axis when f(t) belongs to a certain class ${\mathcal{W}}_{\beta}$ and requires the knowledge of its Laplace transform F(s) only at a finite number of discrete points on the real axis s > 0. The choice of these points will be carefully considered so as to improve the approximation error as well as to minimize the number of steps needed in the evaluations. The method is tested on few examples, with particular emphasis on the estimation of the error bounds involved.

  • PDF

Reconstruction of structured models using incomplete measured data

  • Yu, Yan;Dong, Bo;Yu, Bo
    • Structural Engineering and Mechanics
    • /
    • v.62 no.3
    • /
    • pp.303-310
    • /
    • 2017
  • The model updating problems, which are to find the optimal approximation to the discrete quadratic model obtained by the finite element method, are critically important to the vibration analysis. In this paper, the structured model updating problem is considered, where the coefficient matrices are required to be symmetric and positive semidefinite, represent the interconnectivity of elements in the physical configuration and minimize the dynamics equations, and furthermore, due to the physical feasibility, the physical parameters should be positive. To the best of our knowledge, the model updating problem involving all these constraints has not been proposed in the existed literature. In this paper, based on the semidefinite programming technique, we design a general-purpose numerical algorithm for solving the structured model updating problems with incomplete measured data and present some numerical results to demonstrate the effectiveness of our method.

ERROR ESTIMATIES FOR A FREQUENCY-DOMAIN FINITE ELEMENT METHOD FOR PARABOLIC PROBLEMS WITH A NEUMANN BOUNDARY CONDITION

  • Lee, Jong-Woo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.35 no.2
    • /
    • pp.345-362
    • /
    • 1998
  • We introduce and anlyze a naturally parallelizable frequency-domain method for parabolic problems with a Neumann boundary condition. After taking the Fourier transformation of given equations in the space-time domain into the space-frequency domain, we solve an indefinite, complex elliptic problem for each frequency. Fourier inversion will then recover the solution of the original problem in the space-time domain. Existence and uniqueness of a solution of the transformed problem corresponding to each frequency is established. Fourier invertibility of the solution in the frequency-domain is also examined. Error estimates for a finite element approximation to solutions fo transformed problems and full error estimates for solving the given problem using a discrete Fourier inverse transform are given.

  • PDF

Identification of 18 flutter derivatives by covariance driven stochastic subspace method

  • Mishra, Shambhu Sharan;Kumar, Krishen;Krishna, Prem
    • Wind and Structures
    • /
    • v.9 no.2
    • /
    • pp.159-178
    • /
    • 2006
  • For the slender and flexible cable supported bridges, identification of all the flutter derivatives for the vertical, lateral and torsional motions is essential for its stability investigation. In all, eighteen flutter derivatives may have to be considered, the identification of which using a three degree-of-freedom elastic suspension system has been a challenging task. In this paper, a system identification technique, known as covariance-driven stochastic subspace identification (COV-SSI) technique, has been utilized to extract the flutter derivatives for a typical bridge deck. This method identifies the stochastic state-space model from the covariances of the output-only (stochastic) data. All the eighteen flutter derivatives have been simultaneously extracted from the output response data obtained from wind tunnel test on a 3-DOF elastically suspended bridge deck section-model. Simplicity in model suspension and measurements of only output responses are additional motivating factors for adopting COV-SSI technique. The identified discrete values of flutter derivatives have been approximated by rational functions.

Numerical Modeling of Soot Formation in $C_2H_4$/Air Turbulent Non-premixed Flames ($C_2H_4$/Air 비예혼합 난류화염의 매연생성 모델링)

  • Kim, Tae-Hoon;Woo, Min-O;Kim, Yong-Mo
    • Journal of the Korean Society of Combustion
    • /
    • v.15 no.4
    • /
    • pp.22-28
    • /
    • 2010
  • The Direct Quadrature Method of Moments (DQMOM) has been presented for the solution of population balance equation in the wide range of the multi-phase flows. This method has the inherently interesting features which can be easily applied to the multi-inner variable equation. In addition, DQMOM is capable of easily coupling the gas phase with the discrete phases while it requires the relatively low computational cost. Soot inception, subsequent aggregation, surface growth and oxidation are described through a population balance model solved with the DQMOM for soot formation. This approach is also able to represent the evolution of the soot particle size distribution. The turbulence-chemistry interaction is represented by the laminar flamelet model together with the presumed PDF approach and the spherical harmonic P-1 approximation is adopted to account for the radiative heat transfer.

A Tessellation of a Polynomial Curve by a Sequential Method (다항식곡선으로부터 순차적 방법에 의한 점열의 생성)

  • Ju S.Y.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.11 no.3
    • /
    • pp.205-210
    • /
    • 2006
  • Curve tessellation, which generates a sequence of points from a curve, is very important for curves rendering on a computer screen and for NC machining. For the most case the sequence of discrete points is used rather than a continuous curve. This paper deals with a method of tessellation by calculating the maximal deviation of a curve. The maximal deviation condition is introduced to find the point with the maximal chordal deviation on a curve segment. In the previous research a curve tessellation was tried by the subdivision method, that is, a curve is subdivided until the maximal chordal deviation is less than the given tolerance. On the other hand, a curve tessellation by sequential method is tried in this paper, that is, points are generated successively by using the local property of a curve. The sequential method generates relatively much less points than the subdivision method. Besides, the sequential method can generate a sequence of points from a spatial curve by approximation to a planar curve. The proposed method can be applied for high-accuracy curve tessellation and NC tool-path generation.

Charted Depth Interpolation: Neuron Network Approaches

  • Chaojian, Shi
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2004.08a
    • /
    • pp.37-44
    • /
    • 2004
  • Continuous depth data are often required in applications of both onboard systems and maritime simulation. But data available are usually discrete and irregularly distributed. Based on the neuron network technique, methods of interpolation to the charted depth are suggested in this paper. Two algorithms based on Levenberg-Marquardt back-propaganda and radial-basis function networks are investigated respectively. A dynamic neuron network system is developed which satisfies both real time and mass processing applications. Using hyperbolic paraboloid and typical chart area, effectiveness of the algorithms is tested and error analysis presented. Special process in practical applications such as partition of lager areas, normalization and selection of depth contour data are also illustrated.

  • PDF

AN APPROACH TO WALSH FUNCTIONS FOR OPTIMAL CONTROL OF DETERMINISTIC SYSTEMS (확정계의 최적제어를 위한 WALSH함수 접근)

  • Ahn, Doo-Soo;Bae, Jong-Il;Lee, Myung-Kyu;Kim, Jong-Boo;Lee, Seung
    • Proceedings of the KIEE Conference
    • /
    • 1989.07a
    • /
    • pp.116-120
    • /
    • 1989
  • The optimal control problem of linear Lumped Parameter Systems (LPS) and Distributed Parameter Systems (DPS) is studied by employing the technique of Walsh functions (WF). By the using the elegant operational properties of WF, a direct computational algorithm for evaluating the optimal control and trajectory of LPS and DPS is developed. Without the need of solving the traditional matrix Riccati equation, the WF approach in shown very simple in form and convenient for use of a computer. The approximation is in the sense of least squares employing WF as the basis and the results are in the piecewise constant and discrete form.

  • PDF

Position Control of Linear Actuator with Time Delay Using the Smith Predictor

  • Kang, Seung-Won;Park, Gi-sang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.68.1-68
    • /
    • 2001
  • This paper discusses tracking position control of linear actuator that has a time delay. The time delay happens when the process reads the sensor data and sends the control input to the plant located at a remote site in distributed control system. In this thesis, the time delay between the linear actuator and the discrete PID controller has constant value due to buffer device so the time delay can be modeled by Pade approximation but the large position error of the linear actuator is generated by the time delay. Therefore, the Smith predictor is used for tracking position control of the linear actuator with the time delay in order to minimize the effect of the time delay. The experimental and simulation results show that the ...

  • PDF

Analysis of a finite buffer with service interruption in a network interface unit (서비스 가로채기가 있는 네트워크 접속장치내의 유한버퍼의 분석)

  • 김영한
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.2
    • /
    • pp.1-7
    • /
    • 1996
  • In this paper, we analyzed the packet blocking probability of a finite buffer in a network interface unit. In general, a network interface unit which provides a means of interface between the network and computer has a microprocessor and a protocol processor for the network access protocols. It also has a receive buffer for the arriving packets from the network which is served by the microprocessor with service interruption by the protocol processor. In this paper, we modeled the receive buffer as a discrete time server with service interruption, and obtained the packet blocking probability using the mini-slot approximation.

  • PDF