• Title/Summary/Keyword: Inverse Matrix

Search Result 543, Processing Time 0.029 seconds

INFLUENCE ANALYSIS OF CHOLESKY DECOMPOSITION

  • Kim, Myung-Geun
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.3_4
    • /
    • pp.913-921
    • /
    • 2010
  • The derivative influence measure is adapted to the Cholesky decomposition of a covariance matrix. Formulas for the derivative influence of observations on the Cholesky root and the inverse Cholesky root of a sample covariance matrix are derived. It is easy to implement this influence diagnostic method for practical use. A numerical example is given for illustration.

An Implementation of Inverse Filter Using SVD for Multi-channel Sound Reproduction (SVD를 이용한 다중 채널상에서의 음재생을 위한 역변환 필터의 구현)

  • 이상권;노경래
    • The Journal of the Acoustical Society of Korea
    • /
    • v.20 no.8
    • /
    • pp.3-11
    • /
    • 2001
  • This paper describes an implementation of inverse filter using SVD in order to recover the input in multi-channel system. The matrix formulation in SISO system is extended to MIMO system. In time and frequency domain we investigates the inversion of minimum phase system and non-minimum phase system. To execute an effective inversion of non-minimum phase system, SVD is introduced. First of all we computes singular values of system matrix and then investigates the phase property of system. In case of overall system is non-minimum phase, system matrix has one (or more) very small singular value (s). The very small singular value (s) carries information about phase properties of system. Using this property, approximate inverse filter of overall system is founded. The numerical simulation shows potentials in use of the inverse filter.

  • PDF

An Efficient Computing Method of the Orthogonal Projection Matrix for the Balanced Factorial Design

  • Kim, Byung-Chun;Park, Jong-Tae
    • Journal of the Korean Statistical Society
    • /
    • v.22 no.2
    • /
    • pp.249-258
    • /
    • 1993
  • It is well known that design matrix X for any factorial design can be represented by a product $X = TX_o$ where T is replication matrix and $X_o$ is the corresponding balanced design matrix. Since $X_o$ consists of regular arrangement of 0's and 1's, we can easily find the spectral decomposition of $X_o',X_o$. Also using this we propose an efficient algorithm for computing the orthogonal projection matrix for a balanced factorial design.

  • PDF

THE NEW ALGORITHM FOR $LDL^T$ DECOMPOSITION OF BLOCK HANKEL MATRICES

  • Bao, Wendi;Lv, Zhongquan
    • 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.

THE GENERALIZATION OF STYAN MATRIX INEQUALITY ON HERMITIAN MATRICES

  • Zhongpeng, Yang;Xiaoxia, Feng;Meixiang, Chen
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.3_4
    • /
    • pp.673-683
    • /
    • 2009
  • We point out: to make Hermtian matrices A and B satisfy Styan matrix inequality, the condition "positive definite property" demanded in the present literatures is not necessary. Furthermore, on the premise of abandoning positive definite property, we derive Styan matrix inequality of Hadamard product for inverse Hermitian matrices and the sufficient and necessary conditions that the equation holds in our paper.

  • PDF

DCT/DFT Hybrid Algorithm using Simple Element Inverse (단순 엘레멘트 인버스를 이용한 DCT/DFT 하이브리드 알고리즘)

  • Lee, Kwang-Jae;Park, Dae-Chul;Lee, Moon-Ho;Sin, Tae-Chol;Chen, Zhu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.6C
    • /
    • pp.594-599
    • /
    • 2007
  • In this paper, we present new representation of DCT/DFT matrices via one hybrid architecture. Based on a element inverse matrix factorization algorithm, we show that the DCT and DFT have a same recursive computational pattern, and we can develop an hybrid architecture by using some diagonal matrices.

A study on the solution of inverse jacobian for TOP-1 (TOP-1 로보트의 Inverse Jacobian의 해)

  • 우상래;이재섭;김형래
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1986.10a
    • /
    • pp.304-309
    • /
    • 1986
  • This paper is about the Inverse Jacobian for the TOP-1 robot. The robot Jacobian is used for the movement in accordance with differental changes. A Matrix and Homogeneous Transformation Matrix, Differential Motion Vector D are applied to Jacobian equation for the movement of the robot in accordance with the minut changes. The solution of Jacobian equation is acquired and applied for the subtle movement of each arms of the robot. The interface with APPLE-II Micro-computer is searched out too. The Software and the interface resulted from this paper are considered to be higly useful in the accurate control on the robot when they are linked with dynamics of robot.

  • PDF

Dynamic Walking Planning and Inverse Dynamic Analysis of Biped Robot (이족로봇의 동적 보행계획과 역동역학 해석)

  • Park, In-Gyu;Kim, Jin-Geol
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.17 no.9
    • /
    • pp.133-144
    • /
    • 2000
  • The dynamic walking planning and the inverse dynamics of the biped robot is investigated in this paper. The biped robot is modeled with 14 degrees of freedom rigid bodies considering the walking pattern and kinematic construction of humanoid. The method of the computer aided multibody dynamics is applied to the dynamic analysis. The equations of motion of biped are initially represented as terms of the Cartesian corrdinates then they are converted to the minimum number of equations of motion in terms of the joint coordinates using the velocity transformation matrix. For the consideration of the relationships between the ground and foot the holonomic constraints are added or deleted on the equations of motion. the number of these constraints can be changed by types of walking patterns with three modes. In order for the dynamic walking to be stabilizable optimized trunk positions are iteratively determined by satisfying the system ZMP(Zero Moment Point) and ground conditions.

  • PDF

Analytical Method for Constrained Mechanical and Structural Systems

  • Eun, Hee-Chang;Park, Sang-Yeol;Lee, Eun-Taik;Chung, Heon-Soo
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.10
    • /
    • pp.1691-1699
    • /
    • 2004
  • The objective of this study is to present an accurate and simple method to describe the motion of constrained mechanical or structural systems. The proposed method is an elimination method to require less effort in computing Moore-Penrose inverse matrix than the generalized inverse method provided by Udwadia and Kalaba. Considering that the results by numerical integration of the derived second-order differential equation to describe constrained motion veer away the constrained trajectories, this study presents a numerical integration scheme to obtain more accurate results. Applications of holonomically or nonholonomically constrained systems illustrate the validity and effectiveness of the proposed method.