Publications

Detailed Information

Stable, non-Reflective Condition of Perfectly Matched Layer in Computational Aeroacoustics : 전산공력음향학에서 Perfectly Matched Layer의 안정적인 흡수조건에 관한 연구

Cited 0 time in Web of Science Cited 0 time in Scopus
Authors

정한아침

Advisor
이수갑
Major
공과대학 기계항공공학부
Issue Date
2016-02
Publisher
서울대학교 대학원
Keywords
High-order Finite DifferenceDispersion-RelationStability AnalysisComputational AeroacousticsPerfectly Matched Layer
Description
학위논문 (석사)-- 서울대학교 대학원 : 기계항공공학부 우주항공공학전공, 2016. 2. 이수갑.
Abstract
In Computational Aeroacoustics, non-reflective boundary conditions such as radiation or absorbing boundary conditions are critical issues in that they can affect the whole solutions of computation. Among these types of boundary conditions, Perfectly Matched Layer boundary condition which has been widely used in Computational Electromagnetics and Computational Aeroacoustics is developed by augmenting the additional term by an absorption function in the original governing equations so as to stably absorb the outgoing waves. Even if Perfectly Matched Layer is perfectly non-reflective boundary condition analytically, spurious waves at the interface or instability could be shown since the analysis is performed in the discretized space. Hence, the study is focused on factors that affect these numerical instability and accuracy with particular numerical schemes. First, stability analysis preserving the dispersion relation is carried out in order to achieve the stability limit of time-step size. Then, through mathematical approach, stable absorption coefficient and PML width are suggested. In order to validate the prediction of analysis condition, numerical simulations are performed in generalized coordinate system as well as Cartesian coordinate system.
Language
English
URI
https://hdl.handle.net/10371/123858
Files in This Item:
Appears in Collections:

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share