Searcharxiv⌕ Search

arXiv subjects

Ngoc Cuong Nguyen

Publications and source records attributed to Ngoc Cuong Nguyen.

At least 19 recordsLinked to original sources
arXiv2026

A Massively Parallel Hybridizable Discontinuous Galerkin Solver for Direct Numerical Simulation of Compressible Flows on GPUs

Direct numerical simulation (DNS) of compressible transitional and turbulent flows requires numerical methods that combine high-order accuracy, robustness, and computational efficiency to resolve a broad range of spatial and temporal scales. This paper presents a massively parallel hybridizable discontinuous Galerkin (HDG) solver for DNS of the compressible Navier-Stokes equations on GPU-accelerated high-performance computing systems. The proposed solver combines high-order HDG discretization with robust shock capturing, diagonally implicit Runge-Kutta (DIRK) time integration, and an efficient Newton-GMRES solution strategy accelerated by additive Schwarz preconditioning and reduced-basis approximation. A distributed implementation of these methods based on GPU-aware MPI, Kokkos, and CUDA/HIP libraries enables scalable execution on heterogeneous computing platforms. The solver is demonstrated on three canonical benchmark problems covering a wide range of Mach-number flow regimes: subsonic transitional flow over the Eppler 387 airfoil, the supersonic Taylor-Green vortex, and hypersonic boundary-layer transition. Numerical results are compared with available experimental measurements and published DNS data, showing good agreement across distinct flow regimes. The results demonstrate the ability of the proposed solver to resolve laminar-turbulent transition, strong compressibility effects, shock-associated flow structures, and fully three-dimensional turbulent dynamics.

math.NA↗
arXiv2026

Fine properties of functions in complex Sobolev spaces

We study comprehensively local properties of functions in complex Sobolev spaces on a bounded open subset of $\mathbb{C}^n$. The main tool is the corresponding functional capacity for the space which is inspired by the global one due to Vigny (2007). An inequality between this capacity and the Bedford-Taylor capacity for plurisubharmonic functions is proved, which is sharp as far as the exponents are concerned. Moreover, it is shown that the functional capacity is a Choquet capacity. The Alexander-Taylor type inequality for the capacity is also proved. This allows us to strengthen the results in the works of Dinh, Marinescu and Vu (2023), Vigny and Vu (2024). Lastly, the Moser-Trudinger type inequality in this space is characterized by the volume-capacity inequality.

math.CV↗
arXiv2025

Preconditioning Techniques for Hybridizable Discontinuous Galerkin Discretizations on GPU Architectures

We present scalable iterative solvers and preconditioning strategies for Hybridizable Discontinuous Galerkin (HDG) discretizations of partial differential equations (PDEs) on graphics processing units (GPUs). The HDG method is implemented using GPU-tailored algorithms in which local element degrees of freedom are eliminated in parallel, and the globally condensed system is assembled directly on the device using dense-block operations. The global matrix is stored in a block format that reflects the natural HDG structure, enabling all iterative solver kernels to be executed with strided batched dense matrix-vector multiplications. This implementation avoids sparse data structures, increases arithmetic intensity, and sustains high memory throughput across a range of meshes and polynomial orders. The nonlinear solver combines Newton's method with preconditioned GMRES, integrating scalable preconditioners such as block-Jacobi, additive Schwarz domain decomposition, and polynomial smoothers. All preconditioners are implemented in batched form with architecture-aware optimizations--including dense linear algebra kernels, memory-coalesced vector operations, and shared-memory acceleration--to minimize memory traffic and maximize parallel occupancy. Comprehensive studies are conducted for a variety of PDEs (including Poisson equation, Burgers equation, linear and nonlinear elasticity, Euler equations, Navier-Stokes equations, and Reynolds-Averaged Navier-Stokes equations) using structured and unstructured meshes with different element types and polynomial orders on both NVIDIA and AMD GPU architectures.

math.NA↗
arXiv2025

Polar sets for $m$-subharmonic functions on compact Hermitian manifolds

