SEARCH · Search NASA

Results for “computational frameworks”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 127 records · Page 7

All sources NASA NTRS DOE OSTI

DOE OSTI2019

Calculating the Symmetry Number of Flexible Sphere Clusters

We present a theoretical and computational framework to compute the symmetry number of a flexible sphere cluster in R 3 , using a definition of symmetry that arises naturally when calculating the equilibrium probability of a cluster of spheres in the sticky-sphere limit. We define the sticky symmetry group of the cluster as the set of permutations and inversions of the spheres which preserve adjacency and can be realized by continuous deformations of the cluster that do not change the set of contacts or cause particles to overlap. The symmetry number is the size of the sticky symmetry group. We introduce a numerical algorithm to compute the sticky symmetry group and symmetry number, and show it works well on several test cases. Furthermore, we show that once the sticky symmetry group has been calculated for indistinguishable spheres, the symmetry group for partially distinguishable spheres (those with nonidentical interactions) can be efficiently obtained without repeating the laborious parts of the computations. Finally, we use our algorithm to calculate the partition functions of every possible connected cluster of six identical sticky spheres, generating data that may be used to design interactions between spheres so they self-assemble into a desired structure.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

First principles reaction discovery: from the Schrodinger equation to experimental prediction for methane pyrolysis

Our recent success in exploiting graphical processing units (GPUs) to accelerate quantum chemistry computations led to the development of the ab initio nanoreactor, a computational framework for automatic reaction discovery and kinetic model construction. In this work, we apply the ab initio nanoreactor to methane pyrolysis, from automatic reaction discovery to path refinement and kinetic modeling. Elementary reactions occurring during methane pyrolysis are revealed using GPU-accelerated ab initio molecular dynamics simulations. Subsequently, these reaction paths are refined at a higher level of theory with optimized reactant, product, and transition state geometries. Reaction rate coefficients are calculated by transition state theory based on the optimized reaction paths. The discovered reactions lead to a kinetic model with 53 species and 134 reactions, which is validated against experimental data and simulations using literature kinetic models. We highlight the advantage of leveraging local brute force and Monte Carlo sensitivity analysis approaches for efficient identification of important reactions. Both sensitivity approaches can further improve the accuracy of the methane pyrolysis kinetic model. The results in this work demonstrate the power of the ab initio nanoreactor framework for computationally affordable systematic reaction discovery and accurate kinetic modeling.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2020

A mathematical model of asynchronous data flow in parallel computers *

Abstract We present a simplified model of data flow on processors in a high-performance computing framework involving computations necessitating inter-processor communications. From this ordinary differential model, we take its asymptotic limit, resulting in a model which treats the computer as a continuum of processors and data flow as an Eulerian fluid governed by a conservation law. We derive a Hamilton–Jacobi equation associated with this conservation law for which the existence and uniqueness of solutions can be proven. We then present the results of numerical experiments for both discrete and continuum models; these show a qualitative agreement between the two and the effect of variations in the computing environment’s processing capabilities on the progress of the modelled computation.

Barnard, Richard C.↗

DOE OSTI2016

Cohesive phase-field fracture and a PDE constrained optimization approach to fracture inverse problems

In recent years there has been a proliferation of modeling techniques for forward predictions of crack propagation in brittle materials, including: phase-field/gradient damage models, peridynamics, cohesive-zone models, and G/XFEM enrichment techniques. However, progress on the corresponding inverse problems has been relatively lacking. Taking advantage of key features of existing modeling approaches, we propose a parabolic regularization of Barenblatt cohesive models which borrows extensively from previous phase-field and gradient damage formulations. An efficient explicit time integration strategy for this type of nonlocal fracture model is then proposed and justified. In addition, we present a C++ computational framework for computing in- put parameter sensitivities efficiently for explicit dynamic problems using the adjoint method. This capability allows for solving inverse problems involving crack propagation to answer interesting engineering questions such as: 1) what is the optimal design topology and material placement for a heterogeneous structure to maximize fracture resistance, 2) what loads must have been applied to a structure for it to have failed in an observed way, 3) what are the existing cracks in a structure given various experimental observations, etc. In this work, we focus on the first of these engineering questions and demonstrate a capability to automatically and efficiently compute optimal designs intended to minimize crack propagation in structures.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1982

