SEARCH · Search NASA

Results for “process algebras”

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 199 records · Page 11

All sources NASA NTRS DOE OSTI

NASA NTRS1976

Heat transfer to a full-coverage film-cooled surface with 30 degree slant-hole injection

Heat transfer behavior was studied in a turbulent boundary layer with full coverage film cooling through an array of discrete holes and with injection 30 deg to the wall surface in the downstream direction. Stanton numbers were measured for a staggered hole pattern with pitch-to-diameter ratios of 5 and 10, an injection mass flux ratio range of 0.1 to 1.3, and a range of Reynolds number Re sub x of 150,000 to 5 million. Air was used as the working fluid, and the mainstream velocity varied from 9.8 to 34.2 m/sec (32 to 112 ft/sec). The data were taken for secondary injection temperature equal to the wall temperature and also equal to the mainstream temperature. The data may be used to obtain Stanton number as a continuous function of the injectant temperature by use of linear superposition theory. The heat transfer coefficient is defined on the basis of a mainstream-to-wall temperature difference. This definition permits direct comparison of performance between film cooling and transpiration cooling. A differential prediction method was developed to predict the film cooling data base. The method utilizes a two-dimensional boundary layer program with routines to model the injection process and turbulence augmentation. The program marches in the streamwise direction, and when a row of holes is encountered, it stops and injects fluid into the boundary layer. The turbulence level is modeled by algebraically augmenting the mixing length, with the augmentation keyed to a penetration distance for the injected fluid.

Crawford, M. E.↗

NASA NTRS1992

A Regression Method for Comparing Launch Zone Ranges Derived From Different Sources

In modern fighter aircraft air-to-air missile launch acceptable ranges (LARs) are provided to the pilot for his launch decision. These LARs are calculated in the avionic software, using very simple algebraic equations and algorithms, that attempt to model complex missile behavior. Frequently these algorithms are revised to reflect inaccuracies discovered, when comparisons are made with missile six degree-of-freedom (6-DOF) simulations. The process of modifying this software has become expensive. In the past, these simple LAR generators were modified based only on subjective judgmental approach, with little regard to the missile range design limits. With reduced budgets a more rational methodology should be taken to assess whether or not simple fighter LAR generators need to be modified. Any LAR generator can produce large amounts of range (minimum and maximum) data over the board engagement limits of modem fighter and air-to-air missiles. This infinite population lends itself to some statistical methodology to access simple LAR accuracy and the need for software modification. The methodology should produce statistical parameters for use in the decision making process of modifying a simple fighter LAR generator. This paper presents a regression method, based on a missile range design limit philosophy. Acceptance criteria from the regression method are given that provide simple statistical parameters to aid in this decision making process.

Flight Testing↗

DOE OSTI2020

Optimization-based, property-preserving finite element methods for scalar advection equations and their connection to Algebraic Flux Correction

In this paper, we continue our efforts to exploit optimization and control ideas as a common foundation for the development of property-preserving numerical methods. Here we focus on a class of scalar advection equations whose solutions have fixed mass in a given Eulerian region and constant bounds in any Lagrangian volume. Our approach separates discretization of the equations from the preservation of their solution properties by treating the latter as optimization constraints. This relieves the discretization process from having to comply with additional restrictions and makes stability and accuracy the sole considerations in its design. A property-preserving solution is then sought as a state that minimizes the distance to an optimally accurate but not property-preserving target solution computed by the scheme, subject to constraints enforcing discrete proxies of the desired properties. Furthermore, we consider two such formulations in which the optimization variables are given by the nodal solution values and suitably defined nodal fluxes, respectively. A key result of the paper reveals that a standard Algebraic Flux Correction (AFC) scheme is a modified version of the second formulation obtained by shrinking its feasible set to a hypercube. In conclusion, we present numerical studies illustrating the optimization-based formulations and comparing them with AFC

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Reducing communication in algebraic multigrid with multi-step node aware communication

Algebraic multigrid (AMG) is often viewed as a scalable [Formula: see text] solver for sparse linear systems. Yet, AMG lacks parallel scalability due to increasingly large costs associated with communication, both in the initial construction of a multigrid hierarchy and in the iterative solve phase. This work introduces a parallel implementation of AMG that reduces the cost of communication, yielding improved parallel scalability. It is common in Message Passing Interface (MPI), particularly in the MPI-everywhere approach, to arrange inter-process communication, so that communication is transported regardless of the location of the send and receive processes. Performance tests show notable differences in the cost of intra- and internode communication, motivating a restructuring of communication. In this case, the communication schedule takes advantage of the less costly intra-node communication, reducing both the number and the size of internode messages. Node-centric communication extends to the range of components in both the setup and solve phase of AMG, yielding an increase in the weak and strong scaling of the entire method.