We prove a sharp decay of capacity of sublevel sets of a $(ω,m)$-subharmonic functions on a $n$-dimensional compact Hermitian manifold $(X,ω)$ which generalizes the case $m=n$ as well as the case $1\leq m\leq n$ on a compact Kähler manifold. We also obtain the full characterizations of polar sets of such functions in terms of the corresponding local and global capacities, and of the extremal functions.

math.CV↗
arXiv2025

A remark on the Hölder regularity of solutions to the complex Hessian equation

We prove that the Dirichlet problem for the complex Hessian equation has the Hölder continuous solution provided it has a subsolution with this property. Compared to the previous result of Benali-Zeriahi and Charabati-Zeriahi we remove the assumption on the finite total mass of the measure on the right hand side.

math.CV↗
arXiv2025

Complex Hessian measures with respect to a background Hermitian form

We develop potential theory for $m$-subharmonic functions with respect to a Hermitian metric on a Hermitian manifold. First, we show that the complex Hessian operator is well-defined for bounded functions in this class. This allows to define the $m$-capacity and then showing the quasi-continuity of $m$-subharmonic functions. Thanks to this we derive other results parallel to those in pluripotential theory such as the equivalence between polar sets and negligible sets. The theory is then used to study the complex Hessian equation on compact Hermitian manifold with boundary, with the right hand side of the equation admitting a bounded subsolution. This is an extension of a recent result of Collins and Picard dealing with classical solutions.

math.CV↗
arXiv2024

Generative Reduced Basis Method

We present a generative reduced basis (RB) approach to construct reduced order models for parametrized partial differential equations. Central to this approach is the construction of generative RB spaces that provide rapidly convergent approximations of the solution manifold. We introduce a generative snapshot method to generate significantly larger sets of snapshots from a small initial set of solution snapshots. This method leverages multivariate nonlinear transformations to enrich the RB spaces, allowing for a more accurate approximation of the solution manifold than commonly used techniques such as proper orthogonal decomposition and greedy sampling. The key components of our approach include (i) a Galerkin projection of the full order model onto the generative RB space to form the reduced order model; (ii) a posteriori error estimates to certify the accuracy of the reduced order model; and (iii) an offline-online decomposition to separate the computationally intensive model construction, performed once during the offline stage, from the real-time model evaluations performed many times during the online stage. The error estimates allow us to efficiently explore the parameter space and select parameter points that maximize the accuracy of the reduced order model. Through numerical experiments, we demonstrate that the generative RB method not only improves the accuracy of the reduced order model but also provides tight error estimates.

math.NA↗
arXiv2024

First-order empirical interpolation method for real-time solution of parametric time-dependent nonlinear PDEs

We present a model reduction approach for the real-time solution of time-dependent nonlinear partial differential equations (PDEs) with parametric dependencies. The approach integrates several ingredients to develop efficient and accurate reduced-order models. Proper orthogonal decomposition is used to construct a reduced-basis (RB) space which provides a rapidly convergent approximation of the parametric solution manifold. The Galerkin projection is employed to reduce the dimensionality of the problem by projecting the weak formulation of the governing PDEs onto the RB space. A major challenge in model reduction for nonlinear PDEs is the efficient treatment of nonlinear terms, which we address by unifying the implementation of several hyperreduction methods. We introduce a first-order empirical interpolation method to approximate the nonlinear terms and recover the computational efficiency. We demonstrate the effectiveness of our methodology through its application to the Allen-Cahn equation, which models phase separation processes, and the Buckley-Leverett equation, which describes two-phase fluid flow in porous media. Numerical results highlight the accuracy, efficiency, and stability of the proposed approach.

math.NA↗
arXiv2024

High-order empirical interpolation methods for real time solution of parametrized nonlinear PDEs

