Vinh Q. Dang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Vinh Q. Dang has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Joseph D. Kotulski
Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
2 shared publications - Sivasankaran Rajamanickam
Sandia National Laboratories, Albuquerque, NM, USA
2 shared publications - Amir I. Zaghloul
Bradley Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg, VA, USA
1 shared publication Amy Powell
Sandia National Laboratories, Albuquerque, NM, USA
1 shared publication- Brian Andrew Freno
Sandia National Laboratories 87185 Albuquerque NM
1 shared publication Bruno Turcksin
Oak Ridge National Laboratory, Oak Ridge, TN, USA
1 shared publication
Latest Publications
- 8 May 2025
- Published by Elsevier in Engineering Analysis with Boundary Elements
- Vol. 178
Code-verification techniques for an arbitrary-depth electromagnetic slot model
- 8 May 2025
- Published by Elsevier in Engineering Analysis with Boundary Elements
- Vol. 178
Code-verification techniques for an arbitrary-depth electromagnetic slot model
- Open Access
- 9 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 71 (3) , 2613-2625
An Efficient and Error-Controllable Angular Sweep Algorithm for Electromagnetic Wave Scattering and its Analysis
The angular sweep of electromagnetic wave scattering is formulated as a matrix equation with multiple right-hand sides (RHSs). Although the low-rank approximation of an RHS matrix is a popular choice for reducing the computational costs of multiple RHSs, only a small amount of research has been conducted to explore how this approximation impacts the solution quality. Furthermore, there has not been sufficient research on the quality of the solution as a function of the accuracy of the iterative solver. We present an error analysis of the approximated solution considering both the reduced number of RHSs and the tolerance of the iterative solver. Based on the error analysis, a new angular sweep algorithm is proposed with fine-tuned tolerances of the iterative solver for individual singular vectors. The different tolerances for each singular vector increase the efficiency of the proposed algorithm. Another benefit of the proposed algorithm is that the error can be bounded by a user-defined global tolerance. Additionally, a variant of the generalized conjugate residual method for multiple RHSs is introduced to accelerate iterative solvers. Finally, numerical validation is conducted with three examples in which the discontinuous Galerkin surface integral equation method is applied. The experiments support two conclusions: tight upper and lower bounds of the solution error exist, and fine-tuning the tolerances reduces the computational costs.
- 9 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 71 (3) , 2613-2625
Open AccessAn Efficient and Error-Controllable Angular Sweep Algorithm for Electromagnetic Wave Scattering and its Analysis
The angular sweep of electromagnetic wave scattering is formulated as a matrix equation with multiple right-hand sides (RHSs). Although the low-rank approximation of an RHS matrix is a popular choice for reducing the computational costs of multiple RHSs, only a small amount of research has been conducted to explore how this approximation impacts the solution quality. Furthermore, there has not been sufficient research on the quality of the solution as a function of the accuracy of the iterative solver. We present an error analysis of the approximated solution considering both the reduced number of RHSs and the tolerance of the iterative solver. Based on the error analysis, a new angular sweep algorithm is proposed with fine-tuned tolerances of the iterative solver for individual singular vectors. The different tolerances for each singular vector increase the efficiency of the proposed algorithm. Another benefit of the proposed algorithm is that the error can be bounded by a user-defined global tolerance. Additionally, a variant of the generalized conjugate residual method for multiple RHSs is introduced to accelerate iterative solvers. Finally, numerical validation is conducted with three examples in which the discontinuous Galerkin surface integral equation method is applied. The experiments support two conclusions: tight upper and lower bounds of the solution error exist, and fine-tuning the tolerances reduces the computational costs.
- Top Cited PapersOpen Access
- 14 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 33 (4) , 805-817
Kokkos 3: Programming Model Extensions for the Exascale Era
As the push towards exascale hardware has increased the diversity of system architectures, performance portability has become a critical aspect for scientific software. We describe the Kokkos Performance Portable Programming Model that allows developers to write single source applications for diverse high-performance computing architectures. Kokkos provides key abstractions for both the compute and memory hierarchy of modern hardware. We describe the novel abstractions that have been added to Kokkos version 3 such as hierarchical parallelism, containers, task graphs, and arbitrary-sized atomic operations to prepare for exascale era architectures. We demonstrate the performance of these new features with reproducible benchmarks on CPUs and GPUs.
- 14 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 33 (4) , 805-817
Top Cited PapersOpen AccessKokkos 3: Programming Model Extensions for the Exascale Era
As the push towards exascale hardware has increased the diversity of system architectures, performance portability has become a critical aspect for scientific software. We describe the Kokkos Performance Portable Programming Model that allows developers to write single source applications for diverse high-performance computing architectures. Kokkos provides key abstractions for both the compute and memory hierarchy of modern hardware. We describe the novel abstractions that have been added to Kokkos version 3 such as hierarchical parallelism, containers, task graphs, and arbitrary-sized atomic operations to prepare for exascale era architectures. We demonstrate the performance of these new features with reproducible benchmarks on CPUs and GPUs.
- 17 April 2021
- Published by Springer Nature
- p. 80-101
ADELUS: A Performance-Portable Dense LU Solver for Distributed-Memory Hardware-Accelerated Systems
- 17 April 2021
- Published by Springer Nature
- p. 80-101
ADELUS: A Performance-Portable Dense LU Solver for Distributed-Memory Hardware-Accelerated Systems
- Open Access
- 23 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electromagnetic Compatibility
- Vol. 62 (5) , 1980-1988
Penetration Through Slots in Cylindrical Cavities Operating at Fundamental Cavity Modes
In this article, we examine the coupling into an electrically short azimuthal slot on a cylindrical cavity operating at fundamental cavity modal frequencies. We first develop a matched bound formulation through which we can gather information for maximum achievable levels of interior cavity fields. Actual field levels are below this matched bound; therefore, we also develop an unmatched formulation for frequencies below the slot resonance to achieve a better insight on the physics of this coupling. Good agreement is observed between the unmatched formulation, full-wave simulations, and experimental data, providing a validation of our analytical models. We then extend the unmatched formulation to treat an array of slots, found again in good agreement with full-wave simulations. These analytical models can be used to investigate ways to mitigate electromagnetic interference and electromagnetic compatibility effects within cavities.
- 23 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electromagnetic Compatibility
- Vol. 62 (5) , 1980-1988
Open AccessPenetration Through Slots in Cylindrical Cavities Operating at Fundamental Cavity Modes
In this article, we examine the coupling into an electrically short azimuthal slot on a cylindrical cavity operating at fundamental cavity modal frequencies. We first develop a matched bound formulation through which we can gather information for maximum achievable levels of interior cavity fields. Actual field levels are below this matched bound; therefore, we also develop an unmatched formulation for frequencies below the slot resonance to achieve a better insight on the physics of this coupling. Good agreement is observed between the unmatched formulation, full-wave simulations, and experimental data, providing a validation of our analytical models. We then extend the unmatched formulation to treat an array of slots, found again in good agreement with full-wave simulations. These analytical models can be used to investigate ways to mitigate electromagnetic interference and electromagnetic compatibility effects within cavities.
- Open Access
- 1 September 2017
- Published by Institution of Engineering and Technology (IET) in IET Radar, Sonar & Navigation
- Vol. 11 (9) , 1349-1358
Simulation framework for compressive sensing‐based through‐wall detection of moving targets
Detection of moving targets in cluttered environments is important in numerous applications, such as disaster search‐and‐rescue, law enforcement, urban warfare and so on. One of the popular techniques employed for this purpose is the use of stepped‐frequency continuous‐wave radar due to its low cost and reduced complexity. However, the stepped‐frequency radar suffers from long data acquisition time. This study focuses on the detection of moving targets in cluttered medium; such as behind walls, using stepped‐frequency radar enhanced by compressive sensing (CS). The application of CS enables the reconstruction of the target space using fewer frequencies, which decreases the acquisition time. This study presents simulation results that demonstrate the applicability of CS to stepped‐frequency radar measurements in accurately locating and tracking targets behind walls. The plane‐wave spectrum approach is employed in conjunction with through‐wall transmission coefficients for calculating the scattered fields of targets behind the wall. The received voltage at the antenna terminals is then computed by adopting the concept of complex antenna factor frequently used in Electromagnetic Compatibility (EMC) community, which fully takes into account the antenna effects, enabling an accurate simulation.
- 1 September 2017
- Published by Institution of Engineering and Technology (IET) in IET Radar, Sonar & Navigation
- Vol. 11 (9) , 1349-1358
Open AccessSimulation framework for compressive sensing‐based through‐wall detection of moving targets
Detection of moving targets in cluttered environments is important in numerous applications, such as disaster search‐and‐rescue, law enforcement, urban warfare and so on. One of the popular techniques employed for this purpose is the use of stepped‐frequency continuous‐wave radar due to its low cost and reduced complexity. However, the stepped‐frequency radar suffers from long data acquisition time. This study focuses on the detection of moving targets in cluttered medium; such as behind walls, using stepped‐frequency radar enhanced by compressive sensing (CS). The application of CS enables the reconstruction of the target space using fewer frequencies, which decreases the acquisition time. This study presents simulation results that demonstrate the applicability of CS to stepped‐frequency radar measurements in accurately locating and tracking targets behind walls. The plane‐wave spectrum approach is employed in conjunction with through‐wall transmission coefficients for calculating the scattered fields of targets behind the wall. The received voltage at the antenna terminals is then computed by adopting the concept of complex antenna factor frequently used in Electromagnetic Compatibility (EMC) community, which fully takes into account the antenna effects, enabling an accurate simulation.
- 1 June 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 403-406
Communication link improvement through antenna optimization for satellite, space, and radio astronomy systems
This paper studies the concept of improving the satellite link quality by optimizing the pattern of the receive antenna on board the satellite and at the ground terminal to reduce the antenna temperature. Accurate antenna temperature is calculated by accounting for the temperature difference between land and water bodies in the antenna coverage. The optimization process works on the antenna aperture distribution taking into account the temperature distribution in the antenna pattern. Similar concepts can be used for space and radio astronomy applications.
- 1 June 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 403-406
Communication link improvement through antenna optimization for satellite, space, and radio astronomy systems
This paper studies the concept of improving the satellite link quality by optimizing the pattern of the receive antenna on board the satellite and at the ground terminal to reduce the antenna temperature. Accurate antenna temperature is calculated by accounting for the temperature difference between land and water bodies in the antenna coverage. The optimization process works on the antenna aperture distribution taking into account the temperature distribution in the antenna pattern. Similar concepts can be used for space and radio astronomy applications.