• Journal of applied mathematics & informatics
• /
• v.31 no.3_4
• /
• pp.343-352
• /
• 2013

In this paper, we give a formula of $(P+Q)^D$ under the conditions $P^2Q+QPQ=0$ and $P^3Q=0$. Then applying it to give some results of block matrix $M=(^A_C^B_D)$ (A and D are square matrices) with generalized Schur complement is zero under some conditions. Finally, numerical examples are given to illustrate our results.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.321-328
• /
• 2005

We investigate a matrix inequality on Schur complements defined by {1}-generalized inverses, and obtain simultaneously a necessary and sufficient condition under which the inequality turns into an equality. This extends two existing matrix inequalities on Schur complements defined respectively by inverses and Moore-Penrose generalized inverses (see Wang et al. [Lin. Alg. Appl., 302-303(1999)163-172] and Liu and Wang [Lin. Alg. Appl., 293(1999)233-241]). Moreover, the non-uniqueness of $\{1\}$-generalized inverses yields the complicatedness of the extension.

• Kyungpook Mathematical Journal
• /
• v.32 no.1
• /
• pp.103-110
• /
• 1992

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.5
• /
• pp.39-49
• /
• 2015

Some characters and construction theorems of Pseudo Jacket Matrix which is generalized from Jacket Matrix introduced by Jacket Matrices: Construction and Its Application for Fast Cooperative Wireless signal Processing[27] was announced. In this paper, we proposed some examples of Pseudo inverse Jacket matrix, such as $2{\times}4$, $3{\times}6$ non-square matrix for the MIMO channel. Furthermore we derived MIMO singular value decomposition (SVD) pseudo inverse channel and developed application to utilize SVD based on channel estimation of partitioned antenna arrays. This can be also used in MIMO channel and eigen value decomposition (EVD).

• Journal of the Korean Statistical Society
• /
• v.14 no.1
• /
• pp.29-38
• /
• 1985

Cyclic Factorial Association Scheme (CFAS) for incomplete block designs in a factorial experiment is defined. It is a generalization of EGD/($2^n-1$)-PBIB designs defined by Hinkelmann (1964) or Binary Number Association Scheme (BNAS) named by Paik and Federer (1973). A property of PBIB designs having CFAS is investigated and it is shown that the structural matrix NN' of such designs has a pattern of multi-nested block circulant matrix. The generalized inverse of (rI-NN'/k) is obtained. Generalized Cyclic incomplete block designs for factorial experiments introduced by John (1973) are presented as the examples of CFAS-PBIB designs. Finally, the relationship between CFAS and BNAS in block designs is briefly discussed.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.2
• /
• pp.149-169
• /
• 1986

Fundamentals of electrodynamics of moving sources with constant velocity in an anisotripic plasma when the do magnetic field and the relative motion are oriented in arbitrary directions are presented. The well-known Minkowski's relations are generalized to accomodate anisotropic and dispersive media, and relativistic transformation formulae of constitutive parameters are derived and expanded into polynomials of the speed ratio \ulcornerto increase the utility of the formulae. The helmholtz wave equation of electromagnetic fields is generalized to the media charactrized by tensor parameters, and is solved in operator form. Also the solution of wave equation is expressed as a porcuct of the inverse of the wave operator matrix and the source function vector, and the inverse of the wave operator matrix is presented in an explicit form. The equations and formulae derived in this paper are all general, and can be reduced to known and proven results upon imposing the restriction called for by specific situations.

• Proceedings of the Korean Statistical Society Conference
• /
• 2005.05a
• /
• pp.135-140
• /
• 2005

• The Korean Journal of Applied Statistics
• /
• v.20 no.2
• /
• pp.373-385
• /
• 2007

The solution of the normal equation arising in a general linear model by the least square methods is not unique in general. Conventionally, SAS IML and G-inverse matrices are considered for such problems. In this paper, we provide a systematic solution procedures for SAS IML.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.9
• /
• pp.827-833
• /
• 2013

In this paper, an efficient computational method is presented for state space analysis of bilinear systems via Legendre wavelets. The differential matrix equation is converted to a generalized Sylvester matrix equation by using Legendre wavelets as a basis. First, an explicit expression for the inverse of the integral operational matrix of the Legendre wavelets is presented. Then using it, we propose a preorder traversal algorithm to solve the generalized Sylvester matrix equation, which greatly reduces the computation time. Finally the efficiency of the proposed method is discussed using numerical examples.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.2
• /
• pp.373-385
• /
• 2009

An m${\times}$n Boolean matrix A is called regular if there exists an n${\times}$m Boolean matrix X such that AXA = A. We have characterizations of Boolean regular matrices. We also determine the linear operators that strongly preserve Boolean regular matrices.