Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computing methodologies”

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.

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

At least 523 records · Page 29

The DESI DR1 Peculiar Velocity Survey: Mock Catalog

We describe the production of the official set of mock catalogs for the Dark Energy Spectroscopic Instrument Peculiar Velocity Survey (DESI-PV) Data Release 1 (DR1). Our mock catalogs reproduce the Bright Galaxy Survey number density and clustering at low redshift $(z<0.1)$ and the DESI PV samples of Fundamental plane and Tully-Fisher distances, from which we derive peculiar velocities. We carefully match mock and data properties and we mimic measurements of distance indicators and peculiar velocities, which follow the same statistical properties as real data. Mock samples of type-Ia supernovae also complement the other two distance indicators. Our 675 available mock realizations were used consistently by our three different methodologies described in our companion papers that measure the growth rate of structure $fσ_8$ with DESI PV DR1. Those mocks allow us to perform precise tests of clustering models and uncertainty estimation to an unprecedented level of accuracy, and compute correlations between methodologies. The consensus value for the DESI DR1 PV growth rate measurement is $fσ_8 = 0.450 \pm 0.055$. This sample of mock catalogs represents the largest and most realistic set for cosmological measurements with peculiar velocities to date.

Bautista, J. [Marseille, CPPM]↗

Decision Analyses Related to Groundwater Remediation - 17051

