• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.585-590
• /
• 2005

An efficient procedure for finding the inverse of a nonsingular matrix is developed by solving directly for the UL decomposition of the inverse based on the entries of the original nonsingular matrix.

• International Journal of Automotive Technology
• /
• v.2 no.3
• /
• pp.117-122
• /
• 2001

For a dynamic analysis of a constrained multibody system, it is necessary to have a routine for satisfying kinematic constraints. LU decomposition scheme, which is used to divide coordinates into dependent and independent coordinates, is efficient but has great difficulty near the singular configuration. Other method such as the projection matrix, which is more stable near a singular configuration, takes longer simulation time due to the large amount of calculation for decomposition. In this paper, the row space and the null space of the Jacobian matrix are proposed by using the pseudo-inverse method and the projection matrix. The equations of the motion of a system are replaced with independent acceleration components using the null space of the Jacobian matrix. Also a new hybrid method is proposed, combining the LU decomposition and the projection matrix. The proposed hybrid method has following advantages. (1) The simulation efficiency is preserved by the LU method during the simulation. (2) The accuracy of the solution is also achieved by the projection method near the singular configuration.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.1
• /
• pp.115-123
• /
• 1997

In this paper we present a polynomial matrix decomposition algorithm that determines a polynomial matix M(z) which satisfies the relation V(z)=M(z) for a given polynomial matrix V(z) which is paraconjugate hermitian matrix with normal rank r and is positive semidenfinite on the unit circle of z-plane. All the decomposition procedures in this proposed method are performed in the digitral domain. We also discuss how to apply the polynomial matirx decomposition in realizing MIMO LBR two-pairs.

• East Asian mathematical journal
• /
• v.37 no.3
• /
• pp.295-305
• /
• 2021

In this paper, we analyze the efficiency of a domain decomposition method for the two-dimensional telegraph equations. We formulate the theoretical spectral radius of the iteration matrix generated by the domain decomposition method, because the rate of convergence of an iterative algorithm depends on the spectral radius of the iteration matrix. The theoretical spectral radius is confirmed by the experimental one using MATLAB. Speedup and operation ratio of the domain decomposition method are also compared as the two measurements of the efficiency of the method. Numerical results support the high efficiency of the domain decomposition method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.4
• /
• pp.1020-1041
• /
• 2024

With the development of covert communication technologies, the number of covert communication technologies using blockchain as a carrier is increasing. However, using the transaction amount of digital currency as a carrier for covert communication has problems such as low embedding rate, large consumption of transaction amount, and easy detection. In this paper, firstly, by experimentally analyzing the distribution of bitcoin transaction amounts, we determine the most suitable range of amounts for matrix decomposition. Secondly, we design a novel matrix decomposition method that can successfully decompose a large amount matrix into two small amount matrices and utilize the elements in the small amount matrices for covert communication. Finally, we analyze the feasibility of the novel matrix decomposition method in this scheme in detail from four aspects, and verify it by experimental comparison, which proves that our scheme not only improves the embedding rate and reduces the consumption of transaction amount, but also has a certain degree of resistance to detection.

• ETRI Journal
• /
• v.36 no.1
• /
• pp.167-170
• /
• 2014

In this letter, we propose an unsupervised framework for speech noise reduction based on the recent development of low-rank and sparse matrix decomposition. The proposed framework directly separates the speech signal from noisy speech by decomposing the noisy speech spectrogram into three submatrices: the noise structure matrix, the clean speech structure matrix, and the residual noise matrix. Evaluations on the Noisex-92 dataset show that the proposed method achieves a signal-to-distortion ratio approximately 2.48 dB and 3.23 dB higher than that of the robust principal component analysis method and the non-negative matrix factorization method, respectively, when the input SNR is -5 dB.

• Communications of the Korean Mathematical Society
• /
• v.29 no.2
• /
• pp.227-237
• /
• 2014

For an $m{\times}n$ nonnegative integral matrix A, a generalized inverse of A is an $n{\times}m$ nonnegative integral matrix G satisfying AGA = A. In this paper, we characterize nonnegative integral matrices having generalized inverses using the structure of nonnegative integral idempotent matrices. We also define a space decomposition of a nonnegative integral matrix, and prove that a nonnegative integral matrix has a generalized inverse if and only if it has a space decomposition. Using this decomposition, we characterize nonnegative integral matrices having reflexive generalized inverses. And we obtain conditions to have various types of generalized inverses.

• Communications for Statistical Applications and Methods
• /
• v.20 no.3
• /
• pp.235-240
• /
• 2013

Generalized linear mixed models(GLMMs) are frequently used for the analysis of longitudinal categorical data when the subject-specific effects is of interest. In GLMMs, the structure of the random effects covariance matrix is important for the estimation of fixed effects and to explain subject and time variations. The estimation of the matrix is not simple because of the high dimension and the positive definiteness; subsequently, we practically use the simple structure of the covariance matrix such as AR(1). However, this strong assumption can result in biased estimates of the fixed effects. In this paper, we introduce Bayesian modeling approaches for the random effects covariance matrix using a modified Cholesky decomposition. The modified Cholesky decomposition approach has been used to explain a heterogenous random effects covariance matrix and the subsequent estimated covariance matrix will be positive definite. We analyze metabolic syndrome data from a Korean Genomic Epidemiology Study using these methods.

• 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.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.