scispace - formally typeset
M

Mark H. Carpenter

Researcher at Langley Research Center

Publications -  120
Citations -  9282

Mark H. Carpenter is an academic researcher from Langley Research Center. The author has contributed to research in topics: Finite difference method & Boundary value problem. The author has an hindex of 41, co-authored 119 publications receiving 8211 citations. Previous affiliations of Mark H. Carpenter include Brown University.

Papers
More filters
Journal ArticleDOI

Time-stable boundary conditions for finite-difference schemes solving hyperbolic systems: methodology and application to high-order compact schemes

TL;DR: In this paper, a method for constructing boundary conditions (numerical and physical) of the required accuracy for compact (Pade-like) high-order finite-difference schemes for hyperbolic systems is presented.
Journal ArticleDOI

Additive Runge-Kutta Schemes for Convection-Diffusion-Reaction Equations

TL;DR: Additive Runge-Kutta (ARK) methods are investigated for application to the spatially discretized one-dimensional convection-diffusion-reaction (CDR) equations and results for the fifth-order method are disappointing, but both the new third- and fourth-order methods are at least as efficient as existing ARK2 methods.
Journal ArticleDOI

Low-storage, Explicit Runge-Kutta Schemes for the Compressible Navier-Stokes Equations

TL;DR: The derivation of low-storage, explicit Runge-Kutta (ERK) schemes has been performed in the context of integrating the compressible Navier-Stokes equations via direct numerical simulation, with results that can be nearly matched with existing full-storage methods.
Journal ArticleDOI

A Stable and Conservative Interface Treatment of Arbitrary Spatial Accuracy

TL;DR: In this paper, the authors derived stable and accurate interface conditions based on the SAT penalty method for the linear advection?diffusion equation, which are functionally independent of the spatial order of accuracy and rely only on the form of the discrete operator.

Fourth-order 2N-storage Runge-Kutta schemes

TL;DR: A family of five-stage fourth-order Runge-Kutta schemes is derived; these schemes required only two storage locations and are considerably more efficient and accurate than existing third-order low-storage schemes.