Dohyun Kim
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
Dohyun Kim has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Eun-Jae Park
School of Mathematics and Computing (Computational Science and Engineering), Yonsei University, Seoul, Korea
4 shared publications Boyan S. Lazarov
Lawrence Livermore National Laboratory, Livermore, CA 94550 USA
2 shared publications- Brendan Keith
Division of Applied Mathematics, Brown University, Providence, RI 02912 USA
2 shared publications Thomas M. Surowiec
Department of Numerical Analysis and Scientific Computing, Simula Research Laboratory, 0164 Oslo, Norway
2 shared publications- Amiya Kumar Pani
Department of Mathematics, BITS-Pilani, KK Birla Goa Campus, Goa, India
1 shared publication Boyan Lazarov
Computational Engineering Division, Lawrence Livermore National Laboratory, Livermore, CA, USA
1 shared publication
Latest Publications
- Open Access
- 15 October 2026
- Published by Elsevier in SSRN Electronic Journal
Staggered Discontinuous Galerkin Methods for Nonlinear Parabolic Diffusion with Nonlinear Storage
This paper develops arbitrary-degree staggered discontinuous Galerkin (SDG) methods for nonlinear parabolic diffusion with nonlinear storage on polygonal meshes. The complementary continuity of the scalar and flux spaces gives a parameter-free method that is locally conservative on interior dual elements. We prove semi-discrete well-posedness and derive optimal-order error estimates using a nonlinear elliptic projection. For the backward Euler discretization, we establish a first-order-in-time energy estimate with standard projected initialization and, with compatible initialization, a maximum-in-time $L^2$ error estimate for pressure and flux in two dimensions. The latter proof combines time-level induction with continuation along a discrete solution branch; the condition $\Delta t=o(h)$ closes the $L^\infty$ bootstrap. Numerical tests demonstrate spatial convergence rates consistent with the analysis for piecewise linear approximations, as well as first-order temporal convergence for piecewise quadratic approximations. Additional tests with mixed boundary conditions and discontinuous coefficients illustrate interior balance around low-permeability inclusions and flow through a high-permeability channel network; these test cases lie beyond the coefficient class covered by the analysis.- 15 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessStaggered Discontinuous Galerkin Methods for Nonlinear Parabolic Diffusion with Nonlinear Storage
This paper develops arbitrary-degree staggered discontinuous Galerkin (SDG) methods for nonlinear parabolic diffusion with nonlinear storage on polygonal meshes. The complementary continuity of the scalar and flux spaces gives a parameter-free method that is locally conservative on interior dual elements. We prove semi-discrete well-posedness and derive optimal-order error estimates using a nonlinear elliptic projection. For the backward Euler discretization, we establish a first-order-in-time energy estimate with standard projected initialization and, with compatible initialization, a maximum-in-time $L^2$ error estimate for pressure and flux in two dimensions. The latter proof combines time-level induction with continuation along a discrete solution branch; the condition $\Delta t=o(h)$ closes the $L^\infty$ bootstrap. Numerical tests demonstrate spatial convergence rates consistent with the analysis for piecewise linear approximations, as well as first-order temporal convergence for piecewise quadratic approximations. Additional tests with mixed boundary conditions and discontinuous coefficients illustrate interior balance around low-permeability inclusions and flow through a high-permeability channel network; these test cases lie beyond the coefficient class covered by the analysis. - Open Access
- 10 September 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 109 (2) , 45
Pressure-Robust Staggered DG Methods for the Navier–Stokes Equations on General Meshes
In this paper, we design and analyze staggered discontinuous Galerkin methods of arbitrary polynomial orders for the stationary Navier–Stokes equations on polygonal meshes. The exact divergence-free condition for the velocity is satisfied thanks to the carefully designed finite element spaces. The resulting method is pressure-robust so that the pressure approximation does not influence the velocity approximation, which is highly appreciated from a practical point of view. An edge-wise stabilization is proposed for the nonlinear convective term, which preserves the non-negativity. The optimal convergence estimates for all the variables in the $$L^2$$ norm are proved. For a small enough rotational force, the velocity error is independent of the Reynolds number and of the pressure. Superconvergence can be achieved for the velocity error under a suitable projection. Numerical experiments are provided to validate the theoretical findings and demonstrate the performance of the proposed method.- 10 September 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 109 (2) , 45
Open AccessPressure-Robust Staggered DG Methods for the Navier–Stokes Equations on General Meshes
In this paper, we design and analyze staggered discontinuous Galerkin methods of arbitrary polynomial orders for the stationary Navier–Stokes equations on polygonal meshes. The exact divergence-free condition for the velocity is satisfied thanks to the carefully designed finite element spaces. The resulting method is pressure-robust so that the pressure approximation does not influence the velocity approximation, which is highly appreciated from a practical point of view. An edge-wise stabilization is proposed for the nonlinear convective term, which preserves the non-negativity. The optimal convergence estimates for all the variables in the $$L^2$$ norm are proved. For a small enough rotational force, the velocity error is independent of the Reynolds number and of the pressure. Superconvergence can be achieved for the velocity error under a suitable projection. Numerical experiments are provided to validate the theoretical findings and demonstrate the performance of the proposed method. - 22 May 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 35 (2) , 1134-1164
Analysis of the SiMPL Method for Density-Based Topology Optimization
We present a rigorous convergence analysis of a new method for density-based topology optimization that provides pointwise bound-preserving design updates and faster convergence than other popular first-order topology optimization methods. Due to its strong bound preservation, the method is exceptionally robust, as demonstrated in numerous examples here and in the companion article [D. Kim et al., Struct. Multidiscip. Optim., 68 (2025), 74]. Furthermore, it is easy to implement with clear structure and analytical expressions for the updates. Our analysis covers two versions of the method, characterized by the employed line search strategies. We consider a modified Armijo backtracking line search and a Bregman backtracking line search. For both line search algorithms, our algorithm delivers a strict monotone decrease in the objective function and further intuitive convergence properties, e.g., strong and pointwise convergence of the density variables on the active sets, norm convergence to zero of the increments, convergence of the Lagrange multipliers, and more. In addition, the numerical experiments demonstrate apparent mesh-independent convergence of the algorithm. We refer to the new algorithm as the SiMPL method (pronounced “simple”), which stands for Sigmoidal Mirror descent with a Projected Latent variable.
- 22 May 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 35 (2) , 1134-1164
Analysis of the SiMPL Method for Density-Based Topology Optimization
We present a rigorous convergence analysis of a new method for density-based topology optimization that provides pointwise bound-preserving design updates and faster convergence than other popular first-order topology optimization methods. Due to its strong bound preservation, the method is exceptionally robust, as demonstrated in numerous examples here and in the companion article [D. Kim et al., Struct. Multidiscip. Optim., 68 (2025), 74]. Furthermore, it is easy to implement with clear structure and analytical expressions for the updates. Our analysis covers two versions of the method, characterized by the employed line search strategies. We consider a modified Armijo backtracking line search and a Bregman backtracking line search. For both line search algorithms, our algorithm delivers a strict monotone decrease in the objective function and further intuitive convergence properties, e.g., strong and pointwise convergence of the density variables on the active sets, norm convergence to zero of the increments, convergence of the Lagrange multipliers, and more. In addition, the numerical experiments demonstrate apparent mesh-independent convergence of the algorithm. We refer to the new algorithm as the SiMPL method (pronounced “simple”), which stands for Sigmoidal Mirror descent with a Projected Latent variable.
- 25 April 2025
- Published by Springer Nature in Structural and Multidisciplinary Optimization
- Vol. 68 (4) , 1-17
A simple introduction to the SiMPL method for density-based topology optimization
- 25 April 2025
- Published by Springer Nature in Structural and Multidisciplinary Optimization
- Vol. 68 (4) , 1-17
A simple introduction to the SiMPL method for density-based topology optimization
- 14 June 2024
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 38 (5) , 447-467
High-performance finite elements with MFEM
The MFEM (Modular Finite Element Methods) library is a high-performance C++ library for finite element discretizations. MFEM supports numerous types of finite element methods and is the discretization engine powering many computational physics and engineering applications across a number of domains. This paper describes some of the recent research and development in MFEM, focusing on performance portability across leadership-class supercomputing facilities, including exascale supercomputers, as well as new capabilities and functionality, enabling a wider range of applications. Much of this work was undertaken as part of the Department of Energy’s Exascale Computing Project (ECP) in collaboration with the Center for Efficient Exascale Discretizations (CEED).
- 14 June 2024
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 38 (5) , 447-467
High-performance finite elements with MFEM
The MFEM (Modular Finite Element Methods) library is a high-performance C++ library for finite element discretizations. MFEM supports numerous types of finite element methods and is the discretization engine powering many computational physics and engineering applications across a number of domains. This paper describes some of the recent research and development in MFEM, focusing on performance portability across leadership-class supercomputing facilities, including exascale supercomputers, as well as new capabilities and functionality, enabling a wider range of applications. Much of this work was undertaken as part of the Department of Energy’s Exascale Computing Project (ECP) in collaboration with the Center for Efficient Exascale Discretizations (CEED).
- 1 March 2021
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 375
Morley finite element methods for the stationary quasi-geostrophic equation
- 1 March 2021
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 375
Morley finite element methods for the stationary quasi-geostrophic equation
- 1 June 2018
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 335, 255-272
Error estimates of B-spline based finite-element methods for the stationary quasi-geostrophic equations of the ocean
- 1 June 2018
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 335, 255-272
Error estimates of B-spline based finite-element methods for the stationary quasi-geostrophic equations of the ocean