• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2004년도 추계학술대회 학술발표 논문집 제14권 제2호
• /
• pp.351-354
• /
• 2004

Using the idea of generalized intuitionistic fuzzy set, we study the notion of generalized intuitionistic fuzzy matrices as a generalization of fuzzy matrices, We show that some properties of a square generalized intuitionistic fuzzy matrix such as reflexivity, transitivity and circularity are carried over to the adjoint generalized intuitionistic fuzzy matrix.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 B
• /
• pp.829-831
• /
• 1999

This paper considers the problem of identifying the time-varying parameters of Bilinear systems. The Parameters, in this paper, are identified by using the EBPOMs (Extended Block Pulse Operational Matrices) which can reduce the burden of operation and the volume of error caused by matrices multiplication

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 B
• /
• pp.826-828
• /
• 1999

This paper considers the problem of identifying the time-varying parameters of Bilinear systems. The Parameters, in this paper, are identified by using the EBPOMs (Extended Block Pulse Operational Matrices) which can reduce the burden of operation and the volume of error caused by matrices multiplication

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
• /
• pp.473-476
• /
• 1989

Quadratic weighting matrices have an effect on the transition and steady state responses in a LQ tracking problem. They are usually decided on trial and error in order to get a good response. In this paper a method is presented which calculates a steady - state deviation without solving Riccati equation. By using this method, a new procedure for selecting the weighting matrices is proposed when a tolerance on the steady - state deviation is given.

• 호남수학학술지
• /
• 제30권4호
• /
• pp.659-670
• /
• 2008

We denote by $\mathcal{Q}$(A) the set of all real matrices with the same sign pattern as a real matrix A. A matrix A is an SN-matrix provided there exists a set S of sign pattern such that the set of sign patterns of vectors in the -space of $\tilde{A}$ is S, for each ${\tilde{A}}{\in}\mathcal{Q}(A)$. Some properties of SN-matrices arc investigated.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제18권3호
• /
• pp.185-199
• /
• 2011

In this paper, we present a new extended Jacobi method for computing eigenvalues and eigenvectors of Hermitian matrices which does not use any complex arithmetics. This method can be readily applied to skew-Hermitian and real skew-symmetric matrices as well. An example illustrating its computational efficiency is given.

• Journal of applied mathematics & informatics
• /
• 제29권3_4호
• /
• pp.641-651
• /
• 2011

In this paper, with use of the displacement matrix, two special matrices are constructed. By these special matrices the block decompositions of the block symmetric Hankel matrix and the inverse of the Hankel matrix are derived. Hence, the algorithms according to these decompositions are given. Furthermore, the numerical tests show that the algorithms are feasible.

• Journal of applied mathematics & informatics
• /
• 제27권5_6호
• /
• pp.1319-1330
• /
• 2009

In [2] A.Hadjidimos proposed the generalized accelerated over-relaxation (GAOR) methods which generalize the basic iterative method for the solution of linear systems. In this paper we consider the convergence of the two parallel accelerated generalized AOR iterative methods and obtain some convergence theorems for the case when the coefficient matrix A is a block diagonally dominant matrix or a generalized block diagonally dominant matrix.

• 대한수학회논문집
• /
• 제15권4호
• /
• pp.587-595
• /
• 2000

We contain a simple construction for the sparse n x n connected orthogonal matrices which have a row of p nonzero entries with 2$\leq$p$\leq$n. Moreover, we study the analogous sparsity problem for an m x n connected row-orthogonal matrices.

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

An open problem proposed by Safavi-Naini and Seberry in IEEE transactions on information theory(1991) can be reduced to a combinatorial problem on partitioning a subset of binary matrices. We solve the generalized Naini-Seberry's open problem by considering a certain class of binary matrices. Thus a subliminal channel of r 〉 1 bit capacity is systematically established for Naini-Seberry's authentication schemes. We also construct concrete examples.