• Korean Journal of Mathematics
• /
• v.12 no.2
• /
• pp.201-209
• /
• 2004

We define the incidence matrices of oriented and nonoriented ${\kappa}$-hypergraphs, respectively. We discuss the ranks of some circulant matrices and show that the rank of the incidence matrices of oriented and nonoriented ${\kappa}$-hypergraphs H are $n$ under a certain condition on the ${\kappa}$-edge set or ${\kappa}$-arc set of H.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.10a
• /
• 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.

• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• 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

• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• 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.10a
• /
• 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.

• Honam Mathematical Journal
• /
• v.30 no.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.

• The Pure and Applied Mathematics
• /
• v.18 no.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
• /
• v.29 no.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
• /
• v.27 no.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.

• Communications of the Korean Mathematical Society
• /
• v.15 no.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.