• Journal of applied mathematics & informatics
• /
• v.33 no.3_4
• /
• pp.247-260
• /
• 2015

The special form of Schur complement is extended to have a Schur's formula to obtains the explicit formula of determinant, inverse, and eigenvector formula of the doubly Leslie matrix which is the generalized forms of the Leslie matrix. It is also a generalized form of the doubly companion matrix, and the companion matrix, respectively. The doubly Leslie matrix is a nonderogatory matrix.

• Journal of the Korean Mathematical Society
• /
• v.45 no.2
• /
• pp.479-491
• /
• 2008

In [4], the authors studied the Pascal matrix and the Stirling matrices of the first kind and the second kind via the Fibonacci matrix. In this paper, we consider generalizations of Pascal matrix, Fibonacci matrix and Pell matrix. And, by using Riordan method, we have factorizations of them. We, also, consider some combinatorial identities.

• Journal of the Chungcheong Mathematical Society
• /
• v.33 no.4
• /
• pp.413-427
• /
• 2020

In this work we study 0-commuting matrix C(0) under relationships with the Pascal matrix C(1). Like kth power C(1)k is an arithmetic matrix of (kx+y)n with yx = xy (k ≥ 1), we express C(0)k as an arithmetic matrix of certain polynomial with yx = 0.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.6
• /
• pp.377-384
• /
• 2017

The scope of the matrix application is so broad that it can not be limited. A typical matrix application area in computer science is image processing. Particularly, radar scanning equipment implemented on a small embedded system requires real-time matrix transposition for image processing, and since its memory size is small, a general matrix transposition algorithm can not be applied. In this case, matrix transposition must be done in disk space, such as flash disk, using a limited memory buffer. In this paper, we analyze and improve a recently published flash disk-based matrix transposition algorithm named as asymmetric sub-matrix transposition algorithm. The performance analysis shows that the asymmetric sub-matrix transposition algorithm has lower performance than the conventional sub-matrix transposition algorithm, but the improved asymmetric sub-matrix transposition algorithm is superior to the sub-matrix transposition algorithm in 13 of the 16 experimental data.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.3 no.1
• /
• pp.43-53
• /
• 1999

A real $m{\times}n$ matrix A is called an L-matrix if every matrix in its qualitative class has linearly independent rows. Since the number of the sign pattern matrices of the given size is finite, we can list all patterns lexicographically. In [2], a necessary and sufficient condition for a matrix to be an L-matrix was given. We presented an algorithm which decides whether the given matrix is an L-matrix or not. In this paper, we develope an algorithm and C-program which will determine whether a given matrix is an L-matrix or not, or an SNS-matrix or not. In addition, we have extended our algorithm to be able to classify sign-pattern matrices, and to find barely L-matrices from a given matrix and to list all $m{\times}n$ L-matrices.

• Honam Mathematical Journal
• /
• v.27 no.4
• /
• pp.543-550
• /
• 2005

Some properties of a transitive fuzzy matrix are examined and the canonical form of the transitive fuzzy matrix is given using the properties. As a special case an open problem concerning idempotent matrices is solved. Thus we have the same result in a intuitionistic fuzzy matrix theory. In our results a nilpotent intuitionistic matrix and a symmetric intuitionistic matrix play an important role. We decompose a transitive intuitionistic fuzzy matrix into sum of a nilpotent intuitionistic matrix and a symmetric intuitionistic matrix. Then we obtain a canonical form of the transitive intuitionistic fuzzy matrix.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.3
• /
• pp.511-519
• /
• 2009

A matrix $P{\in}\mathbb{C}^{n{\times}n}$ is called a generalized reflection matrix if $P^*$ = P and $P^2$ = I. An $n{\times}n$ complex matrix A is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix P if A = PAP (A = -PAP). It is well-known that the reflexive and anti-reflexive matrices with respect to the generalized reflection matrix P have many special properties and widely used in engineering and scientific computations. In this paper, we give new necessary and sufficient conditions for the existence of the reflexive (anti-reflexive) solutions to the linear matrix equation AXB + CY D = E and derive representation of the general reflexive (anti-reflexive) solutions to this matrix equation. By using the obtained results, we investigate the reflexive (anti-reflexive) solutions of some special cases of this matrix equation.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.485-495
• /
• 2011

Let $A_1$ and $A_2$ be $n{\times}n$ nonzero complex matrices, denote a linear combination of the two matrices by $A=c_1A_1+c_2A_2$, where $c_1$, $c_2$ are nonzero complex numbers. In this paper, we research the problem of the linear combinations in the general case. We give a sufficient and necessary condition for A is an involutive matrix and s+1-potent matrix, respectively, where $A_1$ is a tripotent matrix, with $A_1A_2=A_2A_1$. Then, using the results, we also give the sufficient and necessary conditions for the involutory of the linear combination A, where $A_1$ is a tripotent matrix, anti-idempotent matrix, and involutive matrix, respectively, and $A_2$ is a tripotent matrix, idempotent matrix, and involutive matrix, respectively, with $A_1A_2=A_2A_1$.

• Honam Mathematical Journal
• /
• v.42 no.3
• /
• pp.425-447
• /
• 2020

The family of q-Konhauser matrix polynomials have been extended to Konhauser matrix polynomials. The purpose of the present work is to show that an extension of the explicit forms, generating matrix functions, matrix recurrence relations and Rodrigues-type formula for these matrix polynomials are given, our desired results have been established and their applications are presented.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.19 no.10
• /
• pp.1021-1027
• /
• 2009

Finite element models of dynamic systems can be updated in two stages. In the first stage, mass and stiffness matrices are updated neglecting damping. In the second stage, a damping matrix is estimated with the mass and stiffness matrices fixed. Methods to estimate a damping matrix for this purpose are proposed in this paper. For a system with proportional damping, a damping matrix is estimated using the modal parameters extracted from the measured responses and the modal matrix calculated from the mass and stiffness matrices from the first stage. For a system with non-proportional damping, a damping matrix is estimated from the impedance matrix which is the inverse of the FRF matrix. Only one low or one column of the FRF matrix is measured, and the remaining FRFs are synthesized to obtain a full FRF matrix. This procedure to obtain a full FRF matrix saves time and effort to measure FRFs.