• Title/Summary/Keyword: algebraic polynomials

Search Result 78, Processing Time 0.031 seconds

A STUDY OF SIMULTANEOUS APPROXIMATION BY NEURAL NETWORKS

  • Hahm, N.;Hong, B.I.
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.1_2
    • /
    • pp.317-324
    • /
    • 2008
  • This paper shows the degree of simultaneous neural network approximation for a target function in $C^r$[-1, 1] and its first derivative. We use the Jackson's theorem for differentiable functions to get a degree of approximation to a target function by algebraic polynomials and trigonometric polynomials. We also make use of the de La Vall$\grave{e}$e Poussin sum to get an approximation order by algebraic polynomials to the derivative of a target function. By showing that the divided difference with a generalized translation network can be arbitrarily closed to algebraic polynomials on [-1, 1], we obtain the degree of simultaneous approximation.

  • PDF

다항식의 대수적 표현

  • 홍영희
    • Journal for History of Mathematics
    • /
    • v.16 no.4
    • /
    • pp.15-32
    • /
    • 2003
  • Since algebra before the 19th century was the study of equations and equations are not differentiated from polynomials because of lack of the equality sign, the algebraic symbolism of polynomials plays very important role for tile history of algebra. We deal with the evolution of literal notations of polynomials in western and eastern worlds, and then compare their history.

  • PDF

An Effective Method in Analyzing a Class of Bilinear Systems via Taylor Polynomials (Taylor 다형식에 의한 양선형 시스템의 효과적인 해석법)

  • ;Zeung Nam Bien
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.25 no.12
    • /
    • pp.1594-1600
    • /
    • 1988
  • In this paper, an effective method in analyzing a class of bilinear systems via Taylor polynomials is proposed. The result derived by Yang and Chen shows an implicit form for unknown state vector and requires to solve a linear algebraic equation with large dimension when the number of terms used increase. In comparison to the result of Yang and Chen, the method in this paper gives a closed form for unknown state vector and does not need to solve any linear algebraic equation.

  • PDF

A New Aspect of Comrade Matrices by Reachability Matrices

  • Solary, Maryam Shams
    • Kyungpook Mathematical Journal
    • /
    • v.59 no.3
    • /
    • pp.505-513
    • /
    • 2019
  • In this paper, we study orthanogonal polynomials by looking at their comrade matrices and reachability matrices. First, we focus on the algebraic structure that is exhibited by comrade matrices. Then, we explain some properties of this algebraic structure which helps us to find a connection between comrade matrices and reachability matrices. In the last section, we use this connection to determine the determinant, eigenvalues, and eigenvectors of these matrices. Finally, we derive a factorization for det R(A, x), where R(A, x) is the reachability matrix for a comrade matrix A and x is a vector of indeterminates.

REAL ROOT ISOLATION OF ZERO-DIMENSIONAL PIECEWISE ALGEBRAIC VARIETY

  • Wu, Jin-Ming;Zhang, Xiao-Lei
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.1_2
    • /
    • pp.135-143
    • /
    • 2011
  • As a zero set of some multivariate splines, the piecewise algebraic variety is a kind of generalization of the classical algebraic variety. This paper presents an algorithm for isolating real roots of the zero-dimensional piecewise algebraic variety which is based on interval evaluation and the interval zeros of univariate interval polynomials in Bernstein form. An example is provided to show the proposed algorithm is effective.

RESULTANT AND DISCRIMINANT OF ITERATE POLYNOMIALS

  • Choi, Eun-Mi
    • Honam Mathematical Journal
    • /
    • v.32 no.3
    • /
    • pp.493-514
    • /
    • 2010
  • The resultant and discriminant of composite polynomials were studied by McKay and Wang using some algebraic properties. In this paper we study the resultant and discriminant of iterate polynomials. We shall use elementary computations of matrices and block matrix determinants; this could provide not only the values but also the visual structure of resultant and discriminant from elementary matrix calculation.

ABSOLUTE IRREDUCIBILITY OF BIVARIATE POLYNOMIALS VIA POLYTOPE METHOD

  • Koyuncu, Fatih
    • Journal of the Korean Mathematical Society
    • /
    • v.48 no.5
    • /
    • pp.1065-1081
    • /
    • 2011
  • For any field F, a polynomial f $\in$ F[$x_1,x_2,{\ldots},x_k$] can be associated with a polytope, called its Newton polytope. If the polynomial f has integrally indecomposable Newton polytope, in the sense of Minkowski sum, then it is absolutely irreducible over F, i.e., irreducible over every algebraic extension of F. We present some results giving new integrally indecomposable classes of polygons. Consequently, we have some criteria giving many types of absolutely irreducible bivariate polynomials over arbitrary fields.