• 대한수학회보
• /
• 제50권5호
• /
• pp.1471-1479
• /
• 2013

In this paper, we study the non-existence of finite order entire solutions of nonlinear differential-difference of the form $$f^n+Q(z,f)=h$$, where $n{\geq}2$ is an integer, $Q(z,f)$ is a differential-difference polynomial in $f$ with polynomial coefficients, and $h$ is a meromorphic function of order ${\leq}1$.

• 한국통신학회논문지
• /
• 제21권1호
• /
• pp.251-268
• /
• 1996

In this paper, a higher-order feedforward neural network called ridge polynomial network (RPN) which shows good approximation capability for nonlnear continuous functions defined on compact subsets in multi-dimensional Euclidean spaces, is presented. This network provides more efficient and regular structure as compared to ordinary higher-order feedforward networks based on Gabor-Kolmogrov polynomial expansions, while maintating their fast learning property. the ridge polynomial network is a generalization of the pi-sigma network (PSN) and uses a specialform of ridge polynomials. It is shown that any multivariate polynomial can be exactly represented in this form, and thus realized by a RPN. The approximation capability of the RPNs for arbitrary continuous functions is shown by this representation theorem and the classical weierstrass polynomial approximation theorem. The RPN provides a natural mechanism for incremental function approximation based on learning algorithm of the PSN. Simulation results on several applications such as multivariate function approximation and pattern classification assert nonlinear approximation capability of the RPN.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.597-600
• /
• 1997

In this paper, the authors propose a new method for linearizing a nonlinear dynamical system by use of polynomial compensation. In this method, an M-sequence is applied to the nonlinear system and the crosscorrelation function between the input and the output gives us every crosssections of Volterra kernels of the nonlinear system up to 3rd order. We construct a polynomial compensation function from comparison between lst order Volterra kernel and high order kernels. The polynomial compensation function is, in this case, of third order whose coefficients are variable depending on the amplitude of the input signal. Once we can get compensation function of nonlinear system, we can construct a linearization scheme of the nonlinear system. That is. the effect of second and third order Volterra kernels are subtracted from the output, thus we obtain a sort of linearized output. The authors applied this method to a saturation-type nonlinear system by simulation, and the results show good agreement with the theoretical considerations.

• 대한전자공학회논문지
• /
• 제24권6호
• /
• pp.948-955
• /
• 1987

The model reduction method of the high order linear time invariant systems is proposed. The continuous fraction expansion of Auxiliary denominator polynomial is used to obtain denominator polynomial of the reduced order model, and the numerator polynomial of the reduced order model is obtained by equating the first some moments of the original and the reduced order model, using simplified moment function. This methiod does not require the calculation of the reciprocal transformation which should be calculated in Routh approximation, furthemore the stability of the reduced order model is guaranted if original system is stable. Responses of this method showed us good characteristics.

• Journal of applied mathematics & informatics
• /
• 제41권2호
• /
• pp.247-263
• /
• 2023

In this article, we investigate the uniqueness problem of q-shift difference polynomial of meromorphic (entire) function with zero-order. Consequently, we prove three results with significantly generalize the results of Goutam Haldar.

• 한국통신학회논문지
• /
• 제30권6C호
• /
• pp.577-584
• /
• 2005

본 연구는 협대역 통신시스템을 위한 전처리기-등화기 구조의 여파기에서, 곱셈기를 사용하지 않는 최소 복잡도의 디지털 FIR 여파기를 설계하는 방법을 제안한다. 제안하는 여파기는 순환 다항식(cyclotomic polynomial, CP) 여파기와 2차 내삽 다항식(interpolated second order polynomial, ISOP) 등화기로 구성되며, 이 두 여파기가 동시에 혼합 정수 선형 계획법(mixed integer linear programming (MILP))으로 최적 설계되어 최소의 복잡도를 갖는 특성을 갖게 된다. 제안된 방식으로 설계된 여파기들은, 설계 규격을 만족하면서도 기존의 여파기에 비하여 복잡도면에서 월등히 간단함을 확인하였다.

