• Title/Summary/Keyword: polynomial functions

Search Result 455, Processing Time 0.023 seconds

Comparison of Interpolation Methods for Reconstructing Pin-wise Power Distribution in Hexagonal Geometry

  • Lee, Hyung-Seok;Yang, Won-Sik
    • Nuclear Engineering and Technology
    • /
    • v.31 no.3
    • /
    • pp.303-313
    • /
    • 1999
  • Various interpolation methods have been compared for reconstruction of LMR pin power distributions in hexagonal geometry. Interpolation functions are derived for several combinations of nodal quantities and various sets of basis functions, and tested against fine mesh calculations. The test results indicate that the interpolation functions based on the sixth degree polynomial are quite accurate, yielding maximum interpolation errors in power densities less than 0.5%, and maximum reconstruction errors less than 2% for driver assemblies and less than 4% for blanket assemblies. The main contribution to the total reconstruction error is made tv the nodal solution errors and the comer point flux errors. For the polynomial interpolations, the basis monomial set needs to be selected such that the highest powers of x and y are as close as possible. It is also found that polynomials higher than the seventh degree are not adequate because of the oscillatory behavior.

  • PDF

MEROMORPHIC FUNCTIONS SHARING A NONZERO POLYNOMIAL CM

  • Li, Xiao-Min;Gao, Ling
    • Bulletin of the Korean Mathematical Society
    • /
    • v.47 no.2
    • /
    • pp.319-339
    • /
    • 2010
  • In this paper, we prove that if $f^nf'\;-\;P$ and $g^ng'\;-\;P$ share 0 CM, where f and g are two distinct transcendental meromorphic functions, $n\;{\geq}\;11$ is a positive integer, and P is a nonzero polynomial such that its degree ${\gamma}p\;{\leq}\;11$, then either $f\;=\;c_1e^{cQ}$ and $g\;=\;c_2e^{-cQ}$, where $c_1$, $c_2$ and c are three nonzero complex numbers satisfying $(c_1c_2)^{n+1}c^2\;=\;-1$, Q is a polynomial such that $Q\;=\;\int_o^z\;P(\eta)d{\eta}$, or f = tg for a complex number t such that $t^{n+1}\;=\;1$. The results in this paper improve those given by M. L. Fang and H. L. Qiu, C. C. Yang and X. H. Hua, and other authors.

A Free Vibration Analysis of Sound-Structure Interaction Plate (구조-음향 연성평판의 자유진동해석)

  • Lee, Dong-Ick;O, Jae-Eung
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.20 no.8
    • /
    • pp.2546-2554
    • /
    • 1996
  • In order to investigate the characteristics of sound-structure interaction problems, we modeled a rectangular cavity and the flexible wall of the cavity. Because the governing equations of motion are coupled through velocity terms, we could redefine them using the velocity potential. We calculated the natural frequencies of plate using orthogonal polynomial functions which satisfy the boundary conditions in the Rayleigh-Ritz Method. As the result, comparisons of theory and experiment show good agreement. and using orthogonal polynomial functions which satisfy the boundary conditions in the Rayleigh-Ritz method show useful method for sound-structure interaction problems too.

Investigation of the Effects of Some Numerical Procedure on the High Precision Structural Analysis (초정밀 구조해석을 위한 수치절차의 영향 분석)

  • Jung, Kang-Sik;You, Hong-Hee
    • Proceedings of the KSME Conference
    • /
    • 2004.04a
    • /
    • pp.756-761
    • /
    • 2004
  • The effects of two important numerical procedures on the high precision structural analysis are investigated in this study. The two numerical procedures include continuous variable approximation and time integration. For the continuous variable approximation, polynomial mode functions generated by the Gram-Schmidt process are introduced and the numerical results obtained by employing the polynomial mode functions are compared to those obtained by classical beam mode functions. The effect of the time integration procedure on the analysis precision is also investigated. It is found that the two procedures affect the precision of structural analysis significantly.

  • PDF