Numerical simulation of wall-bounded turbulent shear flows

Developments in three dimensional, time dependent numerical simulation of turbulent flows bounded by a wall are reviewed. Both direct and large eddy simulation techniques are considered within the same computational framework. The computational spatial grid requirements as dictated by the known structure of turbulent boundary layers are presented. The numerical methods currently in use are reviewed and some of the features of these algorithms, including spatial differencing and accuracy, time advancement, and data management are discussed. A selection of the results of the recent calculations of turbulent channel flow, including the effects of system rotation and transpiration on the flow are included.

Moin, P.↗

NASA NTRS1982

Numerical simulation of wall-bounded turbulent shear flows

Moin, P.↗

DOE OSTI2019

Strain localization and dynamic recrystallization in polycrystalline metals: Thermodynamic theory and simulation framework

We describe a theoretical and computational framework for adiabatic shear banding (ASB) and dynamic recrystallization (DRX) in polycrystalline materials. The Langer-Bouchbinder-Lookman (LBL) thermodynamic theory of polycrystalline plasticity, which we recently reformulated to describe DRX via the inclusion of the grain boundary density or the grain size as an internal state variable, provides a convenient and self-consistent way to represent the viscoplastic and thermal behavior of the material, with minimal ad-hoc assumptions regarding the initiation of yielding or onset of shear banding. Here, we implement the LBL-DRX theory in conjunction with a finite-element computational framework. Favorable comparison to experimental measurements on a top-hat AISI 316L stainless steel sample compressed with a split-Hopkinson pressure bar suggests the accuracy and usefulness of the LBL-DRX framework, and demonstrates the crucial role of DRX in strain localization.

36 MATERIALS SCIENCE↗

DOE OSTI2018

Guest-Dependent Stabilization of the Low-Spin State in Spin-Crossover Metal-Organic Frameworks

Computer simulations are carried out to characterize the variation of spin-crossover (SCO) behavior of the prototypical {Fe(pz)[Pt(CN) 4 ]} metal-organic framework (MOF) upon adsorption of chemically and structurally different guest molecules. A detailed analysis of both strength and anisotropy of guest molecule–framework interactions reveals direct correlations between the mobility of the guest molecules inside the MOF pores, the rotational mobility of the pyrazine rings of the framework, and the stabilization of the low-spin state of the material. On the basis of these correlations, precise molecular criteria are established for predicting the spin state of {Fe(pz)[Pt(CN) 4 ]} upon guest adsorption. Finally, predictions of the SCO temperature upon adsorption of various toxic gases demonstrate that in silico modeling can provide fundamental insights and design principles for the development of spin-crossover MOFs for applications in gas detection and chemical sensing.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS1994

Dynamic Load Balancing For Grid Partitioning on a SP-2 Multiprocessor: A Framework

Computational requirements of full scale computational fluid dynamics change as computation progresses on a parallel machine. The change in computational intensity causes workload imbalance of processors, which in turn requires a large amount of data movement at runtime. If parallel CFD is to be successful on a parallel or massively parallel machine, balancing of the runtime load is indispensable. Here a framework is presented for dynamic load balancing for CFD applications, called Jove. One processor is designated as a decision maker Jove while others are assigned to computational fluid dynamics. Processors running CFD send flags to Jove in a predetermined number of iterations to initiate load balancing. Jove starts working on load balancing while other processors continue working with the current data and load distribution. Jove goes through several steps to decide if the new data should be taken, including preliminary evaluate, partition, processor reassignment, cost evaluation, and decision. Jove running on a single IBM SP2 node has been completely implemented. Preliminary experimental results show that the Jove approach to dynamic load balancing can be effective for full scale grid partitioning on the target machine IBM SP2.

Sohn, Andrew↗

NASA NTRS1994

Dynamic Load Balancing for Grid Partitioning on a SP-2 Multiprocessor: A Framework

