• Title/Summary/Keyword: domain decomposition

Search Result 403, Processing Time 0.026 seconds

Development of Centering Method for Automatic Generation of a Quadrilateral Mesh

  • Choi, Jinwoo
    • International Journal of CAD/CAM
    • /
    • v.11 no.1
    • /
    • pp.11-17
    • /
    • 2011
  • A new method has been developed in this paper for automatic quadrilateral mesh generation for a two-dimensional domain. The method is named 'centering method' because it centers a point at the domain and then divides it into sub-domains using cutting lines from the center point. Each of the cutting lines is selected based on the criterion using the angles between the boundary of the domain and the cutting line. The decomposition of the domain into sub-domains is repeated until every subdomain has four or six nodes. Pre-defined splitters are used to divide six-node domains into quadrilateral elements depending on their configuration and presence on the boundary of the initial domain. Arbitrary domains are meshed as examples to verify the robustness of the new method.

  • PDF

Large-eddy simulation of channel flow using a spectral domain-decomposition grid-embedding technique (스펙트럴 영역분할 격자 삽입법을 이용한 채널유동의 큰 에디 모사)

  • Gang, Sang-Mo;Byeon, Do-Yeong;Baek, Seung-Uk
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.22 no.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.

Parallel Preconditioner for the Domain Decomposition Method of the Discretized Navier-Stokes Equation (이산화된 Navier-Stokes 방정식의 영역분할법을 위한 병렬 예조건화)

  • Choi, Hyoung-Gwon;Yoo, Jung-Yul;Kang, Sung-Woo
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.27 no.6
    • /
    • pp.753-765
    • /
    • 2003
  • A finite element code for the numerical solution of the Navier-Stokes equation is parallelized by vertex-oriented domain decomposition. To accelerate the convergence of iterative solvers like conjugate gradient method, parallel block ILU, iterative block ILU, and distributed ILU methods are tested as parallel preconditioners. The effectiveness of the algorithms has been investigated when P1P1 finite element discretization is used for the parallel solution of the Navier-Stokes equation. Two-dimensional and three-dimensional Laplace equations are calculated to estimate the speedup of the preconditioners. Calculation domain is partitioned by one- and multi-dimensional partitioning methods in structured grid and by METIS library in unstructured grid. For the domain-decomposed parallel computation of the Navier-Stokes equation, we have solved three-dimensional lid-driven cavity and natural convection problems in a cube as benchmark problems using a parallelized fractional 4-step finite element method. The speedup for each parallel preconditioning method is to be compared using upto 64 processors.

Design and Analysis of Hollow Section Extrusion using Mismatching Refinement with Domain Decomposition (영역분할에 의한 불일치 격자세분화 기법을 이용한 중공형 압출공정의 설계 및 해석)

  • Park, Geun;Yang, Dong-Yeol
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.4 s.175
    • /
    • pp.1016-1023
    • /
    • 2000
  • The present work is concerned with three-dimensional finite element analysis of the hollow section extrusion process using a porthole die. The effects of related design parameters are discussed through the finite element simulation for extrusion of a triply-connected rectangular tubular section. For economic computation, mismatching refinement, an efficient domain decomposition method with different mesh density for each subdomain, is implemented. In order to obtain the uniform flow at the outlet, design parameters such as the hole size and the hole position are investigated and compared through the numerical analysis. Comparing the velocity distribution with that of the original design, it is concluded that the design modification enables more uniform flow characteristics. The analysis results are then successfully reflected on the industrial porthole die design.

Implementation and Performance Analysis of a Parallel SIMPLER Model Based on Domain Decomposition (영역 분할에 의한 SIMPLER 모델의 병렬화와 성능 분석)

  • Kwak Ho Sang;Lee Sangsan
    • Journal of computational fluids engineering
    • /
    • v.3 no.1
    • /
    • pp.22-29
    • /
    • 1998
  • Parallel implementation is conducted for a SIMPLER finite volume model. The present parallelism is based on domain decomposition and explicit message passing using MPI and SHMEM. Two parallel solvers to tridiagonal matrix equation are employed. The implementation is verified on the Cray T3E system for a benchmark problem of natural convection in a sidewall-heated cavity. The test results illustrate good scalability of the present parallel models. Performance issues are elaborated in view of convergence as well as conventional parallel overheads and single processor performance. The effectiveness of a localized matrix solution algorithm is demonstrated.

  • PDF

PRECONDITIONERS FOR A COUPLED PROBLEM BY A PENALTY TERM ARISEN IN AN AUGMENTED LAGRANGIAN METHOD

  • Lee, Chang-Ock;Park, Eun-Hee
    • Journal of the Korean Mathematical Society
    • /
    • v.57 no.5
    • /
    • pp.1267-1286
    • /
    • 2020
  • We pay attention to a coupled problem by a penalty term which is induced from non-overlapping domain decomposition methods based on augmented Lagrangian methodology. The coupled problem is composed by two parts mainly; one is a problem associated with local problems in non-overlapping subdomains and the other is a coupled part over all subdomains due to the penalty term. For the speedup of iterative solvers for the coupled problem, we propose two different types of preconditioners: a block-diagonal preconditioner and an additive Schwarz preconditioner as overlapping domain decomposition methods. We analyze the coupled problem and the preconditioned problems in terms of their condition numbers. Finally we present numerical results which show the performance of the proposed methods.

Influence of asphalt removal on operational modal analysis of Egebækvej Bridge

  • Umut Yildirim
    • Smart Structures and Systems
    • /
    • v.31 no.2
    • /
    • pp.171-181
    • /
    • 2023
  • Using the most up-to-date system identification methods in both time and frequency domains, the dynamic monitoring data from the reinforced concrete Egebaekvej Bridge near Holte, Denmark, is examined in this investigation. The bridge was erected in the 1960s and was still standing during test campaign before demolishing. The ARTeMIS Modal was adopted to derive the modal parameters from ambient vibration data. Several Operational Modal Analysis (OMA) approaches were applied, including Enhanced Frequency Domain Decomposition (EFDD), Curve-fit Frequency Domain Decomposition (CFDD), and Frequency Domain Decomposition (FDD). Afterward, Principal Component (SSI-PC), Unweighted Principal Component (SSI-UPC) Stochastic Subspace Identification methods were utilized. Danish engineering consulting company, COWI with the allowance of the bridge contractor BARSLUND, allow the researcher for this experimental test to demonstrate the impact of OMA applications.

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

Shape Reconstruction from Unorganized Cloud of Points using Adaptive Domain Decomposition Method (적응적 영역분할법을 이용한 임의의 점군으로부터의 형상 재구성)

  • Yoo Dong-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.23 no.8 s.185
    • /
    • pp.89-99
    • /
    • 2006
  • In this paper a new shape reconstruction method that allows us to construct surface models from very large sets of points is presented. In this method the global domain of interest is divided into smaller domains where the problem can be solved locally. These local solutions of subdivided domains are blended together according to weighting coefficients to obtain a global solution using partition of unity function. The suggested approach gives us considerable flexibility in the choice of local shape functions which depend on the local shape complexity and desired accuracy. At each domain, a quadratic polynomial function is created that fits the points in the domain. If the approximation is not accurate enough, other higher order functions including cubic polynomial function and RBF(Radial Basis Function) are used. This adaptive selection of local shape functions offers robust and efficient solution to a great variety of shape reconstruction problems.

Image Enhancement Using Homomorphic Transformation and Multiscale Decomposition (호모모프변환과 다중 스케일 분해를 이용한 영상향상)

  • Ahn, Sang-Ho;Kim, Ki-Hong;Kim, Young-Choon;Kwon, Ki-Ryong;Seo, Yong-Su
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.8
    • /
    • pp.1046-1057
    • /
    • 2004
  • An image enhancement method using both homomorphic transformation and multiscale decomposition is proposed. The original image is first transformed to homomorphic domain by taking the logarithm, is then separated to multiscales. These multiscales are combined with weighting. The combined signal is exponentially transformed back into intensity domain. In homomorphic domain, the magnitude control of low frequency component make change the dynamic range, and the magnitude control of the other frequency components contribute to enhancement of the contrast. The "${\AA}$ trous" algorithm, which has a simple and efficient scheme, is used for multiscale decomposition. The performance of proposed method is verified by simulation.

  • PDF