• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.207-220
• /
• 2004

Necessary and sufficient conditions are given for the regularity of block triangular fuzzy matrices. This leads to characterization of idem-potency of a class of triangular Toeplitz matrices. As an application, the existence of group inverse of a block triangular fuzzy matrix is discussed. Equivalent conditions for a regular block triangular fuzzy matrix to be expressed as a sum of regular block fuzzy matrices is derived. Further, fuzzy relational equations consistency is studied.

• 대한수학회보
• /
• 제51권3호
• /
• pp.765-771
• /
• 2014

Necessary and sufficient conditions for the existence of the group inverse of an anti-triangular block matrix in Banach algebras are presented. Using these results, we give the formulae for the generalized Drazin inverse of a block matrix.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제13권1호
• /
• pp.13-20
• /
• 2009

The IPSAP which is a finite element analysis program has been developed for high parallel performance computing. This program consists of various analysis modules - stress, vibration and thermal analysis module, etc. The M orthogonal block Lanczos algorithm with shiftinvert transformation is used for solving eigenvalue problems in the vibration module. And the multifrontal algorithm which is one of the most efficient direct linear equation solvers is applied to factorization and triangular system solving phases in this block Lanczos iteration routine. In this study, the performance enhancement procedures of the IPSAP are composed of the following stages: 1) communication volume minimization of the factorization phase by modifying parallel matrix subroutines. 2) idling time minimization in triangular system solving phase by partial inverse of the frontal matrix and the LCM (least common multiple) concept.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(I)
• /
• pp.185-189
• /
• 1987

An analysis and design of large-scale linear multivariable systems often requires to be block triangularized form for good sensitivity of the systems when their poles and zeros are varied. But the decomposition algorithms presented up to now need a procedure of permutation, rescaling and a solution of nonlinear algebraic equations, which are usually burden. To avoid these problem, in this paper we develop a newly alternative block triangular decomposition algorithm which used the generalized matrix sign function on the Z-plane. Also, the decomposition algorithm demonstrated using the fifth order linear model of a distillation tower system.

• 대한수학회지
• /
• 제49권2호
• /
• pp.419-433
• /
• 2012

In this paper, we show that under certain conditions every Lie higher derivation and Lie triple derivation on a triangular algebra are proper, respectively. The main results are then applied to (block) upper triangular matrix algebras and nest algebras.

• 대한전자공학회논문지
• /
• 제23권5호
• /
• pp.681-691
• /
• 1986

To represent the relations of the data dependency and resource conflict among micro-operations(MOP's) in the compaction process of microprograms, we propose a DDM (data dependent matrix) representation method instead of the DAG (conventional directed acyclic graph). Also, we propose a global compaction algorithm of microprograms to prevent a kind of block copying by cutting the trace at a junction block. The DDM method and compaction algoristhm have been applied to the Lah's example. The results shows that the proposed algorithm is more efficient than the conventional algorithms in reducing in reducing the total execution time and control memory space.

• Journal of information and communication convergence engineering
• /
• 제6권3호
• /
• pp.261-265
• /
• 2008

This work presents a simplified efficient blind detection algorithm for orthogonal space-time codes(OSTBC). First, the proposed decoder exploits a proper decomposition approach of the upper triangular matrix R, which resulted from Cholesky-factorization of the composition channel matrix, to form an easy-to-solve blind detection equation. Secondly, in order to avoid suffering from the high computational load, the proposed decoder applies a sub-optimal QR-based decoder. Computer simulation results verify that the proposed decoder allows to significantly reduce computational complexity while still satisfying the bit-error-rate(BER) performance.

• 한국통신학회논문지
• /
• 제29권11A
• /
• pp.1244-1252
• /
• 2004

본 논문에서는 Alamouti의 시공간블록부호화를 적용한 다중화 시스템에서 선형 검출기 (zero forcing 또는 minimum mean square error)의 특성을 유도하고 이를 이용하여 수신기의 복잡도를 줄일 수 있는 방안을 제시한다. MMSE 검출기를 적응형으로 설계할 경우 계산해야 하는 가중치 벡터들의 수는 공간 다중화하여 전송한 심볼들의 수만큼 필요하지만 유도한 특성을 이용하면 STBC블록들의 수로 줄어든다. 적응형 알고리즘으로 RLS 알고리즘을 적용해 보았고 복잡도를 50%이상 줄일 수 있었다. 또한 V-Blast검출방법의 복잡도를 줄이기 위해 제안된 정렬QR분해 검출기를 본 시스템에 적용할 때 동일한 특성이 유니타리 행렬 Q와 상위삼각행렬 R에 나타나는 것을 확인하였고, 이 경우에도 성능의 저하 없이 복잡도를 50%까지 줄일 수 있었다.

• Journal of Information Processing Systems
• /
• 제12권4호
• /
• pp.765-778
• /
• 2016

In watermarking schemes, the discrete wavelet transform (DWT) is broadly used because its frequency component separation is very useful. Moreover, LU decomposition has little influence on the visual quality of the watermark. Hence, in this paper, a novel blind watermark algorithm is presented based on LU transform and DWT for the copyright protection of digital images. In this algorithm, the color host image is first performed with DWT. Then, the horizontal and vertical diagonal high frequency components are extracted from the wavelet domain, and the sub-images are divided into $4{\times}4$ non-overlapping image blocks. Next, each sub-block is performed with LU decomposition. Finally, the color image watermark is transformed by Arnold permutation, and then it is inserted into the upper triangular matrix. The experimental results imply that this algorithm has good features of invisibility and it is robust against different attacks to a certain degree, such as contrast adjustment, JPEG compression, salt and pepper noise, cropping, and Gaussian noise.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2003년도 춘계학술대회 논문집
• /
• pp.533-537
• /
• 2003

Compared to sintered polycrystalline diamond (PCD), the deposited thin film diamond has a great advantage on the fabrication of cutting tools with complex geometries such as drills. Because of high performance in high speed machining non-ferrous difficult-to-cut materials in the field of automobiles industry, aeronautics and astronautics industry, diamond-coated drills find large potentialities in commercial applications. However, the poor adhesion of the diamond film on the substrate and high surface roughness of the drill flute adversely affect the tool lift and machining quality and they become the main technical barriers for the successful development and commercialization of diamond-coated drills. In this paper, diamond thin films were deposited on the commercial WC-Co based drills by the electron aided hot filament chemical vapor deposition (EACVD). A new multiple coating technology based on changing gas pressure in different process stages was developed. The large triangular faceted diamond grains may have great contribution to the adhesive strength between the film and the substrate, and the overlapping ball like blocks consisted of nanometer sized diamond crystals may contribute much to the very low roughness of diamond film. Adhesive strength and quality of diamond film were evaluated by scanning electron microscope (SEM), atomic force microscope (AFM), Raman spectrum and drilling experiments. The ring-block tribological experiments were also conducted and the results revealed that the friction coefficient increased with the surface roughness of the diamond film. From a practical viewpoint, the cutting performances of diamond-coated drills were studied by drilling the SiC particles reinforced aluminum-matrix composite. The good adhesive strength and low surface roughness of flute were proved to be beneficial to the good chip evacuation and the decrease of thrust and consequently led to a prolonged tool lift and an improved machining quality. The wear mechanism of diamond-coated drills is the abrasive mechanical attrition.