• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권6호
• /
• pp.2634-2648
• /
• 2020

In this paper, an adaptive sparse singular value decomposition (ASSVD) algorithm is proposed to estimate the signal matrix when only one data matrix is observed and there is high dimensional white noise, in which we assume that the signal matrix is low-rank and has sparse singular vectors, i.e. it is a simultaneously low-rank and sparse matrix. It is a structured matrix since the non-zero entries are confined on some small blocks. The proposed algorithm estimates the singular values and vectors separable by exploring the structure of singular vectors, in which the recent developments in Random Matrix Theory known as anisotropic Marchenko-Pastur law are used. And then we prove that when the signal is strong in the sense that the signal to noise ratio is above some threshold, our estimator is consistent and outperforms over many state-of-the-art algorithms. Moreover, our estimator is adaptive to the data set and does not require the variance of the noise to be known or estimated. Numerical simulations indicate that ASSVD still works well when the signal matrix is not very sparse.

• ETRI Journal
• /
• 제45권2호
• /
• pp.277-290
• /
• 2023

This paper proposes a method that can reduce the complexity of a system matrix by analyzing the characteristics of a pseudoinverse matrix to receive a binomial frequency division multiplexing (BFDM) signal and decode it using the least squares (LS) method. The system matrix of BFDM can be expressed as a band matrix, and as this matrix contains many zeros, its amount of calculation when generating a transmission signal is quite small. The LS solution can be obtained by multiplying the received signal by the pseudoinverse matrix of the system matrix. The singular value decomposition of the system matrix indicates that the pseudoinverse matrix is a band matrix. The signal-to-interference ratio is obtained from their eigenvalues. Meanwhile, entries that do not contribute to signal generation are erased to enhance calculation efficiency. We decode the received signal using the pseudoinverse matrix and the removed pseudoinverse matrix to obtain the bit error rate performance and to analyze the difference.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제11권1호
• /
• pp.6-14
• /
• 2011

This paper presents a high-speed QR decomposition architecture for the multi-input-multi-output (MIMO) receiver based on Givens rotation. Under fast-varying channel, since the inverse matrix calculation has to be performed frequently in MIMO receiver, a high performance and low latency QR decomposition module is highly required. The proposed QR decomposition architecture is composed of Sign-Select Lookahead (SSL) coordinate rotation digital computer (CORDIC). In the SSL-CORDIC, the sign bits, which are computed ahead to select which direction to rotate, are used to select one of the last iteration results, therefore, the data dependencies on the previous iterations are efficiently removed. Our proposed QR decomposition module is implemented using TSMC 0.25 ${\mu}M$ CMOS process. Experimental results show that the proposed QR architecture achieves 34.83% speed-up over the Compact CORDIC based architecture for the 4 ${\times}$ 4 matrix decomposition.

• East Asian mathematical journal
• /
• 제40권3호
• /
• pp.307-318
• /
• 2024

This paper explores the application of matrix factorization, specifically CUR decomposition, in the clustering of Korean language documents by topic. It addresses the unique challenges of Natural Language Processing (NLP) in dealing with the Korean language's distinctive features, such as agglutinative words and morphological ambiguity. The study compares the effectiveness of Latent Semantic Analysis (LSA) using CUR decomposition with the classical Singular Value Decomposition (SVD) method in the context of Korean text. Experiments are conducted using Korean Wikipedia documents and newspaper data, providing insight into the accuracy and efficiency of these techniques. The findings demonstrate the potential of CUR decomposition to improve the accuracy of document clustering in Korean, offering a valuable approach to text mining and information retrieval in agglutinative languages.

• Journal of applied mathematics & informatics
• /
• 제8권1호
• /
• pp.97-109
• /
• 2001

This article is devoted to “forgotten” and rarely used technique of matrix analysis, introduced in 60-70th and enhanced by authors. We will study the matrix trace operator and it’s differentiability. This idea generalizes the notion of scalar derivative for matrix computations. The list of the most common derivatives is given at the end of the article. Additionally we point out a close connection of this technique with a least square problem in it’s classical and generalized case.

• 전기의세계
• /
• 제32권11호
• /
• pp.664-669
• /
• 1983

대규모 system을 취급하는 공학분야에 있어서 Matrix의 demension이 커짐에 따라 전산부담을 줄이기 위한 소요기억용량 절감 및 계산시간의 단축이 주된 관심사 중의 하나가 되어 왔다. LP(Linear Programming)기법 역시 대규모 선형 system에 적용될 경우 Basic Matrix 에 대한 dimensionality 문제를 포함하고 있으며 이에 대한 효과적인 해결방법으로 Bartels-Golub Decomposition 방법이 연구되어 있다. 이 방법은 Chan과 Yip등이 LSGA(Load Shedding and Generator Rescheduling) 문제에의 적용을 시도한 바 있으며, 일반적인 선형최적화 문제뿐만 아니라, dimensionality가 큰 Matrix의 Inverse 계산을 요하는 문제에 널리 적용될 수 있으므로 그 개요를 소개하고자 한다.

• 제어로봇시스템학회논문지
• /
• 제4권4호
• /
• pp.413-419
• /
• 1998

A novel order-reduction technique for model predictive control(MPC) is proposed based on the singular value decomposition(SVD) of a pulse response circulant matrix(PRCM) of a concerned system. It is first investigated that the PRCM (in the limit) contains a complete information of the frequency response of a system and its SVD decomposes the information into the respective principal directions at each frequency. This enables us to isolate the significant modes of the system and to devise the proposed order-reduction technique. Though the primary purpose of the proposed technique is to diminish the required computation in MPC, the clear frequency decomposition of the SVD of the PRCM also enables us to improve the robustness through selective excitation of frequency modes. Performance of the proposed technique is illustrated through two numerical examples.

• Journal of the Korean Data and Information Science Society
• /
• 제18권4호
• /
• pp.1135-1143
• /
• 2007

The singular value decomposition and the spectral decomposition are the useful methods in the area of matrix computation for multivariate techniques such as principal component analysis and multidimensional scaling. These techniques aim to find a simpler geometric structure for the data points. The singular value decomposition and the spectral decomposition are the methods being used in these techniques for this purpose. In this paper, the singular value decomposition and the spectral decomposition are compared.

• Communications for Statistical Applications and Methods
• /
• 제24권1호
• /
• pp.81-96
• /
• 2017

Cumulative logit random effects models are typically used to analyze longitudinal ordinal data. The random effects covariance matrix is used in the models to demonstrate both subject-specific and time variations. The covariance matrix may also be homogeneous; however, the structure of the covariance matrix is assumed to be homoscedastic and restricted because the matrix is high-dimensional and should be positive definite. To satisfy these restrictions two Cholesky decomposition methods were proposed in linear (mixed) models for the random effects precision matrix and the random effects covariance matrix, respectively: modified Cholesky and moving average Cholesky decompositions. In this paper, we use these two methods to model the random effects precision matrix and the random effects covariance matrix in cumulative logit random effects models for longitudinal ordinal data. The methods are illustrated by a lung cancer data set.

• 대한전기학회논문지
• /
• 제35권11호
• /
• pp.511-518
• /
• 1986

An algorithm for block-decomposition of a linear, time-invariant, discrete large-scale systems is presented, based upon the matrix sign function on Z-plane. The block-decomposition is performed by defining a reference circle, a circular stripe and projection operators. Simulation study shows that the presented algorithm is very useful for multivariable control system's analysis and design.