Jacob Badger

Jacob Badger

Auto-generated profile, based on publicly available information

Jacob Badger

Oden Institute The University of Texas at Austin USA

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 October 2019 in Combustion Science and Technology
Verified
Journal Article
Closed access
JBJ. Badger
J. Badger
BWB.W. Webb
B.W. Webb
VSV.P. Solovjov
V.P. Solovjov
Recent work demonstrated the integration of the Spectral Line Weighted-Sum-of-Gray-Gases (SLW) model for advanced modeling of gas radiation in high temperature gases in a comprehensive combustion modeling prediction scheme. This prior work compared predictions using the Reference Approach SLW model with the Domain Based Weighted-Sum-of-Gray-Gases model used in Fluent. The present work reports on the implementation of the Rank Correlated SLW model and the Locally Correlated SLW model in the combustion scenario studied in the earlier publication, complementing the Reference Approach SLW model predictions reported previously. The predictions confirm the need for such advanced radiation modeling to accurately resolve the radiative flux divergence and temperature fields, particularly in localized regions of the flame zone where very large differences in temperature and radiative heating may be found relative to the more rudimentary modeling approach. Results also reveal the dependence of the predictions for the three SLW model variants on the number of gray gases employed in the simulations. The Reference Approach and Locally Correlated SLW model predictions exhibit rather significant dependence on the number of gray gases used. It is shown that the Rank Correlated SLW model is the most robust of all models, and demonstrates that it can achieve accurate solutions with as few as 3–5 gray gases.

12 April 2019 in Journal of Applied Mechanics
Verified
Journal Article
Closed access
PDF file
JBJacob C. Badger
Jacob C. Badger
TNTodd G. Nelson
Todd G. Nelson
RLRobert Lang
Robert Lang
DHDenise Marie Halverson
Denise Marie Halverson
LHLarry L. Howell
Larry L. Howell

21 August 2023 in Computers & Mathematics with Applications
Verified
Journal Article
Closed access
JBJacob Badger
Jacob Badger
SHStefan Henneking
Stefan Henneking
SPSocratis Petrides
Socratis Petrides
LDLeszek Demkowicz
Leszek Demkowicz

1 April 2022 in Journal of Computational Physics
Verified
Journal Article
Closed access
VVVianey Villamizar
Vianey Villamizar
JBJacob C. Badger
Jacob C. Badger
SASebastian Acosta
Sebastian Acosta

4 March 2024 in Journal of Open Source Software
Verified
Journal Article
Open access
PDF file
SHStefan Henneking
Stefan Henneking
SPSocratis Petrides
Socratis Petrides
FFFederico Fuentes
Federico Fuentes
JBJacob Badger
Jacob Badger
LDLeszek Demkowicz
Leszek Demkowicz
The ℎ𝑝3D finite element (FE) library is a tool for computational modeling of engineering applications. The library provides a framework for discretization of three-dimensional 1 multiphysics problems described by systems of partial differential equations. ℎ𝑝3D can be compiled in real or complex mode to accommodate the need for real-or complex-valued physics variables, respectively. The library is written entirely in Fortran; user applications interfacing with the library are also written in Fortran. The ℎ𝑝3D software can be installed and runs efficiently on various CPU-based compute architectures, from laptops and single workstations to state-of-the-art supercomputers.

10 April 2023 in arXiv
Verified
Preprint
Open access
PDF file
JWJonathan Wittmer
Jonathan Wittmer
JBJacob Badger
Jacob Badger
HSHari Sundar
Hari Sundar
TBTan Bui-Thanh
Tan Bui-Thanh
PDE-constrained inverse problems are some of the most challenging and computationally demanding problems in computational science today. Fine meshes that are required to accurately compute the PDE solution introduce an enormous number of parameters and require large scale computing resources such as more processors and more memory to solve such systems in a reasonable time. For inverse problems constrained by time dependent PDEs, the adjoint method that is often employed to efficiently compute gradients and higher order derivatives requires solving a time-reversed, so-called adjoint PDE that depends on the forward PDE solution at each timestep. This necessitates the storage of a high dimensional forward solution vector at every timestep. Such a procedure quickly exhausts the available memory resources. Several approaches that trade additional computation for reduced memory footprint have been proposed to mitigate the memory bottleneck, including checkpointing and compression strategies. In this work, we propose a close-to-ideal scalable compression approach using autoencoders to eliminate the need for checkpointing and substantial memory storage, thereby reducing both the time-to-solution and memory requirements. We compare our approach with checkpointing and an off-the-shelf compression approach on an earth-scale ill-posed seismic inverse problem. The results verify the expected close-to-ideal speedup for both the gradient and Hessian-vector product using the proposed autoencoder compression approach. To highlight the usefulness of the proposed approach, we combine the autoencoder compression with the data-informed active subspace (DIAS) prior to show how the DIAS method can be affordably extended to large scale problems without the need of checkpointing and large memory.