• Journal of applied mathematics & informatics
• /
• 제28권5_6호
• /
• pp.1131-1141
• /
• 2010

We develop an algorithm for computing a sparse approximate inverse for a nonsymmetric positive definite matrix based upon the FFAPINV algorithm. The sparse approximate inverse is computed in the factored form and used to work with some Krylov subspace methods. The preconditioner is breakdown free and, when used in conjunction with Krylov-subspace-based iterative solvers such as the GMRES algorithm, results in reliable solvers. Some numerical experiments are given to show the efficiency of the preconditioner.

• Structural Engineering and Mechanics
• /
• 제59권1호
• /
• pp.187-207
• /
• 2016

Practical ambient excitations of engineering structures usually do not comply with the stationary-white-noise assumption in traditional operational modal analysis methods due to heavy traffic, wind guests, and other disturbances. In order to eliminate spurious modes induced by non-white noise inputs, the improved stochastic subspace identification based on a delay index is proposed in this paper for a representative kind of stationary non-white noise ambient excitations, which have nonzero autocorrelation values near the vertical axis. It relaxes the stationary-white-noise assumption of inputs by avoiding corresponding unqualified elements in the Hankel matrix. Details of the improved stochastic subspace identification algorithms and determination of the delay index are discussed. Numerical simulations on a four-story frame and laboratory vibration experiments on a simply supported beam have demonstrated the accuracy and reliability of the proposed method in eliminating spurious modes under non-white noise ambient excitations.

• Nuclear Engineering and Technology
• /
• 제54권11호
• /
• pp.4280-4295
• /
• 2022

In this paper, a new multi-group neutron-gamma transport calculation code system STRAUM-MATXST for complicated geometrical problems is introduced and its development status including numerical tests is presented. In this code system, the MATXST (MATXS-based Cross Section Processor for S_N Transport) code generates multi-group neutron and gamma cross sections by processing MATXS format libraries generated using NJOY and the STRAUM (S_N Transport for Radiation Analysis with Unstructured Meshes) code performs multi-group neutron-gamma coupled transport calculation using tetrahedral meshes. In particular, this work presents the recent implementation and its test results of the Krylov subspace methods (i.e., Bi-CGSTAB and GMRES(m)) with preconditioners using DSA (Diffusion Synthetic Acceleration) and TSA (Transport Synthetic Acceleration). In addition, the Krylov subspace methods for accelerating the energy-group coupling iteration through thermal up-scatterings are implemented with new multi-group block DSA and TSA preconditioners in STRAUM.

• Interaction and multiscale mechanics
• /
• 제1권2호
• /
• pp.211-230
• /
• 2008

Owing to the growing size of the eigenvalue problem and the growing number of eigenvalues desired, solution methods of iterative nature are becoming more popular than ever, which however suffer from low efficiency and lack of proper convergence criteria. In this paper, three efficient iterative eigenvalue algorithms are considered, i.e., subspace iteration method, iterative Ritz vector method and iterative Lanczos method based on the cell sparse fast solver and loop-unrolling. They are examined under the mode error criterion, i.e., the ratio of the out-of-balance nodal forces and the maximum elastic nodal point forces. Averagely speaking, the iterative Ritz vector method is the most efficient one among the three. Based on the mode error convergence criteria, the eigenvalue solvers are shown to be more stable than those based on eigenvalues only. Compared with ANSYS's subspace iteration and block Lanczos approaches, the subspace iteration presented here appears to be more efficient, while the Lanczos approach has roughly equal efficiency. The methods proposed are robust and efficient. Large size tests show that the improvement in terms of CPU time and storage is tremendous. Also reported is an aggressive shifting technique for the subspace iteration method, based on the mode error convergence criteria. A backward technique is introduced when the shift is not located in the right region. The efficiency of such a technique was demonstrated in the numerical tests.

• 한국정보과학회논문지:데이타베이스
• /
• 제35권2호
• /
• pp.182-191
• /
• 2008

대부분의 스카이라인 질의에 대한 이전 연구들은 대상 객체의 정적 속성만을 고려하였다. 최근에는 모바일 응용 환경의 발전에 따라 이동 객체에 대한 연속적인 스카이라인 질의에 대한 필요성이 증대되고 있다. 연속적인 스카이라인 질의를 처리하기 위해 최근에 몇 가지 기법들이 제안되었지만, 이 기법들은 사용자가 관심을 가지는 일부 속성을 임의로 선택하는 부분차원 스카이라인 질의에 대해서는 고려하지 않았다. 이로 인하여 이동 객체와 부분차원을 동시에 고려해야 하는 모바일 응용에 있어서는 이전 연구들을 적용할 수 없다. 이 논문에서는 질의 시점에 이동 객체의 부분차원 스카이라인을 효율적으로 계산하기 위한 지배 객체 기반 가지치기 기법을 제안한다. 그리고 제안한 기법의 효율성을 증명하기 위해 모의실험을 통한 성능 평가를 수행한다.

• Structural Engineering and Mechanics
• /
• 제81권4호
• /
• pp.411-428
• /
• 2022

