• Kyungpook Mathematical Journal
• /
• v.28 no.1
• /
• pp.45-50
• /
• 1988

Circulant and multiblock circulant matrices have many important applications, and therefore their inverses are of considerable interest. A simple recursive algorithm is presented to compute the inverse of a multiblock circulant matrix. The algorithm only uses complex variables, roots of unity and normal matrix/vector operations.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.2
• /
• pp.541-550
• /
• 2016

In this paper, we introduce a quasi-Banach algebra of infinite matrices, which is inverse-closed in the Banach algebra B(${\ell}^2$) of all bounded operators on ${\ell}^2$.

• The Pure and Applied Mathematics
• /
• v.31 no.2
• /
• pp.159-178
• /
• 2024

We continue the investigations in [7] extending the Bruhat order on n × n alternating sign matrices to a more general setting. We show that the resulting partially ordered set is a lattice and also investigate its rank.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.15 no.6
• /
• pp.82-88
• /
• 2001

This paper considers the problem of the identification of the time invariant parameters of distributed systems. In general, the parameters are identified by using the CBPOM(Conventional Block Pulse Operational Matrices), but in this paper, the parameters ard identified by using the EBPOMS(Extended Block Pulse Operational Matrices) which can reduce the burden of operation md the volume of error caused by matrices multiplication. The simulation cloves the effectiveness of the proposed method.

• Proceedings of the Korean Society of Plant Pathology Conference
• /
• 2003.10a
• /
• pp.119.1-119
• /
• 2003

The glyoxysomal nature of microbodies was determined in Botryosphaeria dothidea hyphae based on morphology and in situ enzyme characteristics by transmission electron microscopy and cytochemistry. Bound by a single membrane, microbodies had a homogeneous matrix and varied in size ranging from 200 to 400 m in diameter. Microbodies had crystalline inclusion(s) which consisted of parallel arrays of fine tubules in their matrices. Microbodies and lipid globules were frequently placed in close association with each other, forming microbody-lipid globule complexes in hyphae. The cytochemical activities of catalase and malate synthase were localized in matrices of microbodies, showing intense electron-density of the organelle. In addition, the immunogold labeling detected the presence of catalase in multivesicular bodies and hyphal cell walls as well as in matrices and crystalline inclusions of microbodies, supporting the enzyme secretion through cell walls. Meanwhile, isocitrate Iyase was localized only in matrices of microbodies. These results suggest that microbodies, particularly complexed with lipid globules, in the fungal hyphae are functionally defined as glyoxysomes, where glyoxysomal enzymes are biochemically active for the glyoxylate cycle to be a metabolic pathway in gluconeogenesis. (Mycology and Fugus Diseases)

• Kyungpook Mathematical Journal
• /
• v.57 no.2
• /
• pp.211-222
• /
• 2017

In this paper, we consider three inverse eigenvalue problems for a special type of acyclic matrices. The acyclic matrices considered in this paper are described by a graph called a broom on n + m vertices, which is obtained by joining m pendant edges to one of the terminal vertices of a path on n vertices. The problems require the reconstruction of such a matrix from given partial eigen data. The eigen data for the first problem consists of the largest eigenvalue of each of the leading principal submatrices of the required matrix, while for the second problem it consists of an eigenvalue of each of its trailing principal submatrices. The third problem has an eigenvalue and a corresponding eigenvector of the required matrix as the eigen data. The method of solution involves the use of recurrence relations among the leading/trailing principal minors of ${\lambda}I-A$, where A is the required matrix. We derive the necessary and sufficient conditions for the solutions of these problems. The constructive nature of the proofs also provides the algorithms for computing the required entries of the matrix. We also provide some numerical examples to show the applicability of our results.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.12
• /
• pp.723-731
• /
• 2005

The $4{\times}4$ homogeneous transformation matrix is a compact representation of orientation and position of an object in robotics and computer graphics. A coordinate transformation is accomplished through the successive multiplications of homogeneous matrices, each of which represents the orientation and position of each corresponding link. Thus, for real time control applications in robotics or animation in computer graphics, the fast multiplication of homogeneous matrices is quite demanding. In this paper, a parallel-architecture vector processor is designed for this purpose. The processor has several key features. For the accuracy of computation for real application, the operands of the processors are floating point numbers based on the IEEE Standard 754. For the parallelism and reduction of hardware redundancy, the processor takes column vectors of homogeneous matrices as multiplication unit. To further improve the throughput, the processor structure and its control is based on a pipe-lined structure. Since the designed processor can be used as a special purpose coprocessor in robotics and computer graphics, additionally to special matrix/matrix or matrix/vector multiplication, several other useful instructions for various transformation algorithms are included for wide application of the new design. The suggested instruction set will serve as standard in future processor design for Robotics and Computer Graphics. The design is verified using FPGA implementation. Also a comparative performance improvement of the proposed design is studied compared to a uni-processor approach for possibilities of its real time application.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2008.04a
• /
• pp.389-392
• /
• 2008

This paper predicts the changes of natural frequencies due to the changes of mass at different point mass stations by using iterative calculation Transfer Matrices Method for different boundary conditions of a single beam structure (fixed-free and fixed-fixed beam). Firstly, the first three natural frequencies of an original beam are obtained using Transfer Matrices Method to verify the accuracy of the obtained results. The results are then compared with the exact solutions before purposely changing the parameter of mass. Both beams are modeled as discrete continuous systems with six-lumped-mass system. A single beam is broken down into a point mass and a massless beam which represent a single station and expressed in matrix form. The assembled matrices are used to determine the value of natural frequencies using numerical interpolation method corresponding to their mode number by manipulating some elements in the assembled matrix.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.471-471
• /
• 2000

This paper presents a new kurtosis-based algorithm for blind separation of convolutively mixed source signals. The algorithm whitens the signals not only spatially but also temporally beforehand. A separator is built for the whitened signals and it exists in the set of para-unitary matrices. Since the set forms a curved manifold, it is hard to treat its elements. In order to avoid the difficulty, this paper introduces the Cayley transformation for the para-unitary matrices. The transformed matrix is referred to as para-skew-Hermitian matrix and the set of such matrices forms a linear space. In the set of all para-skew-Hermitian matrices, the kurtosis-based algorithm obtains a desired separator. This paper also shows the algorithm's application to electrogastrogram datum which are observed by 4 electrodes on subjects' abdomen around their stomachs. An electrogastrogram contains signals from a stomach and other organs. This paper obtains independent components by the algorithm and then extracts the signal corresponding to the stomach from the data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2468-2483
• /
• 2017

The construction of completely random sensing matrices of Compressive Sensing requires a large number of random numbers while that of deterministic sensing operators often needs complex mathematical operations. Thus both of them have difficulty in acquiring large signals efficiently. This paper focuses on the enhancement of the practicability of the structurally random matrices and proposes a semi-deterministic sensing matrix called Partial Kronecker product of Identity and Hadamard (PKIH) matrix. The proposed matrix can be viewed as a sub matrix of a well-structured, sparse, and orthogonal matrix. Only the row index is selected at random and the positions of the entries of each row are determined by a deterministic sequence. Therefore, the PKIH significantly decreases the requirement of random numbers, which has a complex generating algorithm, in matrix construction and further reduces the complexity of sampling. Besides, in order to process large signals, the corresponding fast sampling algorithm is developed, which can be easily parallelized and realized in hardware. Simulation results illustrate that the proposed sensing matrix maintains almost the same performance but with at least 50% less random numbers comparing with the popular sampling matrices. Meanwhile, it saved roughly 15%-35% processing time in comparison to that of the SRM matrices.