• Title/Summary/Keyword: Taylor polynomial

Search Result 32, Processing Time 0.026 seconds

A Generalized Finite Difference Method for Crack Analysis (일반화된 유한차분법을 이용한 균열해석)

  • Yoon, Young-Cheol;Kim, Dong-Jo;Lee, Sang-Ho
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2007.04a
    • /
    • pp.501-506
    • /
    • 2007
  • A generalized finite difference method for solving solid mechanics problems such as elasticity and crack problems is presented. The method is constructed in framework of Taylor polynomial based on the Moving Least Squares method and collocation scheme based on the diffuse derivative approximation. The governing equations are discretized into the difference equations and the nodal solutions are obtained by solving the system of equations. Numerical examples successfully demonstrate the robustness and efficiency of the proposed method.

  • PDF

Taylor′s Series Model Analysis of Maximum Simultaneous Switching Noise for Ground Interconnection Networks in CMOS Systems (CMOS그라운드 연결망에서 발생하는 최대 동시 스위칭 잡음의 테일러 급수 모형의 분석)

  • 임경택;조태호;백종흠;김석윤
    • Proceedings of the IEEK Conference
    • /
    • 2001.06b
    • /
    • pp.129-132
    • /
    • 2001
  • This paper presents an efficient method to estimate the maximum SSN (simultaneous switching noise) for ground interconnection networks in CMOS systems using Taylor's series and analyzes the truncation error that has occurred in Taylor's series approximation. We assume that the curve form of noise voltage on ground interconnection networks is linear and derive a polynomial expression to estimate the maximum value of SSN using $\alpha$-power MOS model. The maximum relative error due to the truncation is shown to be under 1.87% through simulations when we approximate the noise expression in the 3rd-order polynomial.

  • PDF

Analysis of Stress Concentration Problems Using Moving Least Squares Finite Difference Method(I) : Formulation for Solid Mechanics Problem (이동최소제곱 유한차분법을 이용한 응력집중문제 해석(I) : 고체문제의 정식화)

  • Yoon, Young-Cheol;Kim, Hyo-Jin;Kim, Dong-Jo;Liu, Wing Kam;Belytschko, Ted;Lee, Sang-Ho
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.20 no.4
    • /
    • pp.493-499
    • /
    • 2007
  • The Taylor expansion expresses a differentiable function and its coefficients provide good approximations for the given function and its derivatives. In this study, m-th order Taylor Polynomial is constructed and the coefficients are computed by the Moving Least Squares method. The coefficients are applied to the governing partial differential equation for solid problems including crack problems. The discrete system of difference equations are set up based on the concept of point collocation. The developed method effectively overcomes the shortcomings of the finite difference method which is dependent of the grid structure and has no approximation function, and the Galerkin-based meshfree method which involves time-consuming integration of weak form and differentiation of the shape function and cumbersome treatment of essential boundary.

A Direct Expansion Algorithm for Transforming B-spline Curve into a Piecewise Polynomial Curve in a Power Form. (B-spline 곡선을 power 기저형태의 구간별 다항식으로 바꾸는 Direct Expansion 알고리듬)

  • 김덕수;류중현;이현찬;신하용;장태범
    • Korean Journal of Computational Design and Engineering
    • /
    • v.5 no.3
    • /
    • pp.276-284
    • /
    • 2000
  • Usual practice of the transformation of a B-spline curve into a set of piecewise polynomial curves in a power form is done by either a knot refinement followed by basis conversions or applying a Taylor expansion on the B-spline curve for each knot span. Presented in this paper is a new algorithm, called a direct expansion algorithm, for the problem. The algorithm first locates the coefficients of all the linear terms that make up the basis functions in a knot span, and then the algorithm directly obtains the power form representation of basis functions by expanding the summation of products of appropriate linear terms. Then, a polynomial segment of a knot span can be easily obtained by the summation of products of the basis functions within the knot span with corresponding control points. Repeating this operation for each knot span, all of the polynomials of the B-spline curve can be transformed into a power form. The algorithm has been applied to both static and dynamic curves. It turns out that the proposed algorithm outperforms the existing algorithms for the conversion for both types of curves. Especially, the proposed algorithm shows significantly fast performance for the dynamic curves.

  • PDF

A study on understanding of Taylor series (테일러급수의 이해에 대한 연구)

  • Oh, Hye-Young
    • Communications of Mathematical Education
    • /
    • v.31 no.1
    • /
    • pp.71-84
    • /
    • 2017
  • Taylor series has a complicated structure comprising of various concepts in college major mathematics. This subject is a strong tool which has usefulness and applications not only in calculus, analysis, and complex analysis but also in physics, engineering etc., and other study. However, students have difficulties in understanding mathematical structure of Taylor series convergence correctly. In this study, after classifying students' mathematical characteristic into three categories, we use structural image of Taylor series convergence which associated with mathematical structure and operation acted on that structure. Thus, we try to analyze the understanding of Taylor series convergence and present the results of this study.