Computer Science↗

DOE OSTI2024

Unifying thermochemistry concepts in computational heterogeneous catalysis

Thermophysical properties of adsorbates and gas-phase species define the free energy landscape of heterogeneously catalyzed processes and are pivotal for an atomistic understanding of the catalyst performance. These thermophysical properties, such as the free energy or the enthalpy, are typically derived from density functional theory (DFT) calculations. Enthalpies are species-interdependent properties that are only meaningful when referenced to other species. The widespread use of DFT has led to a proliferation of new energetic data in the literature and databases. However, there is a lack of consistency in how DFT data is referenced and how the associated enthalpies or free energies are stored and reported, leading to challenges in reproducing or utilizing the results of prior work. Additionally, DFT suffers from exchange–correlation errors that often require corrections to align the data with other global thermochemical networks, which are not always clearly documented or explained. In this review, we introduce a set of consistent terminology and definitions, review existing approaches, and unify the techniques using the framework of linear algebra. This set of terminology and tools facilitates the correction and alignment of energies between different data formats and sources, promoting the sharing and reuse of ab initio data. Standardization of thermochemistry concepts in computational heterogeneous catalysis reduces computational cost and enhances fundamental understanding of catalytic processes, which will accelerate the computational design of optimally performing catalysts.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2021

Non-intrusive data-driven model reduction for differential–algebraic equations derived from lifting transformations

In this paper we present a non-intrusive data-driven approach for model reduction of nonlinear systems. The approach considers the particular case of nonlinear partial differential equations (PDEs) that form systems of partial differential–algebraic equations (PDAEs) when lifted to polynomial form. Such systems arise, for example, when the governing equations include Arrhenius reaction terms (e.g., in reacting flow models) and thermodynamic terms (e.g., the Helmholtz free energy terms in a phase-field solidification model). Using the known structured form of the lifted algebraic equations, the approach computes the reduced operators for the algebraic equations explicitly, using straightforward linear algebra operations on the basis matrices. The reduced operators for the differential equations are inferred from lifted snapshot data using operator inference, which solves a linear least squares regression problem. The approach is illustrated for the nonlinear model of solidification of a pure material. The lifting transformations reformulate the solidification PDEs as a system of PDAEs that have cubic structure. The operators of the lifted system for this solidification example have affine dependence on key process parameters, permitting us to learn a parametric reduced model with operator inference. Numerical experiments show the effectiveness of the resulting reduced models in capturing key aspects of the solidification dynamics.

42 ENGINEERING↗

DOE OSTI2025

A Simple, Scalable Large Deformation Solid Mechanics Implementation in the MOOSE Framework

This article describes a large deformation solid mechanics solver implemented as part of the freely available and open source MOOSE finite element simulation framework. The article documents the choices made in developing the solid mechanics framework and describes novel formulations for the gradient operator and constitutive modeling framework made to simplify implementations of different coordinate systems, stabilized gradient operators, and different constitutive model inputs and outputs. In the process, the article describes a new formulation that casts objective integration of the Cauchy stress as a linear transformation of the small stress rate. Finally, the article presents key implementation details and examines the parallel efficiency of the solid mechanics solver implemented in MOOSE. The implementation retains a good weak scaling efficiency beyond 1,000 parallel processes. The article includes a discussion of the factors limiting the parallel efficiency of implicit, large deformation solid mechanics codes on current high-performance computers, with the main current limitation being the scalability of the algebraic multigrid methods used to solve the linearized equilibrium equations.

Applied computing → Computer-aided design↗

NASA NTRS2007

Transient Numerical Modeling of Catalytic Channels