Shape Reconstruction from Unorganized Cloud of Points using Adaptive Domain Decomposition Method (적응적 영역분할법을 이용한 임의의 점군으로부터의 형상 재구성)

  • Yoo Dong-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.23 no.8 s.185
    • /
    • pp.89-99
    • /
    • 2006
  • In this paper a new shape reconstruction method that allows us to construct surface models from very large sets of points is presented. In this method the global domain of interest is divided into smaller domains where the problem can be solved locally. These local solutions of subdivided domains are blended together according to weighting coefficients to obtain a global solution using partition of unity function. The suggested approach gives us considerable flexibility in the choice of local shape functions which depend on the local shape complexity and desired accuracy. At each domain, a quadratic polynomial function is created that fits the points in the domain. If the approximation is not accurate enough, other higher order functions including cubic polynomial function and RBF(Radial Basis Function) are used. This adaptive selection of local shape functions offers robust and efficient solution to a great variety of shape reconstruction problems.

DIFFERENTIAL EQUATIONS RELATED TO FAMILY A

  • Li, Ping;Meng, Yong
    • Bulletin of the Korean Mathematical Society
    • /
    • v.48 no.2
    • /
    • pp.247-260
    • /
    • 2011
  • Let h be a meromorphic function with few poles and zeros. By Nevanlinna's value distribution theory we prove some new properties on the polynomials in h with the coefficients being small functions of h. We prove that if f is a meromorphic function and if $f^m$ is identically a polynomial in h with the constant term not vanish identically, then f is a polynomial in h. As an application, we are able to find the entire solutions of the differential equation of the type $$f^n+P(f)=be^{sz}+Q(e^z)$$, where P(f) is a differential polynomial in f of degree at most n-1, and Q($e^z$) is a polynomial in $e^z$ of degree k $\leqslant$ max {n-1, s(n-1)/n} with small functions of $e^z$ as its coefficients.

Genetically Optimized Self-Organizing Fuzzy Polynomial Neural Networks based on Information Granulation and Evolutionary Algorithm

  • Park Ho-Sung;Oh Sung-Kwun
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2005.04a
    • /
    • pp.297-300
    • /
    • 2005
  • In this study, we proposed genetically optimized self-organizing fuzzy polynomial neural network based on information granulation and evolutionary algorithm (gdSOFPNN), develop a comprehensive design methodology involving mechanisms of genetic optimization. The proposed gdSOFPNN gives rise to a structural Iy and parametrically optimized network through an optimal parameters design available within FPN (viz. the number of input variables, the order of the polynomial, input variables, the number of membership functions, and the apexes of membership function). Here, with the aid of the information granulation, we determine the initial location (apexes) of membership functions and initial values of polynomial function being used in the premised and consequence part of the fuzzy rules respectively. The performance of the proposed gdSOFPNN is quantified through experimentation that exploits standard data already used in fuzzy modeling.

  • PDF

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

Bridge deflection evaluation using strain and rotation measurements

  • Sousa, Helder;Cavadas, Filipe;Henriques, Abel;Bento, Joao;Figueiras, Joaquim
    • Smart Structures and Systems
    • /
    • v.11 no.4
    • /
    • pp.365-386
    • /
    • 2013
  • Monitoring systems currently applied to concrete bridges include strain gauges, inclinometers, accelerometers and displacement transducers. In general, vertical displacements are one of the parameters that more often need to be assessed because their information reflects the overall response of the bridge span. However, the implementation of systems to continuously and directly observe vertical displacements is known to be difficult. On the other hand, strain gauges and inclinometers are easier to install, but their measurements provide no more than indirect information regarding the bridge deflection. In this context, taking advantage of the information collected through strain gauges and inclinometers, and the processing capabilities of current computers, a procedure to evaluate bridge girder deflections based on polynomial functions is presented. The procedure has been implemented in an existing software system - MENSUSMONITOR -, improving the flexibility in the data handling and enabling faster data processing by means of real time visualization capabilities. Benefiting from these features, a comprehensive analysis aiming at assessing the suitability of polynomial functions as an approximate solution for deflection curves, is presented. The effect of boundary conditions and the influence of the order of the polynomial functions on the accuracy of results are discussed. Some recommendations for further instrumentation plans are provided based on the results of the present analysis. This work is supported throughout by monitoring data collected from a laboratory beam model and two full-scale bridges.