• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.10
• /
• pp.1166-1172
• /
• 1988

This paper presents an efficient method of analyzing linear time-varying systems via Taylor polynomials. While the approach suggested by Sparis and Mouroutsos gives an implicit form for unknown state vector and requires to solve a linear algebraic equation with large dimension when the number of terms increases, the method proposed in this paper shows an explicit form and has no need to solve any linear algebraic equation.

• 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.

• School Mathematics
• /
• v.16 no.2
• /
• pp.317-334
• /
• 2014

The purpose of this study is to grasp pre-service secondary teachers' understanding-realities for Taylor series convergence conceptions and to examine a teaching way using GeoGebra based on the understanding-realities. In this study, most pre-service teachers have abilities to calculate the Taylor series and radius of convergence, but they are vulnerable to conceptual problems which give meaning of the equality between a given function and its Taylor series at any point. Also they have some weakness in determining the change of radius of convergence according to the change of Taylor series' center. To improve their weakness, we explore a teaching way using dynamic and CAS functionality of GeoGebra. This study is expected to improve the pedagogical content knowledge of pre-service secondary mathematics teachers for infinite series treated in high school mathematics.

• Journal of Korea Water Resources Association
• /
• v.33 no.1
• /
• pp.31-38
• /
• 2000

Relationships between hydrologic variables are often nonlinear. Usually the functional form of such a relationship is not known a priori. A multivariate, nonparametric regression methodology is provided here for approximating the underlying regression function using locally weighted polynomials. Locally weighted polynomials consider the approximation of the target function through a Taylor series expansion of the function in the neighborhood of the point of estimate. The utility of this nonparametric regression approach is demonstrated through an application to nonparametric short term forecasts of the biweekly Great Salt Lake volume.volume.

• 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.

• Journal of Information Technology Application
• /
• v.3 no.3
• /
• pp.25-40
• /
• 2001

This paper deals with the problem of generating optimal polynomials using Genetic Programming(GP). The polynomial should approximate nonlinear response surfaces. Also, there should be a consideration regarding the size of the polynomial, It is not desirable if the polynomial is too large. To build small or medium size of polynomials that enable to model nonlinear response surfaces, we use the low order Tailor series in the function set of GP, and put the constrain on generating GP tree during the evolving process in order to prevent GP trees from becoming too large size of polynomials. Also, GAGPT(Group of Additive Genetic Programming Trees) is adopted to help achieving such purpose. Two examples are given to demonstrate our method.

• 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).

• The Proceedings of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.2 no.4
• /
• pp.62-69
• /
• 1988

선형 시스템에 대한 Lyapunov 함수의 구성법은 잘 알려져 있으나, 비선형 시스템의 Lyapunov 함수 구성법은 아직 체계화되어 있지 못하다. 따라서, 본 논문에서는, 비선형 시스템의 안전도 해석을 위하여, 종래의 정상상태 부근에서 Taylor 전개에 의한 선형화 기법에 의존하지 않고, 비선형 시스템을 나타내는 상태공간의 활동성 모델로부터, 비선형성을 나타내는 항을 분리하여, 특수행렬변환시킴으로서, 선형 시스템의 Lyapunov 함수 구성법을 살린, 행렬다항식형 Lyapunov 함수를 구성하고, 이를 유도전동기의 안전도 해석에 적용시켰다. 그 결과, 구해진 안정영역은, 선형화에 의한 것보다는 훨씬 넓은 초공간으로 표현되는 유도전동기의 점근안정영역이 되었다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.11
• /
• pp.1220-1228
• /
• 2010

In this paper, we suggest a scheme to develop an efficient discrete nonlinear model based on polynomial structure for a RF power amplifier(PA). We describe a procedure to extract a discrete nonlinear model such as Taylor series or memory polynomial by sampling the input and output signal of RF PA. The performance of the model is analyzed varying the model parameters such as sample rate, nonlinear order, and memory depth. The results show that the relative error of the model is converged if the parameters are larger than specific values. We suggest an efficient modeling scheme considering complexity of the discrete model depending on the values of the model parameters. Modeling efficiency index(MEI) is defined, and it is used to extract optimum values for the model parameters. The suggested scheme is applied to discrete modeling of various RF PAs with various input signals such as WCDMA, WiBro, etc. The suggested scheme can be applied to the efficient design of digital predistorter for the wideband transmitter.

• 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.