We present novel model reduction methods for rapid solution of parametrized nonlinear partial differential equations (PDEs) in real-time or many-query contexts. Our approach combines reduced basis (RB) space for rapidly convergent approximation of the parametric solution manifold, Galerkin projection of the underlying PDEs onto the RB space for dimensionality reduction, and high-order empirical interpolation for efficient treatment of the nonlinear terms. We propose a class of high-order empirical interpolation methods to derive basis functions and interpolation points by using high-order partial derivatives of the nonlinear terms. As these methods can generate high-quality basis functions and interpolation points from a snapshot set of full-order model (FOM) solutions, they significantly improve the approximation accuracy. We develop effective a posteriori estimator to quantify the interpolation errors and construct a parameter sample via greedy sampling. Furthermore, we implement two hyperreduction schemes to construct efficient reduced-order models: one that applies the empirical interpolation before Newton's method and another after. The latter scheme shows flexibility in controlling hyperreduction errors. Numerical results are presented to demonstrate the accuracy and efficiency of the proposed methods.

math.NA↗
arXiv2024

Environment-adaptive machine learning potentials

The development of interatomic potentials that can accurately capture a wide range of physical phenomena and diverse environments is of significant interest, but it presents a formidable challenge. This challenge arises from the numerous structural forms, multiple phases, complex intramolecular and intermolecular interactions, and varying external conditions. In this paper, we present a method to construct environment-adaptive interatomic potentials by adapting to the local atomic environment of each atom within a system. The collection of atomic environments of interest is partitioned into several clusters of atomic environments. Each cluster represents a distinctive local environment and is used to define a corresponding local potential. We introduce a many-body many-potential expansion to smoothly blend these local potentials to ensure global continuity of the potential energy surface. This is achieved by computing the probability functions that determine the likelihood of an atom belonging to each cluster. We apply the environment-adaptive machine learning potentials to predict observable properties for Ta element and InP compound, and compare them with density functional theory calculations.

cond-mat.mtrl-sci↗
arXiv2024

Regularity of the Siciak-Zaharjuta extremal function on compact Kähler manifolds