This paper presents the Campbell diagram analysis of the rotordynamic system using the full order model (FOM) and the reduced order model (ROM) techniques to determine the critical speeds, identify the stability and reduce the computational time. Due to the spin-speed-dependent matrices (e.g., centrifugal stiffening matrix), several model order reduction (MOR) techniques may be considered, such as the modal superposition (MS) method and the Krylov subspace-based MOR techniques (e.g., Ritz vector (RV), quasi-static Ritz vector (QSRV), multifrequency quasi-static Ritz vector (MQSRV), multifrequency/ multi-spin-speed quasi-static Ritz vector (MMQSRV) and the combined Ritz vector & modal superposition (RV+MS) methods). The proposed MMQSRV method in this study is extended from the MQSRV method by incorporating the rotational-speed-dependent stiffness matrices into the Krylov subspace during the MOR process. Thus, the objective of this note is to respond to the question of whether to use the MS method or the Krylov subspace-based MOR technique in establishing the Campbell diagram of the shaft-disc-blade assembly systems in three-dimensional (3D) finite element analysis (FEA). The Campbell diagrams produced by the FOM and various MOR methods are presented and discussed thoroughly by computing the norm of relative errors (ER). It is found that the RV and the MS methods are dominant at low and high rotating speeds, respectively. More precisely, as the spinning velocity becomes large, the calculated ER produced by the RV method is significantly increased; in contrast, the ER produced by the MS method is smaller and more consistent. From a computational point of view, the MORs have substantially reduced the time computing considerably compared to the FOM. Additionally, the verification of the 3D FE rotordynamic model is also provided and found to be in close agreement with the existing solutions.

• 응용통계연구
• /
• 제34권3호
• /
• pp.507-521
• /
• 2021

고차원 자료에서 이상치를 탐지하기 위해서는 변수를 선별해야 할 필요성이 있다. 이상치 탐지에 적합한 정보가 종종 일부 변수에만 포함되어 있기 때문이다. 많은 수의 부적합한 변수가 자료에 포함될 경우 모든 관측치의 거리가 비슷해지는 집중효과가 발생하고 이로 인해 모든 관측치의 이상정도가 비슷해지는 문제가 발생하게 된다. 부분공간 이상치 탐지기법은 전체 변수 중 이상치 탐지에 적합한 변수들의 집합을 선별하여 관측치의 이상정도를 측정함으로써 이러한 문제를 극복한다. 본 논문은 대표적인 부분공간 이상치 탐지기법을 부분공간 선정 방식에 따라 세가지 유형으로 분류하고 각 유형에 속한 방법론을 부분공간 선정 기준과 이상 정도 측정 방식에 따라 요약한다. 더하여, 부분공간 이상치 탐지기법들을 적용할 수 있는 컴퓨팅 프로그램을 소개하고 집중효과에 대한 간단한 가상 실험과 자료 분석 결과를 제시한다.

• 대한전자공학회논문지SP
• /
• 제47권1호
• /
• pp.35-43
• /
• 2010

고유얼굴 기반 얼굴 인식 방법과 같은 얼굴 형태 기반 얼굴 인식 방법에 사용되는 1차원 PCA는 고차원의 얼굴 형태 데이터 벡터들의 처리로 인하여 부정확한 얼굴 표현과 과도한 계산량을 초래할 수 있다. 이에 개선 방안의 하나로 2차원 PCA 기반 얼굴 인식 방법이 개발되었다. 그러나 단순한 2차원 PCA 적용으로 얻어진 얼굴 표현 모델에는 얼굴 공통 특성 성분과 개인 식별 특성 성분이 모두 포함된다. 얼굴 공통 특성 성분은 오히려 개인 식별 능력을 방해할 수가 있고 또한 인식 처리 시간의 증가를 초래한다. 본 논문에서는 2차원 PCA 적용으로 얻어진 얼굴 특성 공간에서 얼굴 공통 특성 영향이 분리된 얼굴 고유 식별 특성 부분공간 모델을 개발하고 개발된 모델에 기반한 새로운 강인한 얼굴 인식 방법을 제안한다. 제안한 얼굴 고유식별 특성 부분공간 모델 기반 얼굴 인식 방법은 얼굴 고유 식별 특성에만 주로 의존하기 때문에 기존 1차원 PCA 및 2차원 PCA 기반 얼굴 인식 방법보다 얼굴 인식 성능 및 인식 속도에 대해서 더 우수한 성능을 보인다. 이는 다양한 조명 조건하에 다양한 얼굴 자세를 갖는 얼굴 이미지들로 구성된 Yale A 및 IMM 얼굴 데이터베이스를 이용한 실험을 통해 확인하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1999년도 제14차 학술회의논문집
• /
• pp.121-124
• /
• 1999

Subspace-based state space system identification (4SID) methods have been demonstrated to per-form well in a number of applications, but the properties of these have not been fully analyzed or understood yet. For applying the methods, no assumptions on structure of realization are needed and any coordinate transformation is allowed for the estimates. This is one reason why many kinds of properties expected for identification procedures have not been clarified yet. We illustrate, by using Schur complement, an interpretation of the R matrix yielded by the QR factorization in the 4SID procedure. The results in this paper can be useful for analysis of properties of parameters obtained by 4SID methods.

• Nuclear Engineering and Technology
• /
• 제49권6호
• /
• pp.1114-1124
• /
• 2017

Acceleration/preconditioning strategies available in the SCEPTRE radiation transport code are described. A flexible transport synthetic acceleration (TSA) algorithm that uses a low-order discrete-ordinates ($S_N$) or spherical-harmonics ($P_N$) solve to accelerate convergence of a high-order $S_N$ source-iteration (SI) solve is described. Convergence of the low-order solves can be further accelerated by applying off-the-shelf incomplete-factorization or algebraic-multigrid methods. Also available is an algorithm that uses a generalized minimum residual (GMRES) iterative method rather than SI for convergence, using a parallel sweep-based solver to build up a Krylov subspace. TSA has been applied as a preconditioner to accelerate the convergence of the GMRES iterations. The methods are applied to several problems involving electron transport and problems with artificial cross sections with large scattering ratios. These methods were compared and evaluated by considering material discontinuities and scattering anisotropy. Observed accelerations obtained are highly problem dependent, but speedup factors around 10 have been observed in typical applications.