Hiroaki Nishikawa
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
Research Subjects
Hiroaki Nishikawa has a total of 65 co-authors. Here are the top co-authors by number of shared publications:
Boris Diskin
Natl Inst Aerosp, Hampton, VA 23666 USA
8 shared publicationsJialin Lou
8 shared publications- Alireza Mazaheri
NASA Langley Research Center
7 shared publications Philip Roe
University of Michigan
6 shared publicationsHong Luo
5 shared publicationsJeffery A. White
5 shared publications
Latest Publications
- 24 July 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 565
On accuracy deterioration with surface-normal-dependent boundary conditions at triangulated boundaries
- 24 July 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 565
On accuracy deterioration with surface-normal-dependent boundary conditions at triangulated boundaries
- 6 May 2026
- Published by Elsevier in Computers & Fluids
- Vol. 314
A parameter-free weak boundary condition procedure for P1 Galerkin viscous discretization for tetrahedral meshes
- 6 May 2026
- Published by Elsevier in Computers & Fluids
- Vol. 314
A parameter-free weak boundary condition procedure for P1 Galerkin viscous discretization for tetrahedral meshes
- Open Access
- 14 February 2026
- Published by Elsevier in SSRN Electronic Journal
High-Order Boundary Procedures for Finite-Volume and Finite-Difference Schemes
In this paper, we present high-order boundary procedures for finite-volume and finite-difference schemes. The proposed procedures are deliberately constructed with precomputed derivatives such that they can be implemented without directly accessing cells beyond immediate neighbors and without explicitly setting up ghost cells. These features are expected to benefit unstructured-grid solvers (as well as parallel structured-grid solvers) for applications with smoothly-varying quadrilateral/hexahedral grids. In this paper, we will focus on the basics of the proposed procedures for third- and fourth-order accuracy, deriving and demonstrating the proposed boundary procedures for nonlinear conservation laws in one dimension.
- 14 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessHigh-Order Boundary Procedures for Finite-Volume and Finite-Difference Schemes
In this paper, we present high-order boundary procedures for finite-volume and finite-difference schemes. The proposed procedures are deliberately constructed with precomputed derivatives such that they can be implemented without directly accessing cells beyond immediate neighbors and without explicitly setting up ghost cells. These features are expected to benefit unstructured-grid solvers (as well as parallel structured-grid solvers) for applications with smoothly-varying quadrilateral/hexahedral grids. In this paper, we will focus on the basics of the proposed procedures for third- and fourth-order accuracy, deriving and demonstrating the proposed boundary procedures for nonlinear conservation laws in one dimension.
- 11 August 2025
- Published by Elsevier in Journal of Computational Physics
- Vol. 540
An economical third-order nodal-gradient cell-centered finite-volume method for mixed-element grids
- 11 August 2025
- Published by Elsevier in Journal of Computational Physics
- Vol. 540
An economical third-order nodal-gradient cell-centered finite-volume method for mixed-element grids
- Open Access
- 6 August 2025
- Published by Springer Nature in Advances in Aerodynamics
- Vol. 7 (1) , 1-22
An efficient implementation of edge-based discretization without forming dual control volumes
This paper shows that lumped directed-area vectors at edges and dual volumes required to implement the edge-based discretization can be computed without explicitly forming the dual control volume around each node for triangular and tetrahedral grids. It is a simpler implementation because there is no need to form a dual control volume by connecting edge-midpoints, face centroids, and element centroids, and it also reduces the time for computing lumped directed-area vectors for a given grid, especially for tetrahedral grids. The speed-up achieved by the proposed algorithm may not be large enough to greatly impact the overall simulation time, but the proposed algorithm is expected to serve as a major stepping stone towards extending the edge-based discretization to four dimensions and beyond (e.g., space-time simulations). Efficient algorithms for computing lumped directed-area vectors and dual volumes without forming dual control volumes are presented, and their implementations are described and compared with traditional algorithms in terms of complexity as well as actual computing time for a given grid.
- 6 August 2025
- Published by Springer Nature in Advances in Aerodynamics
- Vol. 7 (1) , 1-22
Open AccessAn efficient implementation of edge-based discretization without forming dual control volumes
This paper shows that lumped directed-area vectors at edges and dual volumes required to implement the edge-based discretization can be computed without explicitly forming the dual control volume around each node for triangular and tetrahedral grids. It is a simpler implementation because there is no need to form a dual control volume by connecting edge-midpoints, face centroids, and element centroids, and it also reduces the time for computing lumped directed-area vectors for a given grid, especially for tetrahedral grids. The speed-up achieved by the proposed algorithm may not be large enough to greatly impact the overall simulation time, but the proposed algorithm is expected to serve as a major stepping stone towards extending the edge-based discretization to four dimensions and beyond (e.g., space-time simulations). Efficient algorithms for computing lumped directed-area vectors and dual volumes without forming dual control volumes are presented, and their implementations are described and compared with traditional algorithms in terms of complexity as well as actual computing time for a given grid.
- Open Access
An Efficient Implementation of Edge-Based Discretization without Forming Dual Control Volumes
This paper shows that lumped directed-area vectors at edges and dual control volumes required to implement the edge-based discretization can be computed without explicitly defining the dual control volume around each node for triangular and tetrahedral grids. It is a simpler implementation because there is no need to form a dual control volume by connecting edge-midpoints, face centroids, and element centroids, and also reduces the time for computing lumped directed-area vectors for a given grid, especially for tetrahedral grids. The speed-up achieved by the proposed algorithm may not be large enough to greatly impact the overall simulation time, but the proposed algorithm is expected to serve as a major stepping stone towards extending the edge-based discretization to four dimensions and beyond (e.g., space-time simulations). Efficient algorithms for computing lumped directed-area vectors and dual volumes without forming dual volumes are presented, and their implementations are described and compared with traditional algorithms in terms of complexity as well as actual computing time for a given grid.
Open AccessAn Efficient Implementation of Edge-Based Discretization without Forming Dual Control Volumes
This paper shows that lumped directed-area vectors at edges and dual control volumes required to implement the edge-based discretization can be computed without explicitly defining the dual control volume around each node for triangular and tetrahedral grids. It is a simpler implementation because there is no need to form a dual control volume by connecting edge-midpoints, face centroids, and element centroids, and also reduces the time for computing lumped directed-area vectors for a given grid, especially for tetrahedral grids. The speed-up achieved by the proposed algorithm may not be large enough to greatly impact the overall simulation time, but the proposed algorithm is expected to serve as a major stepping stone towards extending the edge-based discretization to four dimensions and beyond (e.g., space-time simulations). Efficient algorithms for computing lumped directed-area vectors and dual volumes without forming dual volumes are presented, and their implementations are described and compared with traditional algorithms in terms of complexity as well as actual computing time for a given grid.
- 1 January 2024
- Published by American Institute of Aeronautics and Astronautics (AIAA) in AIAA Journal
- Vol. 62 (1) , 209-230
Edge-Based Viscous Method for Mixed-Element Node-Centered Finite-Volume Solvers
A novel, efficient, edge-based viscous (EBV) discretization method has been recently developed and implemented in a practical, unstructured-grid, node-centered, finite-volume flow solver. The EBV method is applied to viscous-kernel computations that include evaluations of mean-flow viscous fluxes, turbulence-model and chemistry-model diffusion terms, and the corresponding Jacobian contributions. Initially, the EBV method had been implemented for tetrahedral grids and demonstrated multifold acceleration of all viscous-kernel computations. This paper presents an extension of the EBV method for mixed-element grids. In addition to the primal edges of a given mixed-element grid, virtual edges are introduced to connect cell nodes that are not connected by a primal edge. The EBV method uses an efficient loop over all (primal and virtual) edges and features a compact discretization stencil based on the nearest neighbors. This study verifies the EBV method and assesses its efficiency on mixed-element grids by comparing the EBV solution accuracy and iterative convergence with those of well-established solutions obtained using a cell-based viscous (CBV) discretization method. The EBV solver’s memory footprint is optimized and often smaller than the memory footprint of the CBV solver. An EBV implementation of a nonlinear extension of the Spalart–Allmaras turbulence model, SA-neg-QCR2000, is also presented and verified. The SA-neg-QCR2000 model is used for simulating turbulent corner flows. Multifold speedup is demonstrated for all viscous-kernel computations, resulting in significant reduction of the time to solutions for several benchmark mixed-element-grid computations, including simulations of subsonic flows around a hemisphere–cylinder configuration and a NASA juncture-flow model, a supersonic flow through a long square duct, and a hypersonic, chemically reacting flow around a blunt body.
- 1 January 2024
- Published by American Institute of Aeronautics and Astronautics (AIAA) in AIAA Journal
- Vol. 62 (1) , 209-230
Edge-Based Viscous Method for Mixed-Element Node-Centered Finite-Volume Solvers
A novel, efficient, edge-based viscous (EBV) discretization method has been recently developed and implemented in a practical, unstructured-grid, node-centered, finite-volume flow solver. The EBV method is applied to viscous-kernel computations that include evaluations of mean-flow viscous fluxes, turbulence-model and chemistry-model diffusion terms, and the corresponding Jacobian contributions. Initially, the EBV method had been implemented for tetrahedral grids and demonstrated multifold acceleration of all viscous-kernel computations. This paper presents an extension of the EBV method for mixed-element grids. In addition to the primal edges of a given mixed-element grid, virtual edges are introduced to connect cell nodes that are not connected by a primal edge. The EBV method uses an efficient loop over all (primal and virtual) edges and features a compact discretization stencil based on the nearest neighbors. This study verifies the EBV method and assesses its efficiency on mixed-element grids by comparing the EBV solution accuracy and iterative convergence with those of well-established solutions obtained using a cell-based viscous (CBV) discretization method. The EBV solver’s memory footprint is optimized and often smaller than the memory footprint of the CBV solver. An EBV implementation of a nonlinear extension of the Spalart–Allmaras turbulence model, SA-neg-QCR2000, is also presented and verified. The SA-neg-QCR2000 model is used for simulating turbulent corner flows. Multifold speedup is demonstrated for all viscous-kernel computations, resulting in significant reduction of the time to solutions for several benchmark mixed-element-grid computations, including simulations of subsonic flows around a hemisphere–cylinder configuration and a NASA juncture-flow model, a supersonic flow through a long square duct, and a hypersonic, chemically reacting flow around a blunt body.
- 22 July 2023
- Published by Elsevier in Journal of Computational Physics
- Vol. 491, 112389
On pitfalls in accuracy verification using time-dependent problems
- 22 July 2023
- Published by Elsevier in Journal of Computational Physics
- Vol. 491, 112389
On pitfalls in accuracy verification using time-dependent problems
- 1 December 2022
- Published by American Institute of Aeronautics and Astronautics (AIAA) in AIAA Journal
- Vol. 60 (12) , 6910-6925
Edge-Based Viscous Method for Node-Centered Finite-Volume Formulation on Tetrahedra
This paper presents a novel, efficient, edge-based viscous (EBV) discretization for finite-volume, node-centered formulations on tetrahedral grids. This new method is implemented in a practical, unstructured-grid Reynolds-averaged Navier–Stokes solver and applied to viscous-kernel computations that include evaluations of mean flow viscous fluxes, turbulence-model diffusion terms, and the corresponding Jacobian contributions. The EBV method uses an efficient loop over edges and features a compact discretization stencil based on nearest neighbors. This study verifies the EBV method by comparing its accuracy and iterative convergence with those of a well-established method based on a cell-based approach to discretization of viscous fluxes. Multifold efficiency gains for all viscous-kernel computations on tetrahedral grids are reported, leading to a significant reduction of the overall time to solution.
- 1 December 2022
- Published by American Institute of Aeronautics and Astronautics (AIAA) in AIAA Journal
- Vol. 60 (12) , 6910-6925
Edge-Based Viscous Method for Node-Centered Finite-Volume Formulation on Tetrahedra
This paper presents a novel, efficient, edge-based viscous (EBV) discretization for finite-volume, node-centered formulations on tetrahedral grids. This new method is implemented in a practical, unstructured-grid Reynolds-averaged Navier–Stokes solver and applied to viscous-kernel computations that include evaluations of mean flow viscous fluxes, turbulence-model diffusion terms, and the corresponding Jacobian contributions. The EBV method uses an efficient loop over edges and features a compact discretization stencil based on nearest neighbors. This study verifies the EBV method by comparing its accuracy and iterative convergence with those of a well-established method based on a cell-based approach to discretization of viscous fluxes. Multifold efficiency gains for all viscous-kernel computations on tetrahedral grids are reported, leading to a significant reduction of the overall time to solution.