We prove that the regularity of the extremal function of a compact subset of a compact Kähler manifold is a local property, and that the continuity and Hölder continuity are equivalent to classical notions of the local $L$-regularity and the locally Hölder continuous property in pluripolential theory. As a consequence we give an effective characterization of the $(\Cc^\al, \Cc^{\al'})$-regularity of compact sets, the notion introduced by Dinh, Ma and Nguyen. Using this criterion all compact fat subanalytic subsets in $\bR^n$ are shown to be regular in this sense.

math.CV↗
arXiv2023

Discontinuous Galerkin Methods for Hypersonic Flows

In recent years, high-order discontinuous Galerkin (DG) methods have emerged as an attractive approach for numerical simulations of compressible flows. This paper presents an overview of the recent development of DG methods for compressible flows with particular focus on hypersononic flows. First, we survey state-of-the-art DG methods for computational fluid dynamics. Next, we discuss both matrix-based and matrix-free iterative methods for the solution of discrete systems stemming from the spatial DG discretizations of the compressible Navier-Stokes equations. We then describe various shock capturing methods to deal with strong shock waves in hypersonic flows. We discuss adaptivity techniques to refine high-order meshes, and synthetic boundary conditions to simulate free-stream disturbances in hypersonic boundary layers. We present a few examples to demonstrate the ability of high-order DG methods to provide accurate solutions of hypersonic laminar flows. Furthermore, we present direct numerical simulations of hypersonic transitional flow past a flared cone at Reynolds number $10.8 \times 10^6$, and hypersonic transitional shock wave boundary layer interaction flow over a flat plate at Reynolds number $3.97 \times 10^6$. These simulations run entirely on hundreds of graphics processing units (GPUs) and demonstrate the ability of DG methods to directly resolve hypersonic transitional flows, even at high Reynolds numbers, without relying on transition or turbulence models. We end the paper by offering our perspectives on error estimation, turbulence modeling, and real gas effects in hypersonic flows.

physics.flu-dyn↗
arXiv2023

Adaptive model reduction of high-order solutions of compressible flows via optimal transport

The solution of conservation laws with parametrized shock waves presents challenges for both high-order numerical methods and model reduction techniques. We introduce an r-adaptivity scheme based on optimal transport and apply it to develop reduced order models for compressible flows. The optimal transport theory allows us to compute high-order r-adaptive meshes from a starting reference mesh by solving the Monge-Ampere equation. A high-order discretization of the conservation laws enables high-order solutions to be computed on the resulting r-adaptive meshes. Furthermore, the Monge-Ampere solutions contain mappings that are used to reduce the spatial locality of the resulting solutions and make them more amenable to model reduction. We use a non-intrusive model reduction method to construct reduced order models of both the mesh and the solution. The procedure is demonstrated on three supersonic and hypersonic test cases, with the hybridizable discontinuous Galerkin method being used as the full order model.

math.NA↗
arXiv2023

Optimal transport for mesh adaptivity and shock capturing of compressible flows

We present an optimal transport approach for mesh adaptivity and shock capturing of compressible flows. Shock capturing is based on a viscosity regularization of the governing equations by introducing an artificial viscosity field as solution of the Helmholtz equation. Mesh adaptation is based on the optimal transport theory by formulating a mesh mapping as solution of Monge-Ampere equation. The marriage of optimal transport and viscosity regularization for compressible flows leads to a coupled system of the compressible Euler/Navier-Stokes equations, the Helmholtz equation, and the Monge-Ampere equation. We propose an iterative procedure to solve the coupled system in a sequential fashion using homotopy continuation to minimize the amount of artificial viscosity while enforcing positivity-preserving and smoothness constraints on the numerical solution. We explore various mesh monitor functions for computing r-adaptive meshes in order to reduce the amount of artificial dissipation and improve the accuracy of the numerical solution. The hybridizable discontinuous Galerkin method is used for the spatial discretization of the governing equations to obtain high-order accurate solutions. Extensive numerical results are presented to demonstrate the optimal transport approach on transonic, supersonic, hypersonic flows in two dimensions. The approach is found to yield accurate, sharp yet smooth solutions within a few mesh adaptation iterations.

math.NA↗
arXiv2023

An adaptive viscosity regularization approach for the numerical solution of conservation laws: Application to finite element methods

We introduce an adaptive viscosity regularization approach for the numerical solution of systems of nonlinear conservation laws with shock waves. The approach seeks to solve a sequence of regularized problems consisting of the system of conservation laws and an additional Helmholtz equation for the artificial viscosity. We propose a homotopy continuation of the regularization parameters to minimize the amount of artificial viscosity subject to positivity-preserving and smoothness constraints on the numerical solution. The regularization methodology is combined with a mesh adaptation strategy that identifies the shock location and generates shock-aligned meshes, which allows to further reduce the amount of artificial dissipation and capture shocks with increased accuracy. We use the hybridizable discontinuous Galerkin method to numerically solve the regularized system of conservation laws and the continuous Galerkin method to solve the Helmholtz equation for the artificial viscosity. We show that the approach can produce approximate solutions that converge to the exact solution of the Burgers' equation. Finally, we demonstrate the performance of the method on inviscid transonic, supersonic, hypersonic flows in two dimensions. The approach is found to be accurate, robust and efficient, and yields very sharp yet smooth solutions in a few homotopy iterations.

physics.flu-dyn↗
arXiv2023

Efficient and accurate nonlinear model reduction via first-order empirical interpolation

We present a model reduction approach that extends the original empirical interpolation method to enable accurate and efficient reduced basis approximation of parametrized nonlinear partial differential equations (PDEs). In the presence of nonlinearity, the Galerkin reduced basis approximation remains computationally expensive due to the high complexity of evaluating the nonlinear terms, which depends on the dimension of the truth approximation. The empirical interpolation method (EIM) was proposed as a nonlinear model reduction technique to render the complexity of evaluating the nonlinear terms independent of the dimension of the truth approximation. We introduce a first-order empirical interpolation method (FOEIM) that makes use of the partial derivative information to construct an inexpensive and stable interpolation of the nonlinear terms. We propose two different FOEIM algorithms to generate interpolation points and basis functions. We apply the FOEIM to nonlinear elliptic PDEs and compare it to the Galerkin reduced basis approximation and the EIM. Numerical results are presented to demonstrate the performance of the three reduced basis approaches.

math.NA↗