Computational requirements of full scale computational fluid dynamics change as computation progresses on a parallel machine. The change in computational intensity causes workload imbalance of processors, which in turn requires a large amount of data movement at runtime. If parallel CFD is to be successful on a parallel or massively parallel machine, balancing of the runtime load is indispensable. Here a framework is presented for dynamic load balancing for CFD applications, called Jove. One processor is designated as a decision maker Jove while others are assigned to computational fluid dynamics. Processors running CFD send flags to Jove in a predetermined number of iterations to initiate load balancing. Jove starts working on load balancing while other processors continue working with the current data and load distribution. Jove goes through several steps to decide if the new data should be taken, including preliminary evaluate, partition, processor reassignment, cost evaluation, and decision. Jove running on a single EBM SP2 node has been completely implemented. Preliminary experimental results show that the Jove approach to dynamic load balancing can be effective for full scale grid partitioning on the target machine IBM SP2.

Sohn, Andrew↗

DOE OSTI2023

A parallel p ‐adaptive discontinuous Galerkin method for the Euler equations with dynamic load‐balancing on tetrahedral grids

Abstract A novel p ‐adaptive discontinuous Galerkin (DG) method has been developed to solve the Euler equations on three‐dimensional tetrahedral grids. Hierarchical orthogonal basis functions are adopted for the DG spatial discretization while a third order TVD Runge‐Kutta method is used for the time integration. A vertex‐based limiter is applied to the numerical solution in order to eliminate oscillations in the high order method. An error indicator constructed from the solution of order and is used to adapt degrees of freedom in each computational element, which remarkably reduces the computational cost while still maintaining an accurate solution. The developed method is implemented with under the Charm++ parallel computing framework. Charm++ is a parallel computing framework that includes various load‐balancing strategies. Implementing the numerical solver under Charm++ system provides us with access to a suite of dynamic load balancing strategies. This can be efficiently used to alleviate the load imbalances created by p ‐adaptation. A number of numerical experiments are performed to demonstrate both the numerical accuracy and parallel performance of the developed p ‐adaptive DG method. It is observed that the unbalanced load distribution caused by the parallel p ‐adaptive DG method can be alleviated by the dynamic load balancing from Charm++ system. Due to this, high performance gain can be achieved. For the testcases studied in the current work, the parallel performance gain ranged from 1.5× to 3.7×. Therefore, the developed p ‐adaptive DG method can significantly reduce the total simulation time in comparison to the standard DG method without p ‐adaptation.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

A framework of computer vision-enhanced microfluidic approach for automated assessment of the transient sickling kinetics in sickle red blood cells

The occurrence of vaso-occlusive crisis greatly depends on the competition between the sickling delay time and the transit time of individual sickle cells, i.e., red blood cells from sickle cell disease (SCD) patients, while they are traversing the circulatory system. Many drugs for treating SCD work by inhibiting the polymerization of sickle hemoglobin (HbS), effectively delaying the sickling process in sickle cells (SS RBCs). Most previous studies on screening anti-sickling drugs, such as voxelotor, rely on in vitro testing of sickling characteristics, often conducted under prolonged deoxygenation for up to 1 hour. However, since the microcirculation of RBCs typically takes less than 1 minute, the results of these studies may be less accurate and less relevant for in vitro-in vivo correlation. In our current study, we introduce a computer vision-enhanced microfluidic framework designed to automatically capture the transient sickling kinetics of SS RBCs within a 1-min timeframe. Our study has successfully detected differences in the transient sickling kinetics between vehicle control and voxelotor-treated SS RBCs. This approach has the potential for broader applications in screening anti-sickling therapies.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2017

Evaluating the role of coherent delocalized phonon-like modes in DNA cyclization

The innate flexibility of a DNA sequence is quantified by the Jacobson-Stockmayer’s J-factor, which measures the propensity for DNA loop formation. Recent studies of ultra-short DNA sequences revealed a discrepancy of up to six orders of magnitude between experimentally measured and theoretically predicted J-factors. These large differences suggest that, in addition to the elastic moduli of the double helix, other factors contribute to loop formation. We develop a new theoretical model that explores how coherent delocalized phonon-like modes in DNA provide single-stranded ”flexible hinges” to assist in loop formation. We also combine the Czapla-Swigon-Olson structural model of DNA with our extended Peyrard-Bishop-Dauxois model and, without changing any of the parameters of the two models, apply this new computational framework to 86 experimentally characterized DNA sequences. Our results demonstrate that the new computational framework can predict J-factors within an order of magnitude of experimental measurements for most ultra-short DNA sequences, while continuing to accurately describe the J-factors of longer sequences. Furthermore, we demonstrate that our computational framework can be used to describe the cyclization of DNA sequences that contain a base pair mismatch. Overall, our results support the conclusion that coherent delocalized phonon-like modes play an important role in DNA cyclization.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2023

