• East Asian mathematical journal
• /
• 제37권3호
• /
• pp.295-305
• /
• 2021

In this paper, we analyze the efficiency of a domain decomposition method for the two-dimensional telegraph equations. We formulate the theoretical spectral radius of the iteration matrix generated by the domain decomposition method, because the rate of convergence of an iterative algorithm depends on the spectral radius of the iteration matrix. The theoretical spectral radius is confirmed by the experimental one using MATLAB. Speedup and operation ratio of the domain decomposition method are also compared as the two measurements of the efficiency of the method. Numerical results support the high efficiency of the domain decomposition method.

• East Asian mathematical journal
• /
• 제39권1호
• /
• pp.75-85
• /
• 2023

In this paper, a non-overlapping rectangular domain decomposition method is presented in order to numerically solve two-dimensional telegraph equations. The method is unconditionally stable and efficient. Spectral radius of the iteration matrix and convergence rate of the method are provided theoretically and confirmed numerically by MATLAB. Numerical experiments of examples are compared with several methods.

• 대한기계학회논문집B
• /
• 제22권7호
• /
• pp.1030-1040
• /
• 1998

One of the main unresolved issues in large-eddy simulation(LES) of wall-bounded turbulent flows is the requirement of high spatial resolution in the near-wall region, especially in the spanwise direction. Such high resolution required in the near-wall region is generally used throughout the computational domain, making simulations of high Reynolds number, complex-geometry flows prohibitive. A grid-embedding strategy using a nonconforming spectral domain-decomposition method is proposed to address this limitation. This method provides an efficient way of clustering grid points in the near-wall region with spectral accuracy. LES of transitional and turbulent channel flow has been performed to evaluate the proposed grid-embedding technique. The computational domain is divided into three subdomains to resolve the near-wall regions in the spanwise direction. Spectral patching collocation methods are used for the grid-embedding and appropriate conditions are suggested for the interface matching. Results of LES using the grid-embedding strategy are promising compared to LES of global spectral method and direct numerical simulation. Overall, the results show that the spectral domain-decomposition grid-embedding technique provides an efficient method for resolving the near-wall region in LES of complex flows of engineering interest, allowing significant savings in the computational CPU and memory.

• 한국음향학회지
• /
• 제21권3호
• /
• pp.315-322
• /
• 2002

본 논문에서는 음성 신호 시간축 분할의 새로운 기법으로, 비트율과 왜곡을 함께 고려한 기법이 제안되었다. 시간축 분할에 필요한 보간 함수는 학습 음성 데이터로부터 얻어진다. 보간 함수는 두 타겟간의 길이에 따라 유일하게 결정되므로 보간 함수는 추가 정보없이 표현된다. 타겟 샘플은 비트율을 최소화시키면서 동시에 최대 스펙트럼 오차가 문턱 치보다 작게 되도록 선택하였다. 제안된 기법은 음성 부호화기의 스펙트럼 변수로 널리 사용되는 LSP계수의 부호화에 적용되었으며, 모의실험 결과 평균적으로 8 bits/Frame의 비트율에서 1.4 dB의 스펙트럼 왜곡이 얻어짐을 알 수 있었다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.33.5-33
• /
• 2001

We consider here the problem of spectral estimation of multidimensional wide sense stationary (WSS) random process. A method, employing a special difference equation of correlation function, is proposed to solve the problem of multidimensional spectral estimation. In this approach, the special difference equation of correlation function is derived by modal decomposition method. Maximum likelihood estimator and Kalman filter are used to estimate the model parameters of the difference equation and the decomposed spectral residues. An algorithm is presented to estimate the multidimensional spectral density. According to the result of the simulation, these methods are feasible to estimate the spectral density of WSS process, which is realized by finite dimensional multivariable lineal system driven by white noise.

• 전자공학회논문지
• /
• 제52권2호
• /
• pp.162-170
• /
• 2015

컴뮤트 타임 임베딩을 구현하려면 그래프 라플라시안 행렬의 고유값과 고유벡터를 구하여야 하는데, $o(n^3)$의 계산량이 요구되어 대용량 데이터에는 적용하기 어려운 문제가 있다. 이를 줄이기 위하여 표본화 과정을 통하여 크기가 줄어든 그래프 라플라시안 행렬에서 구한 다음, 원래의 고유값과 고유벡터를 근사화시키는 Nystr${\ddot{o}}$m 기법을 주로 채택한다. 이 과정에서 많은 오차가 발생하는데, 이를 개선하기 위하여 본 논문에서는 그래프 라플라시안 대신에 가중치 행렬을 표본화하고 이로부터 구한 고유값과 고유벡터를 그래프 라플라시안의 고유값과 고유벡터로 변환하는 기법을 이용하여 대용량 데이터로 구성된 스펙트럴 그래프를 근사적으로 컴뮤트 타임 임베딩하는 기법을 제안한다. 하지만, 이 방식도 스펙트럼 분해를 계산하여야 하므로 데이터의 크기가 증가하면 적용하기 어려운 문제가 발생한다. 이의 대안으로, 스펙트럼 분해를 계산하지 않고도 데이터 집합의 크기에 영향을 받지 않으면서 컴뮤트 타임을 근사적으로 계산하는 방식을 구현하고 이들의 특성을 실험적으로 분석한다.

• Structural Engineering and Mechanics
• /
• 제17권3_4호
• /
• pp.445-466
• /
• 2004

In this paper, several modal identification techniques for output-only structural systems are extensively investigated. The methods considered are the power spectral method, the frequency domain decomposition method, the Ibrahim time domain method, the eigensystem realization algorithm, and the stochastic subspace identification method. Generally, the power spectral method is most widely used in practical area, however, the other methods may give better estimates particularly for the cases with closed modes and/or with large measurement noise. Example analyses were carried out on typical structural systems under three different loading cases, and the identification performances were examined throught the comparisons between the estimates by various methods.

• Journal of Radiation Protection and Research
• /
• 제42권2호
• /
• pp.91-97
• /
• 2017

Background: A gamma energy identifying algorithm using spectral decomposition combined with smoothing method was suggested to confirm the existence of the artificial radio isotopes. The algorithm is composed by original pattern recognition method and smoothing method to enhance the performance to identify gamma energy of radiation sensors that have low energy resolution. Materials and Methods: The gamma energy identifying algorithm for the compact radiation sensor is a three-step of refinement process. Firstly, the magnitude set is calculated by the original spectral decomposition. Secondly, the magnitude of modeling error in the magnitude set is reduced by the smoothing method. Thirdly, the expected gamma energy is finally decided based on the enhanced magnitude set as a result of the spectral decomposition with the smoothing method. The algorithm was optimized for the designed radiation sensor composed of a CsI (Tl) scintillator and a silicon pin diode. Results and Discussion: The two performance parameters used to estimate the algorithm are the accuracy of expected gamma energy and the number of repeated calculations. The original gamma energy was accurately identified with the single energy of gamma radiation by adapting this modeling error reduction method. Also the average error decreased by half with the multi energies of gamma radiation in comparison to the original spectral decomposition. In addition, the number of repeated calculations also decreased by half even in low fluence conditions under $10^4$ ($/0.09cm^2$ of the scintillator surface). Conclusion: Through the development of this algorithm, we have confirmed the possibility of developing a product that can identify artificial radionuclides nearby using inexpensive radiation sensors that are easy to use by the public. Therefore, it can contribute to reduce the anxiety of the public exposure by determining the presence of artificial radionuclides in the vicinity.

• 대한의용생체공학회:의공학회지
• /
• 제8권1호
• /
• pp.69-74
• /
• 1987

The power spectrum of background EEG is estimated by the Plsarenko Harmonic Decomposition with the stochastic process whlch consists of the nonhamonic sinus Bid and the white nosie. The estimation results are examined and compared with the results from the maximum entropy spectral extimation, and the optimal order of this from the maximum entropy spectral extimation, and the optimal order of this model can be determined from the eigen value's fluctuation of autocorrelation of background EEG. From the comparing results, this method is possible to estimate the power spectrum of background EEG.

• Journal of the Korean Statistical Society
• /
• 제22권2호
• /
• pp.249-258
• /
• 1993

It is well known that design matrix X for any factorial design can be represented by a product $X = TX_o$ where T is replication matrix and $X_o$ is the corresponding balanced design matrix. Since $X_o$ consists of regular arrangement of 0's and 1's, we can easily find the spectral decomposition of $X_o',X_o$. Also using this we propose an efficient algorithm for computing the orthogonal projection matrix for a balanced factorial design.