Anti-Swing Control of Overhead Crane System using Sum of Squares Method (천정형 크레인의 흔들림 억제제어에 관한 SOS 접근법)

  • Hong, Jin-Hyun;Kim, Cheol-Joong;Chwa, Dongkyoung
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.62 no.3
    • /
    • pp.407-413
    • /
    • 2013
  • This paper proposes anti-swing control of overhead crane system using sum of squares method. The dynamic equations of overhead crane include nonlinear terms, which are transformed into polynomials by using Taylor series expansion. Therefore the dynamic equation of overhead crane can be changed to the system of polynomial equation. On the basis of polynomial dynamics of crane system, we propose the Sum of Squares (SOS) conditions considering the input constraints. In addition, control gains are obtained by numerical tool which is called by SOSTOOL. The effectiveness of the proposed method is demonstrated by numerical simulation.

Intrinsic Enrichment of Moving Least Squares Finite Difference Method for Solving Elastic Crack Problems (탄성균열 해석을 위한 이동최소제곱 유한차분법의 내적확장)

  • Yoon, Young-Cheol;Lee, Sang-Ho
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.29 no.5A
    • /
    • pp.457-465
    • /
    • 2009
  • This study presents a moving least squares (MLS) finite difference method for solving elastic crack problems with stress singularity at the crack tip. Near-tip functions are intrinsically employed in the MLS approximation to model near-tip field inducing singularity in stress field. employment of the functions does not lose the merit of the MLS Taylor polynomial approximation which approximates the derivatives of a function without actual differentiating process. In the formulation of crack problem, computational efficiency is considerably improved by taking the strong formulation instead of weak formulation involving time consuming numerical quadrature Difference equations are constructed on the nodes distributed in computational domain. Numerical experiments for crack problems show that the intrinsically enriched MLS finite difference method can sharply capture the singular behavior of near-tip stress and accurately evaluate stress intensity factors.

Comparison of Matrix Exponential Methods for Fuel Burnup Calculations

  • Oh, Hyung-Suk;Yang, Won-Sik
    • Nuclear Engineering and Technology
    • /
    • v.31 no.2
    • /
    • pp.172-181
    • /
    • 1999
  • Series expansion methods to compute the exponential of a matrix have been compared by applying them to fuel depletion calculations. Specifically, Taylor, Pade, Chebyshev, and rational Chebyshev approximations have been investigated by approximating the exponentials of bum matrices by truncated series of each method with the scaling and squaring algorithm. The accuracy and efficiency of these methods have been tested by performing various numerical tests using one thermal reactor and two fast reactor depletion problems. The results indicate that all the four series methods are accurate enough to be used for fuel depletion calculations although the rational Chebyshev approximation is relatively less accurate. They also show that the rational approximations are more efficient than the polynomial approximations. Considering the computational accuracy and efficiency, the Pade approximation appears to be better than the other methods. Its accuracy is better than the rational Chebyshev approximation, while being comparable to the polynomial approximations. On the other hand, its efficiency is better than the polynomial approximations and is similar to the rational Chebyshev approximation. In particular, for fast reactor depletion calculations, it is faster than the polynomial approximations by a factor of ∼ 1.7.

  • PDF

ENERGY DECAY FOR A VISCOELASTIC EQUATION WITH BALAKRISHNAN-TAYLOR DAMPING INVOLVING INFINITE MEMORY AND NONLINEAR TIME-VARYING DELAY TERMS IN DYNAMICAL BOUNDARY

  • Soufiane Benkouider;Abita Rahmoune
    • Communications of the Korean Mathematical Society
    • /
    • v.38 no.3
    • /
    • pp.943-966
    • /
    • 2023
  • In this paper, we study the initial-boundary value problem for viscoelastic wave equations of Kirchhoff type with Balakrishnan-Taylor damping terms in the presence of the infinite memory and external time-varying delay. For a certain class of relaxation functions and certain initial data, we prove that the decay rate of the solution energy is similar to that of relaxation function which is not necessarily of exponential or polynomial type. Also, we show another stability with g satisfying some general growth at infinity.

Dynamic Algorithm for Solid Problems using MLS Difference Method (MLS 차분법을 이용한 고체역학 문제의 동적해석)

  • Yoon, Young-Cheol;Kim, Kyeong-Hwan;Lee, Sang-Ho
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.25 no.2
    • /
    • pp.139-148
    • /
    • 2012
  • The MLS(Moving Least Squares) Difference Method is a numerical scheme that combines the MLS method of Meshfree method and Taylor expansion involving not numerical quadrature or mesh structure but only nodes. This paper presents an dynamic algorithm of MLS difference method for solving transient solid mechanics problems. The developed algorithm performs time integration by using Newmark method and directly discretizes strong forms. It is very convenient to increase the order of Taylor polynomial because derivative approximations are obtained by the Taylor series expanded by MLS method without real differentiation. The accuracy and efficiency of the dynamic algorithm are verified through numerical experiments. Numerical results converge very well to the closed-form solutions and show less oscillation and periodic error than FEM(Finite Element Method).