A computational modeling framework for pre-clinical evaluation of cardiac mapping systems

There are a variety of difficulties in evaluating clinical cardiac mapping systems, most notably the inability to record the transmembrane potential throughout the entire heart during patient procedures which prevents the comparison to a relevant “gold standard”. Cardiac mapping systems are comprised of hardware and software elements including sophisticated mathematical algorithms, both of which continue to undergo rapid innovation. The purpose of this study is to develop a computational modeling framework to evaluate the performance of cardiac mapping systems. The framework enables rigorous evaluation of a mapping system’s ability to localize and characterize (i.e., focal or reentrant) arrhythmogenic sources in the heart. The main component of our tool is a library of computer simulations of various dynamic patterns throughout the entire heart in which the type and location of the arrhythmogenic sources are known. Our framework allows for performance evaluation for various electrode configurations, heart geometries, arrhythmias, and electrogram noise levels and involves blind comparison of mapping systems against a “silver standard” comprised of computer simulations in which the precise transmembrane potential patterns throughout the heart are known. A feasibility study was performed using simulations of patterns in the human left atria and three hypothetical virtual catheter electrode arrays. Activation times (AcT) and patterns (AcP) were computed for three virtual electrode arrays: two basket arrays with good and poor contact and one high-resolution grid with uniform spacing. The average root mean squared difference of AcTs of electrograms and those of the nearest endocardial action potential was less than 1 ms and therefore appears to be a poor performance metric. In an effort to standardize performance evaluation of mapping systems a novel performance metric is introduced based on the number of AcPs identified correctly and those considered spurious as well as misclassifications of arrhythmia type; spatial and temporal localization accuracy of correctly identified patterns was also quantified. This approach provides a rigorous quantitative analysis of cardiac mapping system performance. Proof of concept of this computational evaluation framework suggests that it could help safeguard that mapping systems perform as expected as well as provide estimates of system accuracy.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2018

Mining data in a dynamic PRA framework

Computational (also known as Dynamic) Probabilistic Risk Assessment (PRA) methods employs system simulation codes coupled with stochastic analysis tools in order to determine probabilities of certain outcomes such as system failure. In contrast to classical PRA methods (i.e., Event-Tree and Fault-Tree) in which timing and sequencing of events is set by the analyst, accident progression is dictated by the system control logic and its interaction with system temporal evolution. Due to the nature of the problem, Simulation-Based PRA methods require large amount of computationally expensive simulation runs. In addition, these methods usually generate a large number of simulation runs (database storage may be on the order of gigabytes or higher). In this paper we investigate and apply several methods and algorithms to analyze these large amounts of time-dependent data. Furthermore, the scope of this article is to present a broad overview of methods and algorithms that can be used to improve data quality and to analyze and extract information from large data sets containing time dependent data. In this context, “extracting information” means constructing input-output correlations, finding commonalities, and identifying outliers.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Height Above Nearest Drainage (HAND) and Hydraulic Property Table for CONUS - Version 0.21 (20200601)

