Hong-Quan Chen

Prof. Hong-Quan Chen

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 January 2018 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
SXShengguan Xu
Shengguan Xu
HCHong-Quan Chen
Hong-Quan Chen

31 October 2018 in Structural and Multidisciplinary Optimization
Verified
Journal Article
Closed access
PDF file
SXShengguan Xu
Shengguan Xu
HCHong-Quan Chen
Hong-Quan Chen
JZJiale Zhang
Jiale Zhang

22 July 2010 in International Journal for Numerical Methods in Fluids
Verified
Journal Article
Closed access
PDF file
HWHong Wang
Hong Wang
HCHong-Quan Chen
Hong-Quan Chen
JPJacques Periaux
Jacques Periaux

2 November 2024 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
SXShengguan Xu
Shengguan Xu
JTJianfeng Tan
Jianfeng Tan
JZJiale Zhang
Jiale Zhang
HCHong-Quan Chen
Hong-Quan Chen
YGYisheng Gao,
Yisheng Gao,

1 January 2017 in Engineering Applications of Computational Fluid Mechanics
Verified
Journal Article
Open access
JZJiale Zhang
Jiale Zhang
HCHong-Quan Chen
Hong-Quan Chen
CCCheng Cao
Cheng Cao
A graphics processing unit (GPU) -accelerated meshless method is presented for solving two-dimensional compressible flows over aerodynamic bodies. The Compute Unified Device Architecture (CUDA) Fortran programming model is employed to port the meshless method from central processing unit to GPU as a way of achieving efficiency, which involves implementation of CUDA kernels and management of data storage structure and thread hierarchy. The CUDA kernel subroutines are designed to meet with the point-based computing of the meshless method. The corresponding point-based data structure and thread hierarchy are constructed or manipulated in the paper by presenting two specific GPU implementations of the meshless method, which are developed for solving Navier–Stokes equations. The Jameson–Schmidt–Turkel scheme is used to estimate the flux terms of the Navier–Stokes equations and an explicit four-stage Runge–Kutta scheme is applied to update the solution at time level. After tuning the performances of the resulting two GPU-accelerated meshless solvers by changing the number of threads in a block, a set of typical flows over aerodynamic bodies are simulated for validation. Numerical results are shown in a comparison with available experimental data or computational values that appear in extant literature with an analysis of code performance. This reveals that the cost of computing time of the presented test cases is significantly reduced for both solvers without losing accuracy, while impressive speedups up to 64 times are achieved due to careful management of memory access.

27 December 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
SXShengguan Xu
Shengguan Xu
JZJiale Zhang
Jiale Zhang
HCHong-Quan Chen
Hong-Quan Chen
YGYisheng Gao,
Yisheng Gao,
YGYunkun Gao
Yunkun Gao
XJXuesong Jia Jia
Xuesong Jia Jia
In this work, a novel multi-objective efficient global optimization (EGO) algorithm, namely GMOEGO, is presented by proposing an approach of available threads’ multi-objective infill criterion. The work applies the outstanding hypervolume-based expected improvement criterion to enhance the Pareto solutions in view of the accuracy and their distribution on the Pareto front, and the values of sophisticated hypervolume improvement (HVI) are technically approximated by counting the Monte Carlo sampling points under the modern GPU (graphics processing unit) architecture. As compared with traditional methods, such as slice-based hypervolume integration, the programing complexity of the present approach is greatly reduced due to such counting-like simple operations. That is, the calculation of the sophisticated HVI, which has proven to be the most time-consuming part with many objectives, can be light in programed implementation. Meanwhile, the time consumption of massive computing associated with such Monte Carlo-based HVI approximation (MCHVI) is greatly alleviated by parallelizing in the GPU. A set of mathematical function cases and a real engineering airfoil shape optimization problem that appeared in the literature are taken to validate the proposed approach. All the results show that, less time-consuming, up to around 13.734 times the speedup is achieved when appropriate Pareto solutions are captured.