• 대한전자공학회논문지SP
• /
• 제42권4호
• /
• pp.143-152
• /
• 2005

본 연구는 협대역 응용 시스템을 위한 전처리기-등화기 구조의 여파기에서, 최소의 복잡도를 갖는 곱셈기 없는 디지털 IIR 여파기의 설계 방식을 제안한다. 제안하는 여파기는 순환 다항식 (cyclotomic polynomial (CP)) 여파기와 1차 내삽 다항식(interpolated second order polynomial (EOP))을 근간으로 하는 al1-pole 등화기로 구성 되며, 이 두 여파기가 동시에 혼합 정수 선형계획법(miked integer linear programming (MILP))으로 최적 설계된다. 설계된 여파기는 최소의 복잡도를 갖는 특성을 가지고 있다. 뿐만 아니라, 이 MILP 방식은 계산 복잡도와 위상 응답의 비선형 특성을 모두 최소화하도록 설계한다. 설계 예제를 통하여 제안된 설계 방식으로 설계된 여파기는 구현 요구사항을 만족하면서 기존의 설계 방식에 비하여 복잡도면에서 월등히 우수한 특성을 보임을 확인하였다.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권1호
• /
• pp.40-49
• /
• 2004

In this paper, we propose a new architecture of Genetic Algorithms(GAs)-based Self-Organizing Polynomial Neural Networks(SOPNN), discuss a comprehensive design methodology and carry out a series of numeric experiments. The conventional SOPNN is based on the extended Group Method of Data Handling(GMDH) method and utilized the polynomial order (viz. linear, quadratic, and modified quadratic) as well as the number of node inputs fixed (selected in advance by designer) at Polynomial Neurons (or nodes) located in each layer through a growth process of the network. Moreover it does not guarantee that the SOPNN generated through learning has the optimal network architecture. But the proposed GA-based SOPNN enable the architecture to be a structurally more optimized network, and to be much more flexible and preferable neural network than the conventional SOPNN. In order to generate the structurally optimized SOPNN, GA-based design procedure at each stage (layer) of SOPNN leads to the selection of preferred nodes (or PNs) with optimal parameters- such as the number of input variables, input variables, and the order of the polynomial-available within SOPNN. An aggregate performance index with a weighting factor is proposed in order to achieve a sound balance between approximation and generalization (predictive) abilities of the model. A detailed design procedure is discussed in detail. To evaluate the performance of the GA-based SOPNN, the model is experimented with using two time series data (gas furnace and NOx emission process data of gas turbine power plant). A comparative analysis shows that the proposed GA-based SOPNN is model with higher accuracy as well as more superb predictive capability than other intelligent models presented previously.

• Journal of applied mathematics & informatics
• /
• 제36권3_4호
• /
• pp.231-236
• /
• 2018

A polynomial, $p(z)=a_0z^n+a_1z^{n-1}+{\cdots}+a_{n-1}z+a_n$, with real coefficients is called a stable or a Hurwitz polynomial if all its zeros have negative real parts. We show that if a polynomial is a Hurwitz polynomial then so is the polynomial $q(z)=a_nz^n+a_{n-1}z^{n-1}+{\cdots}+a_1z+a_0$ (with coefficients in reversed order). As consequences, we give simple ratio checking inequalities that would determine unstability of a polynomial of degree 5 or more and extend conditions to get some previously known results.

• 대한수학회보
• /
• 제58권4호
• /
• pp.865-876
• /
• 2021

Let 𝔽 be a commutative ring. A restricted skew polynomial extension over 𝔽 is a class of iterated skew polynomial 𝔽-algebras which include well-known quantized algebras such as the quantum algebra U_q(𝔰𝔩₂), Weyl algebra, etc. Here we obtain a necessary and sufficient condition in order to be restricted skew polynomial extensions over 𝔽. We also introduce a restricted Poisson polynomial extension which is a class of iterated Poisson polynomial algebras and observe that a restricted Poisson polynomial extension appears as semiclassical limits of restricted skew polynomial extensions. Moreover, we obtain usual as well as unusual quantized algebras of the same Poisson algebra as applications.