• Title/Summary/Keyword: Inverse matrix

Search Result 544, Processing Time 0.02 seconds

EFFICIENT ALGORITHM FOR FINDING THE INVERSE AND THE GROUP INVERSE OF FLS $\gamma-CIRCULANT$ MATRIX

  • JIANG ZHAO-LIN;XU ZONG-BEN
    • Journal of applied mathematics & informatics
    • /
    • v.18 no.1_2
    • /
    • pp.45-57
    • /
    • 2005
  • An efficient algorithm for finding the inverse and the group inverse of the FLS $\gamma-circulant$ matrix is presented by Euclidean algorithm. Extension is made to compute the inverse of the FLS $\gamma-retrocirculant$ matrix by using the relationship between an FLS $\gamma-circulant$ matrix and an FLS $\gamma-retrocirculant$ matrix. Finally, some examples are given.

Hybrid DCT/DFflWavelet Architecture Based on Jacket Matrix

  • Chen, Zhu;Lee, Moon-Ho
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.281-282
    • /
    • 2007
  • We address a new representation of DCT/DFT/Wavelet matrices via one hybrid architecture. Based on an element inverse matrix factorization algorithm, we show that the OCT, OFT and Wavelet which based on Haar matrix have the similarrecursive computational pattern, all of them can be decomposed to one orthogonal character matrix and a special sparse matrix. The special sparse matrix belongs to Jacket matrix, whose inverse can be from element-wise inverse or block-wise inverse. Based on this trait, we can develop a hybrid architecture.

  • PDF

Fast Binary Block Inverse Jacket Transform

  • Lee Moon-Ho;Zhang Xiao-Dong;Pokhrel Subash Shree;Choe Chang-Hui;Hwang Gi-Yean
    • Journal of electromagnetic engineering and science
    • /
    • v.6 no.4
    • /
    • pp.244-252
    • /
    • 2006
  • A block Jacket transform and. its block inverse Jacket transformn have recently been reported in the paper 'Fast block inverse Jacket transform'. But the multiplication of the block Jacket transform and the corresponding block inverse Jacket transform is not equal to the identity transform, which does not conform to the mathematical rule. In this paper, new binary block Jacket transforms and the corresponding binary block inverse Jacket transforms of orders $N=2^k,\;3^k\;and\;5^k$ for integer values k are proposed and the mathematical proofs are also presented. With the aid of the Kronecker product of the lower order Jacket matrix and the identity matrix, the fast algorithms for realizing these transforms are obtained. Due to the simple inverse, fast algorithm and prime based $P^k$ order of proposed binary block inverse Jacket transform, it can be applied in communications such as space time block code design, signal processing, LDPC coding and information theory. Application of circular permutation matrix(CPM) binary low density quasi block Jacket matrix is also introduced in this paper which is useful in coding theory.

A New Sparse Matrix Analysis of DFT Similar to Element Inverse Jacket Transform (엘레멘트 인버스 재킷 변환과 유사한 DFT의 새로운 희소 행렬 분해)

  • Lee, Kwang-Jae;Park, Dae-Chul;Lee, Moon-Ho;Choi, Seung-Je
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.4C
    • /
    • pp.440-446
    • /
    • 2007
  • This paper addresses a new representation of DFT matrix via the Jacket transform based on the element inverse processing. We simply represent the inverse of the DFT matrix following on the factorization way of the Jacket transform, and the results show that the inverse of DFT matrix is only simply related to its sparse matrix and the permutations. The decomposed DFT matrix via Jacket matrix has a strong geometric structure that exhibits a block modulating property. This means that the DFT matrix decomposed via the Jacket matrix can be interpreted as a block modulating process.

How to Characterize Equalities for the Generalized Inverse $A^{(2)}_{T,S}$ of a Matrix

  • LIU, YONGHUI
    • Kyungpook Mathematical Journal
    • /
    • v.43 no.4
    • /
    • pp.605-616
    • /
    • 2003
  • In this paper, some rank equalities related to generalized inverses $A^{(2)}_{T,S}$ of a matrix are presented. As applications, a variety of rank equalities related to the M-P inverse, the Drazin inverse, the group inverse, the weighted M-P inverse, the Bott-Duffin inverse and the generalized Bott-Duffin inverse are established.

  • PDF

A Cholesky Decomposition of the Inverse of Covariance Matrix

  • Park, Jong-Tae;Kang, Chul
    • Journal of the Korean Data and Information Science Society
    • /
    • v.14 no.4
    • /
    • pp.1007-1012
    • /
    • 2003
  • A recursive procedure for finding the Cholesky root of the inverse of sample covariance matrix, leading to a direct solution for the inverse of a positive definite matrix, is developed using the likelihood equation for the maximum likelihood estimation of the Cholesky root under normality assumptions. An example of the Hilbert matrix is considered for an illustration of the procedure.

  • PDF

A Study on the Shape Finding of Cable-Net Structures Introducing General Inverse Matrix (일반역행열(一般逆行列)을 이용(利用)한 케이블네트 구조물(構造物)의 형상결정에 관한 연구)

  • Sur, Sam-Uel;Lee, Jang-Bok
    • Journal of Korean Association for Spatial Structures
    • /
    • v.2 no.1 s.3
    • /
    • pp.75-84
    • /
    • 2002
  • In this study, the 'force density method' for shape finding of cable net structures is presented. This concept is based on the force-length ratios or force densities which are defined for each branch of the net structures. This method renders a simple linear 'analytical form finding' possible. If the free choice of the force densities is restricted by further condition, the linear method is extended to a nonlinear one. The nonlinear one can be applied to the detailed computation of networks. In this paper, the general inverse matrix is introduced to solve the nonlinear equilibrium equation including Jacobian matrix which is rectangular matrix. Several examples for linear and nonlinear analysis applied additional constraints are presented. It is shown that the force density method is suitable for form finding of cable net and the general inverse matrix can be applied to solve the nonlinear equation without Lagrangian factors.

  • PDF

Actuator Fault Estimation Method using Hexacopter Symmetry (Hexacopter의 대칭성을 이용한 구동기 고장 추정 방법)

  • Lee, Chan Hyeok;Park, Min Kee
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.22 no.7
    • /
    • pp.519-523
    • /
    • 2016
  • This paper proposes a method of estimating the actuator faults of a hexacopter without using encoders when one or more of six actuators do not operate normally. In the case of the hexacopter, a Pseudo-Inverse matrix is generally used to obtain the rotational speed of the actuators because the matrix that transforms the rotational speed of the actuators into the thrust and torque of the body coordinate system is not a square matrix. However, the method based on the Pseudo-Inverse matrix cannot detect the actuator faults correctly because the Pseudo-Inverse matrix is approximate. In the proposed method, the actuator faults are estimated by modifying the transform matrix using the property that the actuators of the hexacopter are symmetrical. The simulation results show the effectiveness of the proposed method when faults occur in one or more of the six actuators.