• Journal of Electrical Engineering and Technology
• /
• v.13 no.4
• /
• pp.1724-1731
• /
• 2018

The conventional polynomial neural network (PNN) is a classical flexible neural structure and self-organizing network, however it is not free from the limitation of overfitting problem. In this study, we propose a space search-optimized polynomial neural network (ssPNN) structure to alleviate this problem. Ranking selection is realized by means of ranking selection-based performance index (RS_PI) which is combined with conventional performance index (PI) and coefficients based performance index (CPI) (viz. the sum of squared coefficient). Unlike the conventional PNN, L2-norm regularization method for estimating the polynomial coefficients is also used when designing the ssPNN. Furthermore, space search optimization (SSO) is exploited here to optimize the parameters of ssPNN (viz. the number of input variables, which variables will be selected as input variables, and the type of polynomial). Experimental results show that the proposed ranking selection-based polynomial neural network gives rise to better performance in comparison with the neuron fuzzy models reported in the literatures.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.751-753
• /
• 1996

The $H_{2}$/$H_{\infty}$ robust controller is designed by using polynomial approach. This controller can minimise a $H_{2}$ norm of error under the fixed bound of $H_{\infty}$ norm of mixed sensitivity function by employing the Youla parameterization and using polynomial approach at the same time. It is easy to apply this controller to adaptive system.

• Kyungpook Mathematical Journal
• /
• v.48 no.3
• /
• pp.387-393
• /
• 2008

In this note, we present some inequalities for the norm and numerical radius of 2-homogeneous polynomials from the 2-dimensional real space $l_p^2$, (1 < p < $\infty$) to itself in terms of their coefficients. We also give an upper bound for n^{(k)}(l_p^2), (k = 2, 3, $\cdots$).

• Honam Mathematical Journal
• /
• v.42 no.3
• /
• pp.569-576
• /
• 2020

An element x ∈ E is called a norming point of P ∈ P(ⁿE) if ║x║ = 1 and |P(x)| = ║P║. For P ∈ P(ⁿE), we define Norm(P) = {x ∈ E : x is a norming point of P}. Norm(P) is called the norming set of P. We classify Norm(P) for P ∈ 𝒫(²𝑙²_∞).

• Journal of the Chungcheong Mathematical Society
• /
• v.24 no.4
• /
• pp.713-724
• /
• 2011

We investigate the irreducibility of iterate and composite polynomials. For this purpose discriminant and resultant are computed by means of the norm function.

• Journal of applied mathematics & informatics
• /
• v.13 no.1_2
• /
• pp.195-200
• /
• 2003

Given a positive integer q, the ratio of the 2q-norm of a polynomial which its coefficients form a binary sequence and its 2-norm arose from telecommunication engineering consists of finding any type of such polynomials haying the ratio “small” In this paper we consider some special types of these polynomials, discuss the sharpest possible upper bound, and prove a result for the ratio.

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.3
• /
• pp.731-751
• /
• 2023

If p(z) is a polynomial of degree n having all its zeros in |z| ≤ k, k ≥ 1, then for any complex number α with |α| ≥ k, and r ≥ 1, Aziz [1] proved $$\left{{\int}_{0}^{2{\pi}}\,{\left|1+k^ne^{i{\theta}}\right|^r}\,d{\theta}\right}^{\frac{1}{r}}\;{\max\limits_{{\mid}z{\mid}=1}}\,{\mid}p^{\prime}(z){\mid}\,{\geq}\,n\,\left{{\int}_{0}^{2{\pi}}\,{\left|p(e^{i{\theta}})\right|^r\,d{\theta}\right}^{\frac{1}{r}}.$$ In this paper, we obtain an improved extension of the above inequality into polar derivative. Further, we also extend an inequality on polar derivative recently proved by Rather et al. [20] into L^r-norm. Our results not only extend some known polynomial inequalities, but also reduce to some interesting results as particular cases.

• Korean Journal of Mathematics
• /
• v.18 no.1
• /
• pp.63-77
• /
• 2010

Infinite finite range inequalities relate the norm of a weighted polynomial over ${\mathbb{R}}$ to its norm over a finite interval. In this paper we extend such inequalities to generalized polynomials with the weight $W(x)={\prod}^{m}_{k=1}{\mid}x-x_k{\mid}^{{\gamma}_k}{\cdot}{\exp}(-{\mid}x{\mid}^{\alpha})$.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.9 no.2
• /
• pp.99-106
• /
• 2005

We present a relation between the orthogonality of the constrained Legendre polynomials over the triangular domain and the BB ($B{\acute{e}zier}\;-Bernstein$) coefficients of the polynomials using the equivalence of orthogonal complements. Using it we also show that the best constrained degree reduction of polynomials in BB form equals the best approximation of weighted Euclidean norm of coefficients of given polynomial in BB form from the coefficients of polynomials of lower degree in BB form.

• Korean Journal of Mathematics
• /
• v.23 no.3
• /
• pp.379-391
• /
• 2015

We investigate the existence of solutions of the nonlinear biharmonic equation with variable coefficient polynomial growth nonlinear term and Dirichlet boundary condition. We get a theorem which shows that there exists a bounded solution and a large norm solution depending on the variable coefficient. We obtain this result by variational method, generalized mountain pass geometry and critical point theory.