This paper presents a transient model of catalytic combustion suitable for isolated channels and monolith reactors. The model is a lumped two-phase (gas and solid) model where the gas phase is quasi-steady relative to the transient solid. Axial diffusion is neglected in the gas phase; lateral diffusion, however, is accounted for using transfer coefficients. The solid phase includes axial heat conduction and external heat loss due to convection and radiation. The combustion process utilizes detailed gas and surface reaction models. The gas-phase model becomes a system of stiff ordinary differential equations while the solid phase reduces, after discretization, into a system of stiff ordinary differential-algebraic equations. The time evolution of the system came from alternating integrations of the quasi-steady gas and transient solid. This work outlines the numerical model and presents some sensitivity studies on important parameters including internal transfer coefficients, catalytic surface site density, and external heat-loss (if applicable). The model is compared to two experiments using CO fuel: (1) steady-state conversion through an isothermal platinum (Pt) tube and (2) transient propagation of a catalytic reaction inside a small Pt tube. The model requires internal mass-transfer resistance to match the experiments at lower residence times. Under mass-transport limited conditions, the model reasonably predicted exit conversion using global mass-transfer coefficients. Near light-off, the model results did not match the experiment precisely even after adjustment of mass-transfer coefficients. Agreement improved for the first case after adjusting the surface kinetics such that the net rate of CO adsorption increased compared to O2. The CO / O2 surface mechanism came from a sub-set of reactions in a popular CH4 / O2 mechanism. For the second case, predictions improved for lean conditions with increased external heat loss or adjustment of the kinetics as in the first case. Finally, the results show that different initial surface-species distribution leads to different steady-states under certain conditions. These results demonstrate the utility of a lumped two-phase model of a transient catalytic combustor with detailed chemistry.

Struk, Peter M.↗

DOE OSTI2021

Abridged spectral matrix inversion: parametric fitting of X-ray fluorescence spectra following integrative data reduction

Recent improvements in both X-ray detectors and readout speeds have led to a substantial increase in the volume of X-ray fluorescence data being produced at synchrotron facilities. This in turn results in increased challenges associated with processing and fitting such data, both temporally and computationally. Herein an abridging approach is described that both reduces and partially integrates X-ray fluorescence (XRF) data sets to obtain a fivefold total improvement in processing time with negligible decrease in quality of fitting. The approach is demonstrated using linear least-squares matrix inversion on XRF data with strongly overlapping fluorescent peaks. This approach is applicable to any type of linear algebra based fitting algorithm to fit spectra containing overlapping signals wherein the spectra also contain unimportant (non-characteristic) regions which add little (or no) weight to fitted values, e.g. energy regions in XRF spectra that contain little or no peak information.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2022

GSoFa: Scalable Sparse Symbolic LU Factorization on GPUs

Decomposing a matrix $\mathbf {A}$ into a lower matrix $\mathbf {L}$ and an upper matrix $\mathbf {U}$, which is also known as LU decomposition, is an essential operation in numerical linear algebra. For a sparse matrix, LU decomposition often introduces more nonzero entries in the $\mathbf {L}$ and $\mathbf {U}$ factors than in the original matrix. A symbolic factorization step is needed to identify the nonzero structures of $\mathbf {L}$ and $\mathbf {U}$ matrices. Attracted by the enormous potentials of the Graphics Processing Units (GPUs), an array of efforts have surged to deploy various LU factorization steps except for the symbolic factorization, to the best of our knowledge, on GPUs. This article introduces gSoFa, the first GPU-based symbolic factorization design with the following three optimizations to enable scalable LU symbolic factorization for nonsymmetric pattern sparse matrices on GPUs. First, here we introduce a novel fine-grained parallel symbolic factorization algorithm that is well suited for the Single Instruction Multiple Thread (SIMT) architecture of GPUs. Second, we tailor supernode detection into a SIMT friendly process and strive to balance the workload, minimize the communication and saturate the GPU computing resources during supernode detection. Third, we introduce a three-pronged optimization to reduce the excessive space consumption problem faced by multi-source concurrent symbolic factorization. Taken together, gSoFa achieves up to 31× speedup from 1 to 44 Summit nodes (6 to 264 GPUs) and outperforms the state-of-the-art CPU project, on average, by 5×. Notably, gSoFa also achieves up to 47 percent of the peak memory throughput of a V100 GPU in the Summit Supercomputer.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Landau Singularities Revisited: Computational Algebraic Geometry for Feynman Integrals

We reformulate the analysis of singularities of Feynman integrals in a way that can be practically applied to perturbative computations in the standard model in dimensional regularization. After highlighting issues in the textbook treatment of Landau singularities, we develop an algorithm for classifying and computing them using techniques from computational algebraic geometry. We introduce an algebraic variety called the principal Landau determinant, which captures the singularities even in the presence of massless particles or UV/IR divergences. We illustrate this for 114 example diagrams, including a cutting-edge 2-loop 5-point nonplanar QCD process with multiple mass scales. Published by the American Physical Society 2024

