scispace - formally typeset
J

Jay P. Boris

Researcher at United States Naval Research Laboratory

Publications -  187
Citations -  11172

Jay P. Boris is an academic researcher from United States Naval Research Laboratory. The author has contributed to research in topics: Flux-corrected transport & Computational fluid dynamics. The author has an hindex of 40, co-authored 187 publications receiving 10845 citations. Previous affiliations of Jay P. Boris include United States Department of the Navy.

Papers
More filters
Journal ArticleDOI

Flux-corrected transport. I. SHASTA, a fluid transport algorithm that works

TL;DR: A class of explicit, Eulerian finite-difference algorithms for solving the continuity equation which are built around a technique called “flux correction,” which yield realistic, accurate results.
Book

Numerical Simulation of Reactive Flow

TL;DR: This new edition takes account of the explosive growth in computer technology and the greatly increased capacity for solving complex reactive-flow problems and presents algorithms for reactive flow simulations, describes some trade-offs involved, and gives guidance for building and using models of complex reactive flows.
Journal ArticleDOI

New Insights into Large Eddy Simulation

TL;DR: In this paper, the authors proposed a monotone integrated large eddy simulation approach, which incorporates a form of turbulence modeling applicable when the large-scale flows of interest are intrinsically time dependent, thus throwing common statistical models into question.

New insights into large eddy simulation

TL;DR: In this paper, the authors proposed a monotone integrated large eddy simulation approach, which incorporates a form of turbulence modeling applicable when the large-scale flows of interest are intrinsically time dependent, thus throwing common statistical models into question.
Journal ArticleDOI

Flux-corrected transport II: Generalizations of the method

TL;DR: In this paper, the Lax-Wendroff, leapfrog, and upstreaming types of FCT are compared with one another and with some conventional FCT algorithms.