scispace - formally typeset
N

Ngoc Cuong Nguyen

Researcher at Massachusetts Institute of Technology

Publications -  86
Citations -  5668

Ngoc Cuong Nguyen is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topics: Discontinuous Galerkin method & Finite element method. The author has an hindex of 29, co-authored 73 publications receiving 4807 citations. Previous affiliations of Ngoc Cuong Nguyen include National University of Singapore.

Papers
More filters
Book ChapterDOI

Hybridizable Discontinuous Galerkin Methods

TL;DR: An overview of recent developments of HDG methods for numerically solving partial differential equations in fluid mechanics is presented.
Journal ArticleDOI

Nanogap-Enhanced Terahertz Sensing of 1 nm Thick (λ/106) Dielectric Films

TL;DR: In this article, the authors used an advanced finite element modeling (FEM) technique, Hybridizable Discontinuous Galerkin (HDG) scheme, for full three-dimensional modeling of the resonant transmission of terahertz waves through an annular gap that is 2 nm in width and 32 μm in diameter.
Journal ArticleDOI

The hybridized Discontinuous Galerkin method for Implicit Large-Eddy Simulation of transitional turbulent flows

TL;DR: The proposed approach is applied to transitional flows over the NACA 65-(18)10 compressor cascade and the Eppler 387 wing at Reynolds numbers up to 460,000 and results show rapid convergence and excellent agreement with experimental data.
Journal ArticleDOI

Analysis of HDG Methods for Oseen Equations

TL;DR: A hybridizable discontinuous Galerkin (HDG) method to numerically solve the Oseen equations which can be seen as the linearized version of the incompressible Navier-Stokes equations and optimal convergence for the velocity gradient and pressure and superconvergence for the Velocity.
Journal ArticleDOI

Bandgap optimization of two-dimensional photonic crystals using semidefinite programming and subspace methods

TL;DR: This paper reduces the large-scale non-convex optimization problem via reparametrization to a sequence of small-scale convex semidefinite programs (SDPs) for which modern SDP solvers can be efficiently applied.