Physics↗

NASA NTRSDate not supplied

Expedited Model Building Method for Rocket Nozzle Side Loading

Statistical analysis of test data is currently the preferred method of creating models for uncharacterized side loading in rocket nozzles. However, statistical analysis requires multiple data sets to be reliable; getting these sets requires building and testing multiple rocket motors, which is not feasible given the incredible time and cost required to do so. By using a combination of geometry, simplified finite element analysis (FEA) analogs, and algebra we can create a limited predictive model from only one test data set. Once created, the model requires only the input from one strain gauge located at each yaw and pitch attachment bracket for the actuation system. This process is not computationally intensive, therefore saving an abundance of time and budget over using full 3D FEA models to develop a similar predictive model. To develop the model, conversion factors between the strain at the gauge locations and corresponding actuator load is derived from the data. These conversion factors are used to create a “conversion ellipse” that bounds the constitutive properties of the nozzle as one lumped factor. Using a 2D cross-sectional analog of the nozzle exit plane, we create a function that allows us to determine the azimuthal location of the unexpected load based on the ratio between yaw and pitch strain readings. Combining this with the “conversion ellipse” yields a function that given the strain reading outputs an induced actuator load, regardless of the azimuthal location of the unexpected load. As previously mentioned, this predictive model is limited in its application as there is inaccuracy introduced by the use of data by only one test as well as simplifying assumptions. This approach makes a useful tool to quickly determine whether uncharacterized actuator loading events can damage actuation systems or induce loading that exceeds design limits.

Seetha A Kolli↗

DOE OSTI2021

Reduced scaling formulation of CASPT2 analytical gradients using the supporting subspace method

We present a reduced scaling and exact reformulation of state specific complete active space second-order perturbation (CASPT2) analytical gradients in terms of the MP2 and Fock derivatives using the supporting subspace method. This work follows naturally from the supporting subspace formulation of the CASPT2 energy in terms of the MP2 energy using dressed orbitals and Fock builds. For a given active space configuration, the terms corresponding to the MP2-gradient can be evaluated with O(N5) operations, while the rest of the calculations can be computed with O(N3) operations using Fock builds, Fock gradients, and linear algebra. When tensor-hyper-contraction is applied simultaneously, the computational cost can be further reduced to O(N4) for a fixed active space size. The new formulation enables efficient implementation of CASPT2 analytical gradients by leveraging the existing graphical processing unit (GPU)-based MP2 and Fock routines. We present benchmark results that demonstrate the accuracy and performance of the new method. Example applications of the new method in ab initio molecular dynamics simulation and constrained geometry optimization are given.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2023

TAMM: Tensor algebra for many-body methods

Tensor algebra operations such as contractions in computational chemistry consume a significant fraction of the computing time on large-scale computing platforms. The widespread use of tensor contractions between large multi-dimensional tensors in describing electronic structure theory has motivated the development of multiple tensor algebra frameworks targeting heterogeneous computing platforms. In this paper, we present Tensor Algebra for Many-body Methods (TAMM), a framework for productive and performance-portable development of scalable computational chemistry methods. TAMM decouples the specification of the computation from the execution of these operations on available high-performance computing systems. With this design choice, the scientific application developers (domain scientists) can focus on the algorithmic requirements using the tensor algebra interface provided by TAMM, whereas high-performance computing developers can direct their attention to various optimizations on the underlying constructs, such as efficient data distribution, optimized scheduling algorithms, and efficient use of intra-node resources (e.g., graphics processing units). The modular structure of TAMM allows it to support different hardware architectures and incorporate new algorithmic advances. We describe the TAMM framework and our approach to the sustainable development of scalable ground- and excited-state electronic structure methods. We present case studies highlighting the ease of use, including the performance and productivity gains compared to other frameworks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2023

Finite-temperature many-body perturbation theory for anharmonic vibrations: Recursions, algebraic reduction, second-quantized reduction, diagrammatic rules, linked-diagram theorem, finite-temperature self-consistent field, and general-order algorithm

A unified theory is presented for finite-temperature many-body perturbation expansions of the anharmonic vibrational contributions to thermodynamic functions, i.e., the free energy, internal energy, and entropy. The theory is diagrammatically size-consistent at any order, as ensured by the linked-diagram theorem proved in this study, and, thus, applicable to molecular gases and solids on an equal footing. It is also a basis-set-free formalism, just like its underlying Bose–Einstein theory, capable of summing anharmonic effects over an infinite number of states analytically. It is formulated by the Rayleigh–Schrödinger-style recursions, generating sum-over-states formulas for the perturbation series, which unambiguously converges at the finite-temperature vibrational full-configuration-interaction limits. Two strategies are introduced to reduce these sum-over-states formulas into compact sum-over-modes analytical formulas. One is a purely algebraic method that factorizes each many-mode thermal average into a product of one-mode thermal averages, which are then evaluated by the thermal Born–Huang rules. Canonical forms of these rules are proposed, dramatically expediting the reduction process. The other is finite-temperature normal-ordered second quantization, which is fully developed in this study, including a proof of thermal Wick’s theorem and the derivation of a normal-ordered vibrational Hamiltonian at finite temperature. The latter naturally defines a finite-temperature extension of size-extensive vibrational self-consistent field theory. These reduced formulas can be represented graphically as Feynman diagrams with resolvent lines, which include anomalous and renormalization diagrams. Two order-by-order and one general-order algorithms of computing these perturbation corrections are implemented and applied up to the eighth order. The results show no signs of Kohn–Luttinger-type nonconvergence.

74 ATOMIC AND MOLECULAR PHYSICS↗

NASA NTRS1987

Navier Stokes solution of the flowfield over ice accretion shapes

The numerical simulation of flow about ice accretion shapes has been accomplished by solving the Navier-Stokes equations using MacCormack's explicit finite difference scheme. The computations were performed on a CRAY-XMP computer. The influence of turbulence is taken into account by means of an algebraic eddy-viscosity model. In order to optimize the grid spacing and to achieve near orthogonality at the surface of the complex ice shapes, a hyperbolic grid generation scheme is utilized. Particular attention is given to the heat transfer process for which good agreement between the numerical and experimental results is achieved. In addition, liquid water droplet trajectories are coupled within the flowfield along with the resulting collection efficiencies using a parabolized Navier-Stokes formulation.

Scott, J. N.↗

DOE OSTI2023

Attentional Ptycho-Tomography (APT) for three-dimensional nanoscale X-ray imaging with minimal data acquisition and computation time

Abstract Noninvasive X-ray imaging of nanoscale three-dimensional objects, such as integrated circuits (ICs), generally requires two types of scanning: ptychographic, which is translational and returns estimates of the complex electromagnetic field through the IC; combined with a tomographic scan, which collects these complex field projections from multiple angles. Here, we present Attentional Ptycho-Tomography (APT), an approach to drastically reduce the amount of angular scanning, and thus the total acquisition time. APT is machine learning-based, utilizing axial self-Attention for Ptycho-Tomographic reconstruction. APT is trained to obtain accurate reconstructions of the ICs, despite the incompleteness of the measurements. The training process includes regularizing priors in the form of typical patterns found in IC interiors, and the physics of X-ray propagation through the IC. We show that APT with ×12 reduced angles achieves fidelity comparable to the gold standard Simultaneous Algebraic Reconstruction Technique (SART) with the original set of angles. When using the same set of reduced angles, then APT also outperforms Filtered Back Projection (FBP), Simultaneous Iterative Reconstruction Technique (SIRT) and SART. The time needed to compute the reconstruction is also reduced, because the trained neural network is a forward operation, unlike the iterative nature of these alternatives. Our experiments show that, without loss in quality, for a 4.48 × 93.2 × 3.92 µm 3 IC (≃6 × 10 8 voxels), APT reduces the total data acquisition and computation time from 67.96 h to 38 min. We expect our physics-assisted and attention-utilizing machine learning framework to be applicable to other branches of nanoscale imaging, including materials science and biological imaging.

47 OTHER INSTRUMENTATION↗

NASA NTRS1987

Application of Artificial Intelligence technology to the analysis and synthesis of reliable software systems

The development of a methodology for the production of highly reliable software is one of the greatest challenges facing the computer industry. Meeting this challenge will undoubtably involve the integration of many technologies. This paper describes the use of Artificial Intelligence technologies in the automated analysis of the formal algebraic specifications of abstract data types. These technologies include symbolic execution of specifications using techniques of automated deduction and machine learning through the use of examples. On-going research into the role of knowledge representation and problem solving in the process of developing software is also discussed.

Wild, Christian↗