TY - JOUR
T1 - Spectrally-accurate immersed boundary conditions method for three-dimensional flows
AU - Sakib, N.
AU - Mohammadi, A.
AU - Floryan, J. M.
PY - 2017/6/1
Y1 - 2017/6/1
N2 - A three-dimensional, spectrally accurate algorithm based on the immersed boundary conditions (IBC) concept has been developed for the analysis of flows in channels bounded by rough boundaries. The algorithm is based on the velocityâ€“vorticity formulation and uses a fixed computational domain with the flow domain immersed in its interior. The geometry of the boundaries is expressed in terms of double Fourier expansions and boundary conditions enter the algorithm in the form of constraints. The spatial discretization uses Fourier expansions in the stream-wise and span-wise directions and Chebyshev expansions in the wall-normal direction. The algorithm can use either the fixed-flow-rate constraint or the fixed-pressure-gradient constraint; a direct implementation of the former constraint is described. An efficient solver which takes advantage of the structure of the coefficient matrix has been developed. It is demonstrated that the applicability of the algorithm can be extended to more extreme geometries using the over-determined formulation. Various tests confirm the spectral accuracy of the algorithm.
AB - A three-dimensional, spectrally accurate algorithm based on the immersed boundary conditions (IBC) concept has been developed for the analysis of flows in channels bounded by rough boundaries. The algorithm is based on the velocityâ€“vorticity formulation and uses a fixed computational domain with the flow domain immersed in its interior. The geometry of the boundaries is expressed in terms of double Fourier expansions and boundary conditions enter the algorithm in the form of constraints. The spatial discretization uses Fourier expansions in the stream-wise and span-wise directions and Chebyshev expansions in the wall-normal direction. The algorithm can use either the fixed-flow-rate constraint or the fixed-pressure-gradient constraint; a direct implementation of the former constraint is described. An efficient solver which takes advantage of the structure of the coefficient matrix has been developed. It is demonstrated that the applicability of the algorithm can be extended to more extreme geometries using the over-determined formulation. Various tests confirm the spectral accuracy of the algorithm.
KW - Immersed boundary conditions
KW - Rough boundaries
KW - Spectral method
UR - http://www.scopus.com/inward/record.url?scp=85018516804&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85018516804&origin=recordpage
U2 - 10.1016/j.camwa.2017.02.047
DO - 10.1016/j.camwa.2017.02.047
M3 - 21_Publication in refereed journal
VL - 73
SP - 2426
EP - 2453
JO - Computers and Mathematics with Applications
JF - Computers and Mathematics with Applications
SN - 0898-1221
IS - 11
ER -