• 대한수학회논문집
• /
• 제23권4호
• /
• pp.499-509
• /
• 2008

In [4] we showed that a polynomial over a Noetherian ring is divisible by some other polynomial by looking at the matrix formed by the coefficients of the polynomials which we called the resultant matrix. Using the result, we will find conditions for a polynomial over a commutative ring to be irreducible. This can be viewed as a generalization of the Eisenstein's irreducibility criterion.

• 한국정보보호학회:학술대회논문집
• /
• 한국정보보호학회 1991년도 학술발표논문집
• /
• pp.40-48
• /
• 1991

McEliece 공개키 암호체계에 대한 새로운 암호해독적 공격이 제시되어진다. 기존의 암호해독 algorithm이 exponential-time의 complexity를 가지는 반면, 본고에서 제시되어지는 algorithm은 polynomial-time의 complexity를 가진다. 모든 linear codes에는 systematic generator matrix가 존재한다는 사실이 본 연구의 동기가 된다. Public generator matrix로부터, 암호해독에 사용되어질 수 있는 새로운 trapdoor generator matrix가 Gauss-Jordan Elimination의 역할을 하는 일련의 transformation matrix multiplication을 통해 도출되어진다. 제시되어지는 algorithm의 계산상의 complexity는 주로 systematic trapdoor generator matrix를 도출하기 위해 사용되는 binary matrix multiplication에 기인한다. Systematic generator matrix로부터 쉽게 도출되어지는 parity-check matrix를 통해서 인위적 오류의 수정을 위한 Decoding이 이루어진다.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.169-180
• /
• 2006

We study convergence of multisplitting method associated with a block diagonal conformable multisplitting for solving a linear system whose coefficient matrix is a symmetric positive definite matrix which is not an H-matrix. Next, we study the validity of m-step multisplitting polynomial preconditioners which will be used in the preconditioned conjugate gradient method.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제12권2호
• /
• pp.55-68
• /
• 2008

One of well known and much studied nonlinear matrix equations is the matrix polynomial which has the form $P(X)=A_0X^m+A_1X^{m-1}+{\cdots}+A_m$, where $A_0$, $A_1$, ${\cdots}$, $A_m$ and X are $n{\times}n$ complex matrices. Newton's method was introduced a useful tool for solving the equation P(X)=0. Here, we suggest an improved approach to solve each Newton step and consider how to incorporate line searches into Newton's method for solving the matrix polynomial. Finally, we give some numerical experiment to show that line searches reduce the number of iterations for convergence.

• 대한수학회논문집
• /
• 제35권2호
• /
• pp.533-546
• /
• 2020

Since Sheffer introduced the so-called Sheffer polynomials in 1939, the polynomials have been extensively investigated, applied and classified. In this paper, by using matrix algebra, specifically, some properties of Pascal and Wronskian matrices, we aim to present certain interesting identities involving the 2-variable truncated exponential based Sheffer polynomial sequences. Also, we use the main results to give some interesting identities involving so-called 2-variable truncated exponential based Miller-Lee type polynomials. Further, we remark that a number of different identities involving the above polynomial sequences can be derived by applying the method here to other combined generating functions.

• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.251-263
• /
• 2004

In this paper, algorithms for computing the minimal polynomial and the common minimal polynomial of resultant matrices over any field are presented by means of the approach for the Grobner basis of the ideal in the polynomial ring, respectively, and two algorithms for finding the inverses of such matrices are also presented. Finally, an algorithm for the inverse of partitioned matrix with resultant blocks over any field is given, which can be realized by CoCoA 4.0, an algebraic system over the field of rational numbers or the field of residue classes of modulo prime number. We get examples showing the effectiveness of the algorithms.

• Journal of applied mathematics & informatics
• /
• 제26권5_6호
• /
• pp.1185-1189
• /
• 2008

In this paper we show that the polynomial of degree 9 called generalized algebraicity is a polynomial identity for $3{\times}3$ matrices. ([5])

• 동력기계공학회지
• /
• 제3권4호
• /
• pp.69-78
• /
• 1999

In the single-input and single-output system, the parameter of plant is scalar polynomial, but in the multiple input and multiple output, it accompanies, being matrix polynomial, the consideration of observable controlability index or problems non-commutation in matrix polynomial as well as degree, and it is more complex to deal with. Therefore, it is thought that a full research on the single-input and single-output system is not sufficient. This paper proposes that problems of minimum variance self-tuning regulator by using numerical calculation example of multivariable system and pole assignment self-tuning regulator.

• Kyungpook Mathematical Journal
• /
• 제61권4호
• /
• pp.845-858
• /
• 2021

We present new bounds for the numerical radius of bounded linear operators and 2 × 2 operator matrices. We apply upper bounds for the numerical radius to the Frobenius companion matrix of a complex monic polynomial to obtain new estimations for the zeros of that polynomial. We also show with numerical examples that our new estimations improve on the existing estimations.

• 대한수학회보
• /
• 제60권5호
• /
• pp.1321-1334
• /
• 2023

An idempotent e of a ring R is called right (resp., left) semicentral if er = ere (resp., re = ere) for any r ∈ R, and an idempotent e of R∖{0, 1} will be called right (resp., left) quasicentral provided that for any r ∈ R, there exists an idempotent f = f(e, r) ∈ R∖{0, 1} such that er = erf (resp., re = fre). We show the whole shapes of idempotents and right (left) semicentral idempotents of upper triangular matrix rings and polynomial rings. We next prove that every nontrivial idempotent of the n by n full matrix ring over a principal ideal domain is right and left quasicentral and, applying this result, we can find many right (left) quasicentral idempotents but not right (left) semicentral.