Traditional decision analyses of groundwater remediation scenarios frequently fail because the probability of adverse, unanticipated events occurring is often high. This is driven by many factors including that (1) the models developed to represent the flow and transport in contaminated aquifers are typically simpler than reality and do not account for all the important governing processes, (2) probability distributions are assigned to critical performance parameters (such as model inputs or characteristics of the engineered remediation systems) even though some of these parameters might be unknown or not be very well constrained. However, there is a novel decision analysis methodology and a computational tool based on Bayesian Information-Gap Decision Theory (BIG-DT) that are designed to mitigate the shortcomings of the models and probabilistic decision analyses by leveraging a non-probabilistic decision theory -- information-gap decision theory. The new decision analysis methodology considers possible models that have not been explicitly enumerated and does not require us to commit to a particular probability distribution for model and remediation-design parameters. Both the set of possible models and the set of possible probability distributions grow as the degree of uncertainty increases. The fundamental question that BIG-DT asks is 'How large can these sets be before a particular decision results in an undesirable outcome?'. The decision that allows these sets to be the largest is considered to be the best option. In this way, BIG-DT enables robust decision-support for groundwater remediation problems. Here, we apply BIG-DT to a representative groundwater remediation scenario where different options for hydraulic containment and pump and treat are being considered. BIG-DT requires many model runs and high-performance computing resources are needed when complex models are used. We demonstrate the BIG-DT analyses on a series of synthetic problems that are designed to be consistent with real-world problems such as Los Alamos National Laboratory (LANL) contamination sites. We also discuss a general framework for how the BIG-DT analyses will be carried out at the chromium groundwater contamination site at LANL. BIG-DT is implemented in Julia (a high-level, high-performance dynamic programming language for technical computing) and is part of the MADS framework (http://mads.lanl.gov and http://madsjulia.github.io/Mads.jl). (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Computational Aerodynamics of Shuttle Orbiter Damage Scenarios in Support of the Columbia Accident Investigation

In support of the Columbia Accident Investigation, inviscid computations of the aerodynamic characteristics for various Shuttle Orbiter damage scenarios were performed using the FELISA unstructured CFD solver. Computed delta aerodynamics were compared with the reconstructed delta aerodynamics in order to postulate a progression of damage through the flight trajectory. By performing computations at hypervelocity flight and CF4 tunnel conditions, a bridge was provided between wind tunnel testing in Langley's 20-Inch CF4 facility and the flight environment experienced by Columbia during re-entry. The rapid modeling capability of the unstructured methodology allowed the computational effort to keep pace with the wind tunnel and, at times, guide the wind tunnel efforts. These computations provided a detailed view of the flowfield characteristics and the contribution of orbiter components (such as the vertical tail and wing) to aerodynamic forces and moments that were unavailable from wind tunnel testing. The damage scenarios are grouped into three categories. Initially, single and multiple missing full RCC panels were analyzed to determine the effect of damage location and magnitude on the aerodynamics. Next is a series of cases with progressive damage, increasing in severity, in the region of RCC panel 9. The final group is a set of wing leading edge and windward surface deformations that model possible structural deformation of the wing skin due to internal heating of the wing structure. By matching the aerodynamics from selected damage scenarios to the reconstructed flight aerodynamics, a progression of damage that is consistent with the flight data, debris forensics, and wind tunnel data is postulated.

Bibb, Karen L.↗

A transient FETI methodology for large-scale parallel implicit computations in structural mechanics, part 2

Explicit codes are often used to simulate the nonlinear dynamics of large-scale structural systems, even for low frequency response, because the storage and CPU requirements entailed by the repeated factorizations traditionally found in implicit codes rapidly overwhelm the available computing resources. With the advent of parallel processing, this trend is accelerating because explicit schemes are also easier to parallellize than implicit ones. However, the time step restriction imposed by the Courant stability condition on all explicit schemes cannot yet and perhaps will never be offset by the speed of parallel hardware. Therefore, it is essential to develop efficient and robust alternatives to direct methods that are also amenable to massively parallel processing because implicit codes using unconditionally stable time-integration algorithms are computationally more efficient than explicit codes when simulating low-frequency dynamics. Here we present a domain decomposition method for implicit schemes that requires significantly less storage than factorization algorithms, that is several times faster than other popular direct and iterative methods, that can be easily implemented on both shared and local memory parallel processors, and that is both computationally and communication-wise efficient. The proposed transient domain decomposition method is an extension of the method of Finite Element Tearing and Interconnecting (FETI) developed by Farhat and Roux for the solution of static problems. Serial and parallel performance results on the CRAY Y-MP/8 and the iPSC-860/128 systems are reported and analyzed for realistic structural dynamics problems. These results establish the superiority of the FETI method over both the serial/parallel conjugate gradient algorithm with diagonal scaling and the serial/parallel direct method, and contrast the computational power of the iPSC-860/128 parallel processor with that of the CRAY Y-MP/8 system.

Farhat, Charbel↗

A transient FETI methodology for large-scale parallel implicit computations in structural mechanics

Explicit codes are often used to simulate the nonlinear dynamics of large-scale structural systems, even for low frequency response, because the storage and CPU requirements entailed by the repeated factorizations traditionally found in implicit codes rapidly overwhelm the available computing resources. With the advent of parallel processing, this trend is accelerating because explicit schemes are also easier to parallelize than implicit ones. However, the time step restriction imposed by the Courant stability condition on all explicit schemes cannot yet -- and perhaps will never -- be offset by the speed of parallel hardware. Therefore, it is essential to develop efficient and robust alternatives to direct methods that are also amenable to massively parallel processing because implicit codes using unconditionally stable time-integration algorithms are computationally more efficient when simulating low-frequency dynamics. Here we present a domain decomposition method for implicit schemes that requires significantly less storage than factorization algorithms, that is several times faster than other popular direct and iterative methods, that can be easily implemented on both shared and local memory parallel processors, and that is both computationally and communication-wise efficient. The proposed transient domain decomposition method is an extension of the method of Finite Element Tearing and Interconnecting (FETI) developed by Farhat and Roux for the solution of static problems. Serial and parallel performance results on the CRAY Y-MP/8 and the iPSC-860/128 systems are reported and analyzed for realistic structural dynamics problems. These results establish the superiority of the FETI method over both the serial/parallel conjugate gradient algorithm with diagonal scaling and the serial/parallel direct method, and contrast the computational power of the iPSC-860/128 parallel processor with that of the CRAY Y-MP/8 system.

Farhat, Charbel↗

String Method for Protein–Protein Binding Free-Energy Calculations

A powerful computational strategy to determine the equilibrium association constant of two macromolecules with explicit-solvent molecular dynamics (MD) simulations is the "geometric route", which considers the reversible physical separation of the bound complex in solution. Nonetheless, multiple challenges remain to render this type of methodology reliable and computationally efficient in practice. In particular, in one, formulation of the geometric route relies on the potential of mean force (PMF) for physically separating the two binding partners restrained along a straight axis, which must be selected prior to the calculation. However, practical applications indicate that the calculation of the separation PMF along the predefined rectilinear pathway may be suboptimal and slowly convergent. Recognizing that a rectilinear straight separation pathway is generally not representative of how the protein complex physically separates in solution, we put forth a novel theoretical framework for binding free-energy calculations, leaning on the optimal curvilinear minimum free-energy path (MFEP) determined from the string method. The proposed formalism is validated by comparing the results obtained using both rectilinear and curvilinear pathways for a prototypical host-guest complex formed by cucurbit[7]uril (CB[7]) binding benzene, and for the barnase-barstar protein complex. On the basis of multi-microsecond MD calculations, we find that the calculations following the traditional rectilinear pathway and the string-based curvilinear pathway agree quantitatively, but convergence is faster with the latter.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Expeditious modeling of vapor transport and reactions in polymeric materials

We present a methodology for approximating dynamic adsorption of vapor coupled with diffusion in polymeric materials. In previous publications, the dynamic adsorption was represented by ordinary differential equations (ODEs) and solved in concentration and parameter space. To accelerate the calculation, we have developed a statistical approximation method using computationally cheap surrogate models (e.g., algebraic polynomials) that replace the ODE solutions of adsorption and are coupled with the diffusion equations. Since the polynomial presentation of the adsorption term is obtained in a standard format prior to modeling coupled sorption‐diffusion, the adsorption operator can be expressed as input data in the transport code. Compared to conventional operator‐splitting methods, the polynomial approximation of adsorption offers better computational efficiency. The methodology is demonstrated and validated using a dynamic Langmuir adsorption model that is coupled to diffusion and absorption models and applied to a water vapor sorption‐diffusion process in polydimethylsiloxane polymers. © 2017 American Institute of Chemical Engineers AIChE J , 63: 4079–4089, 2017

Sun, Yunwei↗

SSME LOX post flow analyses/fluid structure interaction

Test firings of the Space Shuttle Main Engine (SSME) over the course of its development have resulted in several catastrophic failures. Some of these failures were due to breakage of the LOX posts that feed liquid oxygen into the main injector head of the engine. The objective was to perform a computational fluid flow analysis of a simplified SSME LOX post array using an existing viscous Navier-Stokes flow solver. A two-dimensional analysis was to be made. In addition, a finite element theory for treating the fluid/structure interaction between the posts and the hot gas environment was to be developed. The methodology used in computing the flow field through the LOX post array is described. Results are presented and discussed.

Source record↗

Comparison between Flownex and Corona thermal-hydraulic models for a single HTR prismatic fuel assembly - 18544

Computational tools and methodologies that can perform thermal-hydraulic analyses to reasonably predict the temperature distribution for the whole core of HTRs are useful for operational and safety analyses. In this paper, Flownex (a system code based on a one-dimensional thermal-fluid network methodology) and CORONA (Core Reliable Optimization and thermo-fluid Network Analysis) thermal-hydraulic models and results for a vertically stacked single fuel assembly will be compared. In Flownex, a basic unit cell containing part of the graphite and the associated fuel elements and coolant channels was developed. CORONA uses a basic unit cell concept for generating computational grids using several types of basic unit cells to model the heat transfer through the hexagonal blocks and a 1-D formulation to model the flow through the coolant channels. In CORONA, computational grids are generated using a combination of pre-generated mesh cells. The coolant channels and fuel rods are modelled explicitly. Flownex in contrast, models fuel and coolant channels implicitly by defining representative coolant channels, fuel rods and coated particle layers associated with each unit cell. Flownex can therefore model temperatures at coated particle level and also through each graphite block. The computational mesh employed by Flownex is much coarser than the mesh employed by CORONA. In both models, the helium gap between the fuel compact and the graphite block is modelled as stagnant. Flownex results were found to be of the same order of magnitude as those obtained using CORONA. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A Probabilistic Framework for the Validation and Certification of Computer Simulations

The paper presents a methodology for quantifying, propagating, and managing the uncertainty in the data required to initialize computer simulations of complex phenomena. The purpose of the methodology is to permit the quantitative assessment of a certification level to be associated with the predictions from the simulations, as well as the design of a data acquisition strategy to achieve a target level of certification. The value of a methodology that can address the above issues is obvious, specially in light of the trend in the availability of computational resources, as well as the trend in sensor technology. These two trends make it possible to probe physical phenomena both with physical sensors, as well as with complex models, at previously inconceivable levels. With these new abilities arises the need to develop the knowledge to integrate the information from sensors and computer simulations. This is achieved in the present work by tracing both activities back to a level of abstraction that highlights their commonalities, thus allowing them to be manipulated in a mathematically consistent fashion. In particular, the mathematical theory underlying computer simulations has long been associated with partial differential equations and functional analysis concepts such as Hilbert spares and orthogonal projections. By relying on a probabilistic framework for the modeling of data, a Hilbert space framework emerges that permits the modeling of coefficients in the governing equations as random variables, or equivalently, as elements in a Hilbert space. This permits the development of an approximation theory for probabilistic problems that parallels that of deterministic approximation theory. According to this formalism, the solution of the problem is identified by its projection on a basis in the Hilbert space of random variables, as opposed to more traditional techniques where the solution is approximated by its first or second-order statistics. The present representation, in addition to capturing significantly more information than the traditional approach, facilitates the linkage between different interacting stochastic systems as is typically observed in real-life situations.

Ghanem, Roger↗

Computational Materials Program for Alloy Design

The research program sponsored by this grant, "Computational Materials Program for Alloy Design", covers a period of time of enormous change in the emerging field of computational materials science. The computational materials program started with the development of the BFS method for alloys, a quantum approximate method for atomistic analysis of alloys specifically tailored to effectively deal with the current challenges in the area of atomistic modeling and to support modern experimental programs. During the grant period, the program benefited from steady growth which, as detailed below, far exceeds its original set of goals and objectives. Not surprisingly, by the end of this grant, the methodology and the computational materials program became an established force in the materials communitiy, with substantial impact in several areas. Major achievements during the duration of the grant include the completion of a Level 1 Milestone for the HITEMP program at NASA Glenn, consisting of the planning, development and organization of an international conference held at the Ohio Aerospace Institute in August of 2002, finalizing a period of rapid insertion of the methodology in the research community worlwide. The conference, attended by citizens of 17 countries representing various fields of the research community, resulted in a special issue of the leading journal in the area of applied surface science. Another element of the Level 1 Milestone was the presentation of the first version of the Alloy Design Workbench software package, currently known as "adwTools". This software package constitutes the first PC-based piece of software for atomistic simulations for both solid alloys and surfaces in the market.Dissemination of results and insertion in the materials community worldwide was a primary focus during this period. As a result, the P.I. was responsible for presenting 37 contributed talks, 19 invited talks, and publishing 71 articles in peer-reviewed journals, as detailed later in this Report.

Bozzolo, Guillermo↗

Improving Computational Efficiency of Prediction in Model-Based Prognostics Using the Unscented Transform

Model-based prognostics captures system knowledge in the form of physics-based models of components, and how they fail, in order to obtain accurate predictions of end of life (EOL). EOL is predicted based on the estimated current state distribution of a component and expected profiles of future usage. In general, this requires simulations of the component using the underlying models. In this paper, we develop a simulation-based prediction methodology that achieves computational efficiency by performing only the minimal number of simulations needed in order to accurately approximate the mean and variance of the complete EOL distribution. This is performed through the use of the unscented transform, which predicts the means and covariances of a distribution passed through a nonlinear transformation. In this case, the EOL simulation acts as that nonlinear transformation. In this paper, we review the unscented transform, and describe how this concept is applied to efficient EOL prediction. As a case study, we develop a physics-based model of a solenoid valve, and perform simulation experiments to demonstrate improved computational efficiency without sacrificing prediction accuracy.

Daigle, Matthew John↗

Multiparticle cumulant mapping for Coulomb explosion imaging: Calculations and algorithm

We present a versatile cumulant mapping algorithm for analyzing correlated particle emission, offering insights into complex electronic and nuclear dynamics. Recently, we have demonstrated the use of cumulant mapping to extract information-rich correlations between the momenta of multiple fragments produced in Coulomb explosion imaging experiments [C. Cheng et al., Phys. Rev. Lett. 130, 093001 (2023)]. We define cumulant mapping in terms of histograms, enabling fast computation of linear (additive) observables. However, applying the same algorithm to nonlinear (nonadditive) observables poses challenges, as the computation time of conventional estimators scales nonlinearly with data size. To overcome this, we develop estimators and an accompanying algorithm to enable computationally efficient estimation of the cumulant of interest. Comparisons of computation times and signal-to-noise ratios reveal the superior performance of our approach. This method is demonstrated on the (D+, D+, C+, O+) dissociation channel of CD 2 ⁢O 4+ produced in a strong-field ionization experiment. Additionally, Poisson statistics are used to simulate the two methods and provide insights into the efficiency of our algorithm. The proposed methodology unlocks efficient computation of cumulant mapping for a broader range of complex systems and observables, such as the laser pulse dependence of ionization dynamics.

74 ATOMIC AND MOLECULAR PHYSICS↗

Multiprogramming and the performance of parallel programs

A programming methodology is introduced that utilizes computational synchronization and avoids tight control flow synchronization in parallel programs. In this methodology, each phase of the computation is assigned a status that can be ready, blocked, or completed, and tasks in each computational phase are self-scheduled to ensure computational progress by the available executing processes. Results indicate that this methodology avoids the catastrophic performance losses resulting from the swapping of processes in multiprogrammed multiprocessors.

Benten, Muhammad S.↗

Semantic Annotation of Computational Components

This paper describes a methodology to specify machine-processable semantic descriptions of computational components to enable them to be shared and reused. A particular focus of this scheme is to enable automatic compositon of such components into simple work-flows.

Vanderbilt, Peter↗

Recommended DSMC Collision Model Parameters for Planetary Entry

Hybrid simulation frameworks combining Computational Fluid Dynamics (CFD) and Direct Simulation Monte Carlo (DSMC) are frequently employed to efficiently perform high-fidelity simulations of environments consisting of both continuum and rarified flow. DSMC is a stochastic, particle-based method which solves the fundamental Boltzmann equation and is therefore necessary for high-Knudsen flow where continuum-based assumptions governing CFD break down. However, the DSMC methodology is generally computationally inefficient to model the continuum regime. In a CFD/DSMC hybrid approach, obtaining an accurate, high-fidelity solution hinges on the consistent treatment of transport properties and the thermo-chemical models employed within the two solvers. In principle, in regions where CFD and DSMC are both employed, the same gas mixture under the same conditions should have the same properties, regardless of simulation type. Observed differences should be due to non-equilibrium processes, rather than differences in physical models. The goal of this work is to provide a comprehensive DSMC transport database encompassing the vast majority of known gas species encountered during Earth or other planetary atmospheric entry. This goal is largely possible due to recently performed ab initio quantum chemistry calculations. Combined with other high-fidelity data, the planned database will consist of collision integral data for over 200 neutral and ionized species and over 20000 binary collisions. From these collision integrals, Nelder-Mead optimization is used to compute collision-specific Variable Soft Sphere (VSS) collision model parameters, fitted from 300 K to 20000 K. Initial comparisons of transport properties of relevant equilibrium gas mixtures show great agreement between CFD and DSMC-derived results. The completed database can be readily applied to model binary collisions of any gas mixture containing the included species over the specified temperature range, making it a valuable tool for future planetary probe modeling efforts. An example is shown below in Fig. 1. Equilibrium mixture transport properties for a 35-species mixture composed originally of 10% air and 90% pyrolysis species of a carbon-phenolic ablator material [4] are computed using both fitted VSS Parameters and the original CFD collision integral values. Deviations in computed properties between the two approaches are less than 5% for the entire temperature range.

M. R. Gosma↗

Robust verification analysis

We introduce a new methodology for inferring the accuracy of computational simulations through the practice of solution verification. We demonstrate this methodology on examples from computational heat transfer, fluid dynamics and radiation transport. Our methodology is suited to both well- and ill-behaved sequences of simulations. Our approach to the analysis of these sequences of simulations incorporates expert judgment into the process directly via a flexible optimization framework, and the application of robust statistics. The expert judgment is systematically applied as constraints to the analysis, and together with the robust statistics guards against over-emphasis on anomalous analysis results. We have named our methodology Robust Verification. Our methodology is based on utilizing multiple constrained optimization problems to solve the verification model in a manner that varies the analysis' underlying assumptions. Constraints applied in the analysis can include expert judgment regarding convergence rates (bounds and expectations) as well as bounding values for physical quantities (e.g., positivity of energy or density). This approach then produces a number of error models, which are then analyzed through robust statistical techniques (median instead of mean statistics). This provides self-contained, data and expert informed error estimation including uncertainties for both the solution itself and order of convergence. Our method produces high quality results for the well-behaved cases relatively consistent with existing practice. The methodology can also produce reliable results for ill-behaved circumstances predicated on appropriate expert judgment. We demonstrate the method and compare the results with standard approaches used for both code and solution verification on well-behaved and ill-behaved simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A computer-assisted process for supersonic aircraft conceptual design

Design methodology was developed and existing major computer codes were selected to carry out the conceptual design of supersonic aircraft. A computer-assisted design process resulted from linking the codes together in a logical manner to implement the design methodology. The process does not perform the conceptual design of a supersonic aircraft but it does provide the designer with increased flexibility, especially in geometry generation and manipulation. Use of the computer-assisted process for the conceptual design of an advanced technology Mach 3.5 interceptor showed the principal benefit of the process to be the ability to use a computerized geometry generator and then directly convert the geometry between formats used in the geometry code and the aerodynamics codes. Results from the interceptor study showed that a Mach 3.5 standoff interceptor with a 1000 nautical-mile mission radius and a payload of eight Phoenix missiles appears to be feasible with the advanced technologies considered. A sensitivity study showed that technologies affecting the empty weight and propulsion system would be critical in the final configuration characteristics with aerodynamics having a lesser effect for small perturbations around the baseline.

Johnson, V. S.↗