Helicopter Rotor Flow Analysis Using Mapped Chebyshev Pseudospectral Method and Overset Mesh Topology

Abstract

Unsteady helicopter rotor flows are solved by a Chebyshev pseudospectral method with overset mesh topology which employs Chebyshev polynomials for solution approximation and a Chebyshev collocation operator to represent the time derivative term of the unsteady flow governing equations. Spatial derivative terms of the flux Jacobians are discretized implicitly while the Chebyshev spectral derivative term is treated in explicit form. Unlike the Fourier spectral method, collocation points of standard Chebyshev polynomials are not evenly distributed and heavily clustered near the extremities of the time interval, which makes the spectral derivative matrix ill-conditioned and deteriorates the stability and convergence of the flow solution. A conformal mapping of an arcsin function is applied to redistribute those points more evenly and thus to improve the numerical stability of the linear system. A parameter study on the condition number of the spectral derivative matrix with respect to the control parameters of the mapping function is also carried out. For the validation of the proposed method, both periodic and nonperiodic unsteady flow problems were solved with two-dimensional problems: an oscillating airfoil with a fixed frequency and a plunging airfoil with constant plunging speed without considering gravitational force. Computation results of the Chebyshev pseudospectral method showed excellent agreements with those of the time-marching computation. Subsequently, helicopter rotor flows in hovering and nonlifting forward flight are solved. Moving boundaries of the rotating rotor blades are efficiently managed by the overset mesh topology. As a set of subgrids are constructed only one time at the beginning of the solution procedure corresponding to the mapped Chebyshev collocation points, computation time for mesh interpolation of hole-cutting between background and near-body grids becomes drastically reduced when compared to the time-marching computation method where subgrid movement and the hole-cutting need to be carried out at each physical time step. The number of the collocation points was varied to investigate the sensitivity of the solution accuracy, computation time, and memory. Computation results are compared with those from the time-marching computation, the Fourier spectral method, and wind-tunnel experimental data. Solution accuracy and computational efficiency are concluded to be great with the Chebyshev pseudospectral method. Further applications to unsteady nonperiodic problems will be left for future work.

A novel adaptive pseudospectral method for the optimal control problem of automatic car parking

“…The autonomous parking control problem, in essence, is an optimal control problem [11]. In recent decades, pseudospectral methods have been used extensively to achieve numerical solutions to optimal control problems [12,13]. The basis of pseudospectral methods is the approximation of the state using a set of basis functions.…”

Convergence for the optimal control problems using collocation at Legendre-Gauss points

“…A pseudospectral method is a classic example of the direct method. The pseudospectral methods have been used extensively to achieve numerical solutions to optimal control problems by Garg et al (2011), Chen et al (2021), Im and Choi (2018), and Liu et al (2014). Elnagar and Kazemi (1995) published a paper on the Legendre pseudospectral methods in IEEE Transactions on Automatic Control and explained the basic steps of discretizing the optimal control problem into an algebraic nonlinear programming problem, which marked the formal rise of the pseudospectral method.…”