• Title/Summary/Keyword: time domain decomposition

Search Result 147, Processing Time 0.024 seconds

2D Finite Difference Time Domain Method Using the Domain Decomposition Method (영역분할법을 이용한 2차원 유한차분 시간영역법 해석)

  • Hong, Ic-Pyo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.5
    • /
    • pp.1049-1054
    • /
    • 2013
  • In this paper, two-dimensional(2-D) Finite Difference Time Domain(FDTD) method using the domain decomposition method is proposed. We calculated the electromagnetic scattering field of a two dimensional rectangular Perfect Electric Conductor(PEC) structure using the 2-D FDTD method with Schur complement method as a domain decomposition method. Four domain decomposition and eight domain decomposition are applied for the analysis of the proposed structure. To validate the simulation results, the general 2-D FDTD algorithm for the total domain are applied to the same structure and the results show good agreement with the 2-D FDTD using the domain decomposition method.

ITERATIVE ALGORITHMS AND DOMAIN DECOMPOSITION METHODS IN PARTIAL DIFFERENTIAL EQUATIONS

  • Lee, Jun Yull
    • Korean Journal of Mathematics
    • /
    • v.13 no.1
    • /
    • pp.113-122
    • /
    • 2005
  • We consider the iterative schemes for the large sparse linear system to solve partial differential equations. Using spectral radius of iteration matrices, the optimal relaxation parameters and good parameters can be obtained. With those parameters we compare the effectiveness of the SOR and SSOR algorithms. Applying Crank-Nicolson approximation, we observe the error distribution according to domain decomposition. The number of processors due to domain decomposition affects time and error. Numerical experiments show that effectiveness of SOR and SSOR can be reversed as time size varies, which is not the usual case. Finally, these phenomena suggest conjectures about equilibrium time grid for SOR and SSOR.

  • PDF

Comparison of wavelet-based decomposition and empirical mode decomposition of electrohysterogram signals for preterm birth classification

  • Janjarasjitt, Suparerk
    • ETRI Journal
    • /
    • v.44 no.5
    • /
    • pp.826-836
    • /
    • 2022
  • Signal decomposition is a computational technique that dissects a signal into its constituent components, providing supplementary information. In this study, the capability of two common signal decomposition techniques, including wavelet-based and empirical mode decomposition, on preterm birth classification was investigated. Ten time-domain features were extracted from the constituent components of electrohysterogram (EHG) signals, including EHG subbands and EHG intrinsic mode functions, and employed for preterm birth classification. Preterm birth classification and anticipation are crucial tasks that can help reduce preterm birth complications. The computational results show that the preterm birth classification obtained using wavelet-based decomposition is superior. This, therefore, implies that EHG subbands decomposed through wavelet-based decomposition provide more applicable information for preterm birth classification. Furthermore, an accuracy of 0.9776 and a specificity of 0.9978, the best performance on preterm birth classification among state-of-the-art signal processing techniques, were obtained using the time-domain features of EHG subbands.

RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION

  • LEE, CHANG-OCK;PARK, JONGHO
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.24 no.2
    • /
    • pp.161-197
    • /
    • 2020
  • Total variation minimization is standard in mathematical imaging and there have been numerous researches over the last decades. In order to process large-scale images in real-time, it is essential to design parallel algorithms that utilize distributed memory computers efficiently. The aim of this paper is to illustrate recent advances of domain decomposition methods for total variation minimization as parallel algorithms. Domain decomposition methods are suitable for parallel computation since they solve a large-scale problem by dividing it into smaller problems and treating them in parallel, and they already have been widely used in structural mechanics. Differently from problems arising in structural mechanics, energy functionals of total variation minimization problems are in general nonlinear, nonsmooth, and nonseparable. Hence, designing efficient domain decomposition methods for total variation minimization is a quite challenging issue. We describe various existing approaches on domain decomposition methods for total variation minimization in a unified view. We address how the direction of research on the subject has changed over the past few years, and suggest several interesting topics for further research.

Performance Analysis of the reconstruction Algorithms in the Stripmap-mode SAR (Stripmap-mode SAR에서의 영상복원 알고리즘의 성능분석)

  • 박현복;김형주;최정희
    • Proceedings of the Korea Electromagnetic Engineering Society Conference
    • /
    • 2000.11a
    • /
    • pp.29-33
    • /
    • 2000
  • The classical image reconstruction for stripmap SAR is based on the Fresnel approximation which utilizes deramping or chirp deconvolution in the synthetic aperture(slow-time) domain. Another approach in formulating stripmap SAR processing and imaging is based on the SAR wavefront reconsturction theory, and analysis of the SAR signal in the slow-time via the spherical wave Fourier decomposition of the radar radiation pattern. In this paper, we compare the Fresnel approximation and the wavefrong reconstruction methods using simulated stripmap SAR dada.

  • PDF

A Time Integration Method for Analysis of Dynamic Systems Using Domain Decomposition Technique

  • Fujikawa Takeshi;Imanishi Etsujiro
    • Journal of Mechanical Science and Technology
    • /
    • v.19 no.spc1
    • /
    • pp.429-436
    • /
    • 2005
  • This paper presents a precise and stable time integration method for dynamic analysis of vibration or multibody systems. A total system is divided into several subsystems and their responses are calculated separately, while the coupling effect is treated equivalently as constant force during time steps. By using iterative procedure to improve equivalent coupling forces, a precise and stable solution is obtained. Some examples such as a seismic response and multibody analyses were carried out to demonstrate its usefulness.

Computation of dilute polymer solution flows using BCF-RBFN based method and domain decomposition technique

  • Tran, Canh-Dung;Phillips, David G.;Tran-Cong, Thanh
    • Korea-Australia Rheology Journal
    • /
    • v.21 no.1
    • /
    • pp.1-12
    • /
    • 2009
  • This paper reports the suitability of a domain decomposition technique for the hybrid simulation of dilute polymer solution flows using Eulerian Brownian dynamics and Radial Basis Function Networks (RBFN) based methods. The Brownian Configuration Fields (BCF) and RBFN method incorporates the features of the BCF scheme (which render both closed form constitutive equations and a particle tracking process unnecessary) and a mesh-less method (which eliminates element-based discretisation of domains). However, when dealing with large scale problems, there appear several difficulties: the high computational time associated with the Stochastic Simulation Technique (SST), and the ill-condition of the system matrix associated with the RBFN. One way to overcome these disadvantages is to use parallel domain decomposition (DD) techniques. This approach makes the BCF-RBFN method more suitable for large scale problems.

ADVANCED DOMAIN DECOMPOSITION METHOD BY LOCAL AND MIXED LAGRANGE MULTIPLIERS

  • Kwak, Junyoung;Chun, Taeyoung;Cho, Haeseong;Shin, Sangjoon;Bauchau, Olivier A.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.18 no.1
    • /
    • pp.17-26
    • /
    • 2014
  • This paper presents development of an improved domain decomposition method for large scale structural problem that aims to provide high computational efficiency. In the previous researches, we developed the domain decomposition algorithm based on augmented Lagrangian formulation and proved numerical efficiency under both serial and parallel computing environment. In this paper, new computational analysis by the proposed domain decomposition method is performed. For this purpose, reduction in computational time achieved by the proposed algorithm is compared with that obtained by the dual-primal FETI method under serial computing condition. It is found that the proposed methods significantly accelerate the computational speed for a linear structural problem.

Development of longitudinal acceleration wave decomposition method with single point measurement (단일 위치에서의 측정을 이용한 가속도 종파 분리 방법의 개발)

  • Jung, B.;Park, Y.;Park, Youn-Sik
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2006.05a
    • /
    • pp.629-633
    • /
    • 2006
  • We investigated a new longitudinal acceleration wave decomposition method in time domain. The proposed method separates up- and down-stream waves with an axial strain and axial acceleration measured at a single point on the transmission path. The advantages such as low computation load and easy implementation would be possible by developing time domain under the following assumptions; low frequency range, uniform cross sectional area and elastic wave propagation. We confirmed the feasibility and performance of the method through experiment using Split Hopkinson Pressure Bar (SHPB). The method can be effective in several applications, including active vibration control with wave view point, where real time wave decomposition is necessary.

  • PDF

Reliability analysis of wind-excited structures using domain decomposition method and line sampling

  • Katafygiotis, L.S.;Wang, Jia
    • Structural Engineering and Mechanics
    • /
    • v.32 no.1
    • /
    • pp.37-53
    • /
    • 2009
  • In this paper the problem of calculating the probability that the responses of a wind-excited structure exceed specified thresholds within a given time interval is considered. The failure domain of the problem can be expressed as a union of elementary failure domains whose boundaries are of quadratic form. The Domain Decomposition Method (DDM) is employed, after being appropriately extended, to solve this problem. The probability estimate of the overall failure domain is given by the sum of the probabilities of the elementary failure domains multiplied by a reduction factor accounting for the overlapping degree of the different elementary failure domains. The DDM is extended with the help of Line Sampling (LS), from its original presentation where the boundary of the elementary failure domains are of linear form, to the current case involving quadratic elementary failure domains. An example involving an along-wind excited steel building shows the accuracy and efficiency of the proposed methodology as compared with that obtained using standard Monte Carlo simulations (MCS).