• 제목/요약/키워드: Polynomial equation

검색결과 404건 처리시간 0.024초

GMDH 알고리즘과 다항식 퍼지추론에 기초한 퍼지 다항식 뉴럴 네트워크 (Fuzzy Polynomial Neural Networks based on GMDH algorithm and Polynomial Fuzzy Inference)

  • 박호성;윤기찬;오성권
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2000년도 춘계학술대회 학술발표 논문집
    • /
    • pp.130-133
    • /
    • 2000
  • In this paper, a new design methodology named FNNN(Fuzzy Polynomial Neural Network) algorithm is proposed to identify the structure and parameters of fuzzy model using PNN(Polynomial Neural Network) structure and a fuzzy inference method. The PNN is the extended structure of the GMDH(Group Method of Data Handling), and uses several types of polynomials such as linear, quadratic and modified quadratic besides the biquadratic polynomial used in the GMDH. The premise of fuzzy inference rules defines by triangular and gaussian type membership function. The fuzzy inference method uses simplified and regression polynomial inference method which is based on the consequence of fuzzy rule expressed with a polynomial such as linear, quadratic and modified quadratic equation are used. Each node of the FPNN is defined as fuzzy rules and its structure is a kind of neuro-fuzzy architecture Several numerical example are used to evaluate the performance of out proposed model. Also we used the training data and testing data set to obtain a balance between the approximation and generalization of proposed model.

  • PDF

한계상태식의 3차 다항식 근사를 통한 구조물 신뢰도 평가 (Structure Reliability Analysis using 3rd Order Polynomials Approximation of a Limit State Equation)

  • 이승규;김성찬;김태욱
    • 한국전산구조공학회논문집
    • /
    • 제26권3호
    • /
    • pp.183-189
    • /
    • 2013
  • 본 논문에서는 불확실성을 확률변수로 가정하고 구조물의 파손기준을 한계상태식(Limit State Equation)으로 정의하였다. 한계상태식을 Fleishman의 3차 다항식으로 근사하고 이론적인 확률 모멘트(Moments)를 계산하였다. Fleishman은 표준정규 분포 확률변수에 대해서만 3차 다항식을 제시하였으나, 본 논문에서는 이를 확장하여 베타, 감마, 균일 분포 등 다양한 확률 변수에 적용하였다. 확률 모멘트를 계산하기 위해서 누률(Cumulants)과 정규화된 한계상태식을 활용하였으며, 피어슨 시스템(Pearson System)을 통해 한계상태식의 확률분포를 근사하였다.

STABILITY OF ZEROS OF POWER SERIES EQUATIONS

  • Wang, Zhihua;Dong, Xiuming;Rassias, Themistocles M.;Jung, Soon-Mo
    • 대한수학회보
    • /
    • 제51권1호
    • /
    • pp.77-82
    • /
    • 2014
  • We prove that if ${\mid}a_1{\mid}$ is large and ${\mid}a_0{\mid}$ is small enough, then every approximate zero of power series equation ${\sum}^{\infty}_{n=0}a_nx^n$=0 can be approximated by a true zero within a good error bound. Further, we obtain Hyers-Ulam stability of zeros of the polynomial equation of degree n, $a_nz^n$ + $a_{n-1}z^{n-1}$ + ${\cdots}$ + $a_1z$ + $a_0$ = 0 for a given integer n > 1.

CLASSIFICATION OF CLASSICAL ORTHOGONAL POLYNOMIALS

  • Kwon, Kil-H.;Lance L.Littlejohn
    • 대한수학회지
    • /
    • 제34권4호
    • /
    • pp.973-1008
    • /
    • 1997
  • We reconsider the problem of calssifying all classical orthogonal polynomial sequences which are solutions to a second-order differential equation of the form $$ \ell_2(x)y"(x) + \ell_1(x)y'(x) = \lambda_n y(x). $$ We first obtain new (algebraic) necessary and sufficient conditions on the coefficients $\ell_1(x)$ and $\ell_2(x)$ for the above differential equation to have orthogonal polynomial solutions. Using this result, we then obtain a complete classification of all classical orthogonal polynomials : up to a real linear change of variable, there are the six distinct orthogonal polynomial sets of Jacobi, Bessel, Laguerre, Hermite, twisted Hermite, and twisted Jacobi.cobi.

  • PDF

반응표면분석법에 의한 늙은 호박 추출조건의 모니터링 (Monitoring on Extraction Conditions of Old Pumpkin Using Response Surface Methodology)

  • 정용진
    • 한국식품영양과학회지
    • /
    • 제30권3호
    • /
    • pp.466-470
    • /
    • 2001
  • Response surface methodology was used for monitoring extraction conditions, based on quality properties of old pumpkin extracts. Hunter's color L value of extracts was maximized at 101℃, 2.6 hr and decreased gradually after maximum point. The polynomial equation for Hunter's color L value showed 10% of significance level and 0.8799 of R². Hunter's color a value was minimized at 117℃, 3.9 hr and R² of polynomial equation was 0.9852 within 1% significance level. Hunter's color b value and ΔE value increased as the extracting temperature and time increased. Extraction yield of old pumpkin was maximized at 110℃, 4 hr and increased in proportional to the extracting temperature and time, but decreased after 113℃ and 2 hr. Viscosity of pumpkin extracts were maximized at 120℃, nearly 3 hr. R² of polynomial equations for yield, viscosity and sugar content were 0.9532, 0.9812 and 0.8869, respectively. Optimum ranges of extraction conditions for quality properties of old pumpkin were 102∼109℃, 2.5∼3.5 hr, respectively. Predicted values at the optimum extraction condition agreed with experimental values.

  • PDF

CURVED DOMAIN APPROXIMATION IN DIRICHLET'S PROBLEM

  • Lee, Mi-Young;Choo, Sang-Mok;Chung, Sang-Kwon
    • 대한수학회지
    • /
    • 제40권6호
    • /
    • pp.1075-1083
    • /
    • 2003
  • The purpose of this paper is to investigate the piecewise wise polynomial approximation for the curved boundary. We analyze the error of an approximated solution due to this approximation and then compare the approximation errors for the cases of polygonal and piecewise polynomial approximations for the curved boundary. Based on the results of analysis, p-version numerical methods for solving Dirichlet's problems are applied to any smooth curved domain.

ALGORITHMS FOR SOLVING MATRIX POLYNOMIAL EQUATIONS OF SPECIAL FORM

  • Dulov, E.V.
    • Journal of applied mathematics & informatics
    • /
    • 제7권1호
    • /
    • pp.41-60
    • /
    • 2000
  • In this paper we consider a series of algorithms for calculating radicals of matrix polynomial equations. A particular aspect of this problem arise in author's work. concerning parameter identification of linear dynamic stochastic system. Special attention is given of searching the solution of an equation in a neighbourhood of some initial approximation. The offered approaches and algorithms allow us to receive fast and quite exact solution. We give some recommendations for application of given algorithms.

COMPOSITION OF BINOMIAL POLYNOMIAL

  • Choi, Eun-Mi
    • 대한수학회논문집
    • /
    • 제22권2호
    • /
    • pp.183-194
    • /
    • 2007
  • For an irreducible binomial polynomial $f(x)=x^n-b{\in}K[x]$ with a field K, we ask when does the mth iteration $f_m$ is irreducible but $m+1th\;f_{m+1}$ is reducible over K. Let S(n, m) be the set of b's such that $f_m$ is irreducible but $f_{m+1}$ is reducible over K. We investigate the set S(n, m) by taking K as the rational number field.

실험계획법과 콤플렉스법에 의한 고성능 유압휴즈의 최적 설계 (Optimal Design of A Quick-Acting Hydraulic Fuse Using Design of Experiments and Complex Method)

  • 이성래
    • 드라이브 ㆍ 컨트롤
    • /
    • 제12권4호
    • /
    • pp.8-14
    • /
    • 2015
  • A quick-acting hydraulic fuse, which is mainly composed of a poppet, a seat, and a spring, must be designed to minimize the leaked oil volume during fuse operation on a line rupture. The optimal design parameters of a quick-acting hydraulic fuse were searched using the design of experiments method and the complex method. First, the $L_{50}(5^4)$ orthogonal array is used to find the robust minimum point among the 625 points of design variables. The search range can then be narrowed around the robust minimum point. Second, the $L_{25}(5^4)$ orthogonal array is used to obtain the variations of the design variables in the narrowed search range. The variations of design variables are used to set the structure of a polynomial equation representing the leakage oil volume of the quick-acting hydraulic fuse. The least squares method is then applied to obtain the coefficients of polynomial equation. Finally, the complex method is used to find the optimal design parameters where the objective function is described by the polynomial equation.

DIVIDED DIFFERENCES AND POLYNOMIAL CONVERGENCES

  • PARK, SUK BONG;YOON, GANG JOON;LEE, SEOK-MIN
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제20권1호
    • /
    • pp.1-15
    • /
    • 2016
  • The continuous analysis, such as smoothness and uniform convergence, for polynomials and polynomial-like functions using differential operators have been studied considerably, parallel to the study of discrete analysis for these functions, using difference operators. In this work, for the difference operator ${\nabla}_h$ with size h > 0, we verify that for an integer $m{\geq}0$ and a strictly decreasing sequence $h_n$ converging to zero, a continuous function f(x) satisfying $${\nabla}_{h_n}^{m+1}f(kh_n)=0,\text{ for every }n{\geq}1\text{ and }k{\in}{\mathbb{Z}}$$, turns to be a polynomial of degree ${\leq}m$. The proof used the polynomial convergence, and additionally, we investigated several conditions on convergence to polynomials.