The continental flood inundation mapping (CFIM) framework is a high-performance computing (HPC)-based computational framework for the Height Above Nearest Drainage (HAND)-based inundation mapping methodology. Using the 10m Digital Elevation Model (DEM) data produced by U.S. Geological Survey (USGS) 3DEP (the 3-D Elevation Program) and the NHDPlus hydrography dataset produced by USGS and the U.S. Environmental Protection Agency (EPA), a hydrological terrain raster called HAND is computed for HUC6 units in the conterminous U.S. (CONUS). The value of each raster cell in HAND is an approximation of the relative elevation between the cell and its nearest water stream. Derived from HAND, a hydraulic property table is established to calculate river geometry properties for each of the 2.7 million river reaches covered by NHDPlus (5.5 million kilometers in total length). This table is a lookup table for water depth given an input stream flow value. Such lookup is available between water depth 0m and 25m at 1-foot interval. The flood inundation map is then computed by using HAND and this lookup table based on the near real-time water forecast from the National Water Model (NWM) at the National Oceanic and Atmospheric Administration (NOAA). HAND and the Hydraulic Property Table version v0.21 is an upgrade to v0.2. Version 0.21 applies NHD HR etching to DEMs for all HUC6 units before running the HAND workflow. This new version also fixed the issue of void areas along HUC boundary. This dataset comprises 331 HUC6 units for CONUS (excluding the five great lakes units), each is a downloadable zip file. Version 0.1 was computed at the National Center for Supercomputing Applications (NCSA) at the University of Illinois at Urban-Champaign in 2016 and is currently hosted at the Texas Advanced Computing Center (TACC). Please cite this data DOI and the following publications and data DOIs when you use HAND and the hydraulic property table: Liu, Yan Y. Height Above Nearest Drainage (HAND) and Hydraulic Property Table for CONUS - Version 0.2. (20200301). Oak Ridge Leadership Computing Facility. (2020). DOI: 10.13139/ORNLNCCS/1608331 Liu, Yan Y., David R. Maidment, David G. Tarboton, Xing Zheng, and Shaowen Wang. 'A CyberGIS integration and computation framework for high-resolution continental-scale flood inundation mapping.' JAWRA Journal of the American Water Resources Association 54, no. 4 (2018): 770-784. DOI: 10.1111/1752-1688.12660 Zheng, Xing, David G. Tarboton, David R. Maidment, Yan Y. Liu, and Paola Passalacqua. 'River channel geometry and rating curve estimation using height above the nearest drainage.' JAWRA Journal of the American Water Resources Association 54, no. 4 (2018): 785-806. DOI: 10.1111/1752-1688.12661 Liu, Y. (2018). Height Above Nearest Drainage (HAND) for CONUS, HydroShare, https://doi.org/10.4211/hs.69f7d237675c4c73938481904358c789 LICENSE FOR USE -- MAPS AND DATA DISCLAIMER This resource is shared under the Creative Commons Attribution CC BY, http://creativecommons.org/licenses/by/4.0/ MAPS AND DATA DISCLAIMER The Oak Ridge National Laboratory (ORNL) shall not be held liable for improper or incorrect use of the data described or information contained on this map or associated series of maps. The data and related map graphics are not legal, land survey or engineering documents and are not intended to be used as such. ORNL gives no warranty, express or implied, as to the accuracy, reliability, utility or completeness of this information. The user of these maps and data assumes all responsibility and risk for the use of the maps and data. ORNL disclaims all warranties, representations or endorsements either express or implied, with regard to the information contained in this map product, including, but not limited to, all implied warranties of merchantability, fitness for a particular purpose or non-infringement. This preliminary map product is for research and review purposes only. It is not intended to be used for emergency management operational or life safety decisions at the local or regional governmental level or by the general public. Users requiring information regarding hazardous conditions or meteorological conditions for specific geographic areas should consult directly with their city or county emergency management office.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2020

Height Above Nearest Drainage (HAND) and Hydraulic Property Table for CONUS

The continental flood inundation mapping (CFIM) framework is a high-performance computing (HPC)-based computational framework for the Height Above Nearest Drainage (HAND)-based inundation mapping methodology. Using the 10m Digital Elevation Model (DEM) data produced by U.S. Geological Survey (USGS) 3DEP (the 3-D Elevation Program) and the NHDPlus hydrography dataset produced by USGS and the U.S. Environmental Protection Agency (EPA), a hydrological terrain raster called HAND is computed for HUC6 units in the conterminous U.S. (CONUS). The value of each raster cell in HAND is an approximation of the relative elevation between the cell and its nearest water stream. Derived from HAND, a hydraulic property table is established to calculate river geometry properties for each of the 2.7 million river reaches covered by NHDPlus (5.5 million kilometers in total length). This table is a lookup table for water depth given an input stream flow value. Such lookup is available between water depth 0m and 25m at 1-foot interval. The flood inundation map is then computed by using HAND and this lookup table based on the near real-time water forecast from the National Water Model (NWM) at the National Oceanic and Atmospheric Administration (NOAA). HAND and the Hydraulic Property Table version 0.2. is created to correspond to data updates in the USGS 1/3 arcsec DEM, the USGS National Hydrography Dataset, including its Water Boundary Dataset, and the NHDPlus medium resolution dataset. This dataset comprises 331 HUC6 units for CONUS (excluding the five great lakes units), each is a downloadable zip file. Version 0.1 was computed at the National Center for Supercomputing Applications (NCSA) at the University of Illinois at Urban-Champaign in 2016 and is currently hosted at the Texas Advanced Computing Center (TACC). Please cite this data DOI and the following publications and data DOIs when you use HAND and the hydraulic property table: Liu, Yan Y., David R. Maidment, David G. Tarboton, Xing Zheng, and Shaowen Wang. 'A CyberGIS integration and computation framework for high-resolution continental-scale flood inundation mapping.' JAWRA Journal of the American Water Resources Association 54, no. 4 (2018): 770-784. DOI: 10.1111/1752-1688.12660 Zheng, Xing, David G. Tarboton, David R. Maidment, Yan Y. Liu, and Paola Passalacqua. 'River channel geometry and rating curve estimation using height above the nearest drainage.' JAWRA Journal of the American Water Resources Association 54, no. 4 (2018): 785-806. DOI: 10.1111/1752-1688.12661 Liu, Y. (2018). Height Above Nearest Drainage (HAND) for CONUS - v0.1, HydroShare, https://doi.org/10.4211/hs.69f7d237675c4c73938481904358c789 LICENSE FOR USE -- MAPS AND DATA DISCLAIMER This resource is shared under the Creative Commons Attribution CC BY, http://creativecommons.org/licenses/by/4.0/ MAPS AND DATA DISCLAIMER The Oak Ridge National Laboratory (ORNL) shall not be held liable for improper or incorrect use of the data described or information contained on this map or associated series of maps. The data and related map graphics are not legal, land survey or engineering documents and are not intended to be used as such. ORNL gives no warranty, express or implied, as to the accuracy, reliability, utility or completeness of this information. The user of these maps and data assumes all responsibility and risk for the use of the maps and data. ORNL disclaims all warranties, representations or endorsements either express or implied, with regard to the information contained in this map product, including, but not limited to, all implied warranties of merchantability, fitness for a particular purpose or non-infringement. This preliminary map product is for research and review purposes only. It is not intended to be used for emergency management operational or life safety decisions at the local or regional governmental level or by the general public. Users requiring information regarding hazardous conditions or meteorological conditions for specific geographic areas should consult directly with their city or county emergency management office.

54 ENVIRONMENTAL SCIENCES↗

NASA NTRS2022

Validation of a High-Fidelity Supersonic Parachute Inﬂation Dynamics Model and Best Practice

The parachute inflation dynamics (PID) of a Disk-Gap-Band (DGB) parachute system travelling at supersonic velocities in the high-altitude Earth atmosphere is simulated using a high-fidelity, multiphysics, massively-parallel computational framework. The sensitivity of the simulation results with respect to critical modelling and simulation parameters, including the fluid mechanical governing equations (Euler vs Navier-Stokes with RANS turbulence closure vs Navier-Stokes with LES turbulence closer), the interaction between the flow and the suspension lines (accounted for vs not accounted for), the dynamics of the payload (restrained vs free), and the material model of the heterogeneous fabric canopy (Saint-Venant Kirchoff vs mechanics-informed multiscale neural network), is extensively investigated. The parameter investigation is enabled by advancements to the state-of-the-art in the modelling and simulation of the supersonic parachute inflation process, which are presented as part of the computational framework. The predictive quality of the computational framework in the context of supersonic PID is validated by comparison of the simulation results with the experimental results from NASA’s Advanced Supersonic Parachute Research (ASPIRE) project. Through the validation, best practices for the modelling and simulation of supersonic PID are developed and proposed.

Rabinovitch, Jason↗