• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.141-149
• /
• 2006

In this paper, we introduce an improved algorithm for computing matrix triple product that commonly arises in primal-dual optimization method. In computing $P=AHA^{t}$, we devise a single pass algorithm that exploits the block diagonal structure of the matrix H. This one-phase scheme requires fewer floating point operations and roughly half the memory of the generic two-phase algorithm, where the product is computed in two steps, computing first $Q=HA^{t}$ and then P=AQ. The one-phase scheme achieved speed-up of 2.04 on Intel Itanium II platform over the two-phase scheme. Based on memory latency and modeled cache miss rates, the performance improvement was evaluated through performance modeling. Our research has impact on performance tuning study of complex sparse matrix operations, while most of the previous work focused on performance tuning of basic operations.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.11 no.4
• /
• pp.143-150
• /
• 1991

This paper presents an overview of a system of computer programs for the solution of a large geodetic network of about 2,000 stations. The system arranges the matrices in systematic sparse form which is applied to observation equations of RR(C)U (Row-wise Representation Complete Unordered) type and to normal equations of RR(U)U (Row-wise Representation Upper Unordered) type. The solution is done by a Modified Cholesky's algorithm in view of large networks. The implementation program are tested in PC-386 by korean new secondary networks, the results show that the sparse techniques are highly useful to geodetic networks in core-storage management and processing time.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.29 no.7
• /
• pp.560-565
• /
• 2018

The SPICE (Sparse Iterative Covariance-based Estimation) algorithm estimates the azimuth angle by applying a sparse recovery method to the covariance matrix in the time domain. In this paper, we show how the SPICE algorithm, which was originally formulated in the time domain, can be extended to the frequency domain. Furthermore, we demonstrate, through numerical results, that the performance of the proposed algorithm is superior to that of the conventional frequency domain algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.12
• /
• pp.1122-1132
• /
• 2012

Compressed sensing has been applied to many fields such as images, speech signals, radars, etc. It has been mainly applied to stationary signals, and reconstruction error could grow as compression ratios are increased by decreasing measurements. To resolve the problem, speech signals are divided into frames and processed in parallel. The frames are made sparse by dictionary learning, and adaptive compressed sensing is applied which designs the compressed sensing reconstruction matrix adaptively by using the difference between the sparse coefficient vector and its reconstruction. Through the proposed method, we could see that fast and accurate reconstruction of non-stationary signals is possible with compressed sensing.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.32 no.12
• /
• pp.435-440
• /
• 1983

The methods of forming the bus impedance matrix, which is mainly employed in fault analysis of power system, can be generally classified in catagories, (1) the one being the inverse matrix of bus admittance matrix, and (2) the other the bus impedance matrix succesive formation method by particular algorithms. The former method is theouetically elegant, but the formation and inverse of complex bus admittance matrix for large power system requires too much amounts of computer memory space and computing time. The latter method also requires too much memory space. Therefore, in this paper, an algorithm and computer program is introduced for the formation of a sparse bus impedance matrix which generates only the matching terms of the admittance matrix. So, this method can reduce the computer memory and computing time, and can be applied to fault analysis of large power system by small digital computer.

• Smart Structures and Systems
• /
• v.25 no.3
• /
• pp.369-384
• /
• 2020

A wavefield sparse reconstruction technique based on compressed sensing is developed in this work to dramatically reduce the number of measurements. Firstly, a severely underdetermined representation of guided wavefield at a snapshot is established in the spatial domain. Secondly, an optimal compressed sensing model of guided wavefield sparse reconstruction is established based on l₁-norm penalty, where a suite of discrete cosine functions is selected as the dictionary to promote the sparsity. The regular, random and jittered undersampling schemes are compared and selected as the undersampling matrix of compressed sensing. Thirdly, a gradient projection method is employed to solve the compressed sensing model of wavefield sparse reconstruction from highly incomplete measurements. Finally, experiments with different excitation frequencies are conducted on an aluminum plate to verify the effectiveness of the proposed sparse reconstruction method, where a scanning laser Doppler vibrometer as the true benchmark is used to measure the original wavefield in a given inspection region. Experiments demonstrate that the missing wavefield data can be accurately reconstructed from less than 12% of the original measurements; The reconstruction accuracy of the jittered undersampling scheme is slightly higher than that of the random undersampling scheme in high probability, but the regular undersampling scheme fails to reconstruct the wavefield image; A quantified mapping relationship between the sparsity ratio and the recovery error over a special interval is established with respect to statistical modeling and analysis.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.6
• /
• pp.1351-1362
• /
• 1995

A method to estimate the torsional critical speed for practical rotors has been developed in this study. First, the rotor with a uniform shaft segment is modeled for undamped torsional motion analysis, while satisfying all the boundary conditions. This eventually generates governing equations for the torsional critical speeds of the system. The set of governing equations has the form of a sparse and banded matrix. The elements of banded matrix can be arranged in partitions, which correspond to the specific boundary of the rotor. This permits an automatic generation of the system matrix using a computer. In order to calculate the determinant generated by the simultaneous equations, which leads to the torsional critical speed, a recurring numerical algorithm for a (3*4) sub-matrix has been used. This numerical algorithm practically examines successive (3*4) sub-matrix, one at a time, instead of treating a huge matrix. The output of the program provides the mode shapes with continuous curves. The method has been implemented to three rotors given as examples : a simple rotor, Prohl's rotor, and Macmillan rotor.

• Journal of the Korean Professional Engineers Association
• /
• v.20 no.1
• /
• pp.14-20
• /
• 1987

The development of the FHT (fast Hadamard transform) was presented and based on the derivation by Cooley-Tukey algorithm. Alternately, it can be derived by matrix partitioning or matrix factorization techniques. This paper proposes a simple sparse matrix technique by Kronecker product of successive lower Hadamard matrix. The following shows how the Kronecker product can be mathematically defined and efficiently implemented using a matrix factorization methods.

• Restorative Dentistry and Endodontics
• /
• v.37 no.1
• /
• pp.2-8
• /
• 2012

The limited durability of resin-dentin bonds severely compromises the longevity of composite resin restorations. Resin-dentin bond degradation might occur via degradation of water-rich and resin sparse collagen matrices by host-derived matrix metalloproteinases (MMPs). This review article provides overview of current knowledge of the role of MMPs in dentin matrix degradation and four experimental strategies for extending the longevity of resin-dentin bonds. They include: (1) the use of broadspectrum inhibitors of MMPs, (2) the use of cross-linking agents for silencing the activities of MMPs, (3) ethanol wet-bonding with hydrophobic resin, (4) biomimetic remineralization of water-filled collagen matrix. A combination of these strategies will be able to overcome the limitations in resin-dentin adhesion.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11b
• /
• pp.994-997
• /
• 2003

행렬 연산은 계산 과학을 사용하는 공학 물리, 화학, 생명 과학, 경제학 등에서 다양하게 사용되고 있으며 이 행렬은 크기가 크고 대부분의 원소가 0 값을 갖는 희소 행렬일 경우가 많다. 본 논문에서는 희소 행렬의 연산 중, 회로 설계 시 최적화 과정에 사용되는 연산에서 문제가 되는 희소 행렬 A 와 블록 대각 행렬 H에 대하여 AH$A^{T}$ 의 연산을 효율적으로 행하는 방법들을 검토하고 메모리 접근 횟수를 모델링하여 수행 속도와 메모리 사용량 면에서 비교한다.