• 한국측량학회지
• /
• 제26권1호
• /
• pp.85-91
• /
• 2008

수평조정망과 같이 커다란 희소행렬(sparse matrix)을 계산할 때, 시간적 효율 및 공간적 효율을 높이기 위해서 재배열(reordering) 과정을 거치게 된다. 본 연구에서는 SMMS(Sparse Matrix Manip ulation System) 프로그램을 이용해서 희소행렬의 원소를 각각의 재배열 방법으로 재배열 한 후, 전체 계산에 걸리는 시간과 치환배열을 구해 해를 구하는 과정시 발생하는 Fill-in의 개수를 계산해서 각 방법의 효율성을 비교하였다. 그 결과, Minimum Bandwidth 기반의 GPS(Gibbs-Poole-Stockmeyer), RCM(Reverse Cuthill-Mckee) 방법보다 최소 차수(Minimum Degree) 기반의 MD(Minimum Degree), MMD(Mutiple Minimum Degree) 방법이 더 효율적인 모습을 보여주었다. 하지만, 행렬의 원소 분포에 따라서 최적의 성능을 보이는 재배열 방법은 달라질 수 있다는 것을 알 수 있었다. 이러한 연구 결과는 향후 전국 기준점의 좌표값 재조정 시, 또는 대규모 측지망 조정 등에서 구성 요소 계산에 필요한 시간, 저장 공간 등의 효율을 높일 수 있는 효과를 기대할 수 있을 것이라 사료된다.

• 대한기계학회논문집B
• /
• 제25권11호
• /
• pp.1581-1593
• /
• 2001

An efficient variable-reordering method for finite element meshes is used and the effect of variable-reordering is investigated. For the element renumbering of unstructured meshes, Cuthill-McKee ordering is adopted. The newsy reordered global matrix has a much narrower bandwidth than the original one, making the ILU preconditioner perform bolter. The effect of variable reordering on the convergence behaviour of saddle point type matrix it studied, which results from P2/P1 element discretization of the Navier-Stokes equations. We also propose and test 'level(0) preconditioner'and 'level(2) ILU preconditioner', which are another versions of the existing 'level(1) ILU preconditioner', for the global matrix generated by P2/P1 finite element method of incompressible Navier-Stokes equations. We show that 'level(2) ILU preconditioner'performs much better than the others only with a little extra computations.

• 정보과학회지
• /
• 제5권2호
• /
• pp.85-89
• /
• 1987

대칭인 sparse 행렬의 bandwidth와 profile을 줄이는 두개의 알고리즘을 보기를 들어비교하였다. 여러 응용분야에서 야기되는 특별한 정사각형 adjacency graph를 갖는 행렬에 대해 실험한 결과 비록 SMBWR- 알고리즘은 Gibbs 알고 리즘보다 실행한 시간은 2배나 늦지만 bandwidth나 profile은 훨씬 더 많이 줄일 수 있음을 보여주고 있다.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.307-316
• /
• 2006

Incomplete LU factorization preconditioning techniques often have difficulty on indefinite sparse matrices. We present hybrid reordering strategies to deal with such matrices, which include new diagonal reorderings that are in conjunction with a symmetric nondecreasing degree algorithm. We first use the diagonal reorderings to efficiently search for entries of single element rows and columns and/or the maximum absolute value to be placed on the diagonal for computing a nonsymmetric permutation. To augment the effectiveness of the diagonal reorderings, a nondecreasing degree algorithm is applied to reduce the amount of fill-in during the ILU factorization. With the reordered matrices, we achieve a noticeable improvement in enhancing the stability of incomplete LU factorizations. Consequently, we reduce the convergence cost of the preconditioned Krylov subspace methods on solving the reordered indefinite matrices.

• 한국멀티미디어학회논문지
• /
• 제7권6호
• /
• pp.781-790
• /
• 2004

This paper presents a fourth-order cumulants based iterative algorithm for blind channel equalization. It is robust with respect to the existence of heavy Gaussian noise in a channel and does not require the minimum phase characteristic of the channel. In this approach, the transmitted signals at the receiver are over-sampled to ensure the channel described by a full-column rank matrix. It changes a single-input/single-output (SISO) finite-impulse response (FIR) channel to a single-input/multi-output (SIMO) channel. Based on the properties of the fourth-order cumulants of the over-sampled channel outputs, the iterative algorithm is derived to estimate the deconvolution matrix which makes the overall transfer matrix transparent, i.e., it can be reduced to the identity matrix by simple reordering and scaling. Both a closed-form and a stochastic version of the proposed algorithm are tested with three-ray multi-path channels in simulation studies, and their performances are compared with a method based on conventional second-order cumulants. Relatively good results are achieved, even when the transmitted symbols are significantly corrupted with Gaussian noise.

• 전기의세계
• /
• 제39권3호
• /
• pp.47-54
• /
• 1990

유한요소법과 경계요소법의 합성으로 전자계 해석을 하는 기법은 각 방법의 장점을 수용하여 경계가 없는 무한영역의 전자장을 분석하는 기법으로서 어떤 복잡하고 어려운 기하학적 구조의 문제도, 비선형이나 비균질성 재질의 문제도 쉽게 formulation이 가능하여 용이하게 해석할 수 있지만 전체 System matrix방정식이 비대칭이며 부분적인 full matrix를 형성하여 계산시간이 길어 진다는 단점도 있다. 적용예에서 보여 준 것과 같이 합성요소법은 그 해가 실제에 근사한 값을 가질수 있다고 생각되며, 계산시간을 단축시키기 위하여 직접법이나 반복법을 사용한 새로운 해법들이 도입되고 있다. 최근에는 system전체 node의 순서를 고려한 NDRA(Nested Dissection Reordering Algorithm)이 도입되고 있고, System matrix자체를 유한 요소법의 형태로 유지시키며 풀수 있는 방법으로 알려진 Absorbin 경계조건을 사용하여 전자파에 대한 해석을 하고 있다. 유한 및 경계요소 합성법은 초고압 옥외용 전력기기의 전자장 해석과 설계, 레이다나 안테나 등의 전자파 해석문제, 초전도 응용, 전력기기의 전자장해석과 설계, 우주공간에서의 전력전송문제 등을 쉽게 model화하여 적용할 수 있을 것이다.

• Structural Engineering and Mechanics
• /
• 제76권3호
• /
• pp.395-412
• /
• 2020

In this article, the values of internal force and deformation of a curved beam under any action with the firm or elastic supports are determined by using structural matrices. The article presents the general differential formulation of a curved beam in global coordinates, which is solved in an orderly manner using simple integrals, thus obtaining the transfer matrix expression. The matrix expression of rigidity is obtained through reordering operations on the transfer notation. The support conditions, firm or elastic, provide twelve equations. The objective of this article is the construction of the algebraic system of order twenty-four, twelve transfer equations and twelve support equations, which relates the values of internal force and deformation associated with the two ends of the directrix of the curved beam. This final algebraic system, expressed in matrix form, is divided into two subsystems: twelve algebraic equations of internal force and twelve algebraic equations of deformation. The internal force and deformation values for any point in the curved beam directrix are determined from these values in the initial position. The five examples presented show how to apply the matrix procedures developed in this article, whether they are curved beams with the firm or elastic support.

• 대한조선학회논문집
• /
• 제56권1호
• /
• pp.1-10
• /
• 2019

Naval ship design and related other activities can be characterized by the complexity of the interactions among products, activities, and disciplines. Such complexities often result in inferior designs, cost overrun, and late-delivery. Hence there exist tremendous interests in both improving the design process itself and optimizing the interactions among design activities. This paper looks at the complexity of designing naval ships thereby leading to the innovation of current ship design practices using design structure matrix. It can be used to induce the optimal ordering of design activities as well as identify sources of complexities. The method presented here identifies coupled design activities useful for reducing the complexity of naval ship design as well as optimally reordering design activities. This paper recommends the use of design structure matrix method suitable for numerically optimizing the concept design process of naval ship, and reducing cost and time required in designing naval ships by modeling and analyzing the design activities and engineering tasks, defined in systems engineering planning documents.

• Fibers and Polymers
• /
• 제4권3호
• /
• pp.97-101
• /
• 2003

Polymer/silicate nanocomposites were prepared via two-step manufacturing process: a master batch preparation and then mixing with matrix polymer. A hybrid of PMMA and Na-MMT with exfoliated structure was first prepared by emulsion polymerization of MMA in the presence of Na-MMT. For the case that SAN24, miscible with PMMA, is used as matrix, we could prepare a nanocomposite with exfoliated structure. However, SAN31 nanocomposite shows the aggregation and/or reordering of the silicate layers due to the immiscibility between SAN31 and PMMA.

• 대한산업공학회지
• /
• 제29권1호
• /
• pp.78-89
• /
• 2003

Ordering is performed to reduce the amount of fill-ins of the Cholesky factor of a symmetric positive definite matrix. This paper proposes a new ordering algorithm that reduces the fill-ins of the Cholesky factor iteratively by elimination tree rotations and clique separators. Elimination tree rotations have been used mainly to reorder the rows of the permuted matrix for the efficiency of storage space management or parallel processing, etc. In the proposed algorithm, however, they are repeatedly performed to reduce the fill-ins of the Cholesky factor. In addition, we presents a simple method for finding a minimal node separator between arbitrary two nodes of a chordal graph. The proposed reordering procedure using clique separators enables us to obtain another order of rows of which the number of till-ins decreases strictly.