• 제목/요약/키워드: characteristic polynomials

검색결과 76건 처리시간 0.025초

Free vibration analysis of rectangular plate with arbitrary edge constraints using characteristic orthogonal polynomials in assumed mode method

  • Kim, Kook-Hyun;Kim, Byung-Hee;Choi, Tae-Muk;Cho, Dae-Seung
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • 제4권3호
    • /
    • pp.267-280
    • /
    • 2012
  • An approximate method based on an assumed mode method has been presented for the free vibration analysis of a rectangular plate with arbitrary edge constraints. In the presented method, natural frequencies and their mode shapes of the plate are calculated by solving an eigenvalue problem of a multi-degree-of-freedom system matrix equation derived by using Lagrange's equations of motion. Characteristic orthogonal polynomials having the property of Timoshenko beam functions which satisfies edge constraints corresponding to those of the objective plate are used. In order to examine the accuracy of the proposed method, numerical examples of the rectangular plates with various thicknesses and edge constraints have been presented. The results have shown good agreement with those of other methods such as an analytic solution, an approximate solution, and a finite element analysis.

EVERY POLYNOMIAL OVER A FIELD CONTAINING 𝔽16 IS A STRICT SUM OF FOUR CUBES AND ONE EXPRESSION A2 + A

  • Gallardo, Luis H.
    • 대한수학회보
    • /
    • 제46권5호
    • /
    • pp.941-947
    • /
    • 2009
  • Let q be a power of 16. Every polynomial $P\in\mathbb{F}_q$[t] is a strict sum $P=A^2+A+B^3+C^3+D^3+E^3$. The values of A,B,C,D,E are effectively obtained from the coefficients of P. The proof uses the new result that every polynomial $Q\in\mathbb{F}_q$[t], satisfying the necessary condition that the constant term Q(0) has zero trace, has a strict and effective representation as: $Q=F^2+F+tG^2$. This improves for such q's and such Q's a result of Gallardo, Rahavandrainy, and Vaserstein that requires three polynomials F,G,H for the strict representation $Q=F^2$+F+GH. Observe that the latter representation may be considered as an analogue in characteristic 2 of the strict representation of a polynomial Q by three squares in odd characteristic.

90/150 그룹 CA의 특성다항식 분석 (Analysis of Characteristic Polynomials of 90/150 Group CA)

  • 조성진;김경자;최언숙;황윤희;김한두
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2006년도 춘계종합학술대회
    • /
    • pp.393-396
    • /
    • 2006
  • 본 논문에서는 전이규칙으로 90, 150 규칙만을 사용하는 90/150 셀룰라 오토마타의 특성다항식을 분석한다. 특히 최대길이를 갖는 90/150 CA를 합성하여 CA의 특성다항식이 원시다항식의 지수승 형태를 갖는 방법을 제안한다.

  • PDF

Stability analysis to generally structured robust control problems

  • Cho, K.H.;Lim, J.T.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1994년도 Proceedings of the Korea Automatic Control Conference, 9th (KACC) ; Taejeon, Korea; 17-20 Oct. 1994
    • /
    • pp.369-372
    • /
    • 1994
  • In this paper, the robust stability of characteristic polynomials with respect to real parameter variations is investigated through a new functional approach. Specifically there is no restriction on the interrelationship between coefficients of the polynomials. This allows one to treat the robust stability problems alike without distinction as to continuous or discrete time systems. Necessary condition and sufficient condition for the robust stability are shown and some examples extracted from two-link planar manipulator are provided.

  • PDF

A NOTE ON THE VALUE DISTRIBUTION OF DIFFERENTIAL POLYNOMIALS

  • Bhoosnurmath, Subhas S.;Chakraborty, Bikash;Srivastava, Hari M.
    • 대한수학회논문집
    • /
    • 제34권4호
    • /
    • pp.1145-1155
    • /
    • 2019
  • Let f be a transcendental meromorphic function, defined in the complex plane $\mathbb{C}$. In this paper, we give a quantitative estimations of the characteristic function T(r, f) in terms of the counting function of a homogeneous differential polynomial generated by f. Our result improves and generalizes some recent results.

스트림암호에서 원시다항식에 대한 고찰 (A Study on primitive polynomial in stream cipher)

  • 양정모
    • 융합보안논문지
    • /
    • 제18권4호
    • /
    • pp.27-33
    • /
    • 2018
  • 스트림 암호는 1회용 패드(one time pad)형 암호 알고리즘으로 랜덤한 비트(또는 문자)들의 열을 열쇠로 사용하여 평문과 XOR과 같은 간단한 연산을 통해 암호화하므로 알고리즘의 안전성은 사용되는 열쇠의 난수성에 의존한다. 그러므로 사용되는 열쇠에 대해 주기, 선형복잡도, 비선형도, 상관면역도 등의 수학적 분석을 통해 보다 안전한 암호시스템을 설계할 수 있는 장점이 있다. 스트림 암호에서의 암호화 열쇠는 고유다항식을 가지고 LFSR(linear feedback shift register)에서 열쇠이진 수열을 생성하여 사용한다. 이 고유다항식 중 비도가 가장 우수한 다항식이 바로 원시다항식이다. 원시다항식은 스트림 암호뿐만 아니라 8차 원시 다항식을 사용한 블록암호인 SEED암호, 그리고 24차 원시 다항식을 사용하여 설계한 공개열쇠암호인 CR(Chor-Rivest) 암호 등에서도 널리 이용되고 있다. 본 논문의 주요내용은 이러한 암호알고리즘을 연구하는데 사용되는 갈루아(Galois)체에서의 원시다항식에 대한 개념과 다양한 성질들을 고찰해 보고 소수 p의 값이 2이상인 경우 $F_p$에서의 기약다항식과 원시다항식의 개수를 구하는 정리를 증명해 보았다. 이러한 연구는 보다 비도가 높은 원시다항식을 찾아 새로운 암호알고리즘을 개발하는 기반 연구가 될 수 있다.

  • PDF

SIGNED A-POLYNOMIALS OF GRAPHS AND POINCARÉ POLYNOMIALS OF REAL TORIC MANIFOLDS

  • Seo, Seunghyun;Shin, Heesung
    • 대한수학회보
    • /
    • 제52권2호
    • /
    • pp.467-481
    • /
    • 2015
  • Choi and Park introduced an invariant of a finite simple graph, called signed a-number, arising from computing certain topological invariants of some specific kinds of real toric manifolds. They also found the signed a-numbers of path graphs, cycle graphs, complete graphs, and star graphs. We introduce a signed a-polynomial which is a generalization of the signed a-number and gives a-, b-, and c-numbers. The signed a-polynomial of a graph G is related to the $Poincar\acute{e}$ polynomial $P_{M(G)}(z)$, which is the generating function for the Betti numbers of the real toric manifold M(G). We give the generating functions for the signed a-polynomials of not only path graphs, cycle graphs, complete graphs, and star graphs, but also complete bipartite graphs and complete multipartite graphs. As a consequence, we find the Euler characteristic number and the Betti numbers of the real toric manifold M(G) for complete multipartite graphs G.

부등류조건에서 종확산방정식의 Eulerian-Lagrangian 모형 (Eulerian-Lagrangian Modeling of One-Dimensional Dispersion Equation in Nonuniform Flow)

  • 김대근;서일원
    • 한국환경과학회지
    • /
    • 제11권9호
    • /
    • pp.907-914
    • /
    • 2002
  • Various Eulerian-Lagrangian models for the one-dimensional longitudinal dispersion equation in nonuniform flow were studied comparatively. In the models studied, the transport equation was decoupled into two component parts by the operator-splitting approach; one part is governing advection and the other is governing dispersion. The advection equation has been solved by using the method of characteristics following fluid particles along the characteristic line and the results were interpolated onto an Eulerian grid on which the dispersion equation was solved by Crank-Nicholson type finite difference method. In the solution of the advection equation, Lagrange fifth, cubic spline, Hermite third and fifth interpolating polynomials were tested by numerical experiment and theoretical error analysis. Among these, Hermite interpolating polynomials are generally superior to Lagrange and cubic spline interpolating polynomials in reducing both dissipation and dispersion errors.

Characteristic polynomials of graph bundles with productive fibres

  • Kim, Hye-Kyung;Kim, Ju-Young
    • 대한수학회보
    • /
    • 제33권1호
    • /
    • pp.75-86
    • /
    • 1996
  • Let G be a finite simple connected graph with vertex set V(G) and edge set E(G). Let A(G) be the adjacency matrix of G. The characteristic polynomial of G is the characteristic polynomial $\Phi(G;\lambda) = det(\lambda I - A(G))$ of A(G). A zero of $\Phi(G;\lambda)$ is called an eigenvalue of G.

  • PDF

ENUMERATION OF GRAPHS AND THE CHARACTERISTIC POLYNOMIAL OF THE HYPERPLANE ARRANGEMENTS 𝒥n

  • Song, Joungmin
    • 대한수학회지
    • /
    • 제54권5호
    • /
    • pp.1595-1604
    • /
    • 2017
  • We give a complete formula for the characteristic polynomial of hyperplane arrangements ${\mathcal{J}}_n$ consisting of the hyperplanes $x_i+x_j=1$, $x_k=0$, $x_l=1$, $1{\leq}i$, j, k, $l{\leq}n$. The formula is obtained by associating hyperplane arrangements with graphs, and then enumerating central graphs via generating functions for the number of bipartite graphs of given order, size and number of connected components.