Search NASA⌕ Search

Engineering topics

Auriault, Laurent

Publications and source records attributed to Auriault, Laurent.

Perfectly Matched Layer for Linearized Euler Equations in Open and Ducted Domains

Recently, perfectly matched layer (PML) as an absorbing boundary condition has widespread applications. The idea was first introduced by Berenger for electromagnetic waves computations. In this paper, it is shown that the PML equations for the linearized Euler equations support unstable solutions when the mean flow has a component normal to the layer. To suppress such unstable solutions so as to render the PML concept useful for this class of problems, it is proposed that artificial selective damping terms be added to the discretized PML equations. It is demonstrated that with a proper choice of artificial mesh Reynolds number, the PML equations can be made stable. Numerical examples are provided to illustrate that the stabilized PML performs well as an absorbing boundary condition. In a ducted environment, the wave mode are dispersive. It will be shown that the group velocity and phase velocity of these modes can have opposite signs. This results in a confined environment, PML may not be suitable as an absorbing boundary condition.

Tam, Christopher K. W.↗

Time-Domain Impedance Boundary Conditions for Computational Aeroacoustics

It is an accepted practice in aeroacoustics to characterize the properties of an acoustically treated surface by a quantity known as impedance. Impedance is a complex quantity. As such, it is designed primarily for frequency-domain analysis. Time-domain boundary conditions that are the equivalent of the frequency-domain impedance boundary condition are proposed. Both single frequency and model broadband time-domain impedance boundary conditions are provided. It is shown that the proposed boundary conditions, together with the linearized Euler equations, form well-posed initial boundary value problems. Unlike ill-posed problems, they are free from spurious instabilities that would render time-marching computational solutions impossible.

Tam, Christopher K. W.↗