Search NASA⌕ Search

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.

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

At least 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Numerical study of finite-rate supersonic combustion using parabolized equations

A set of partial differential equations, describing the two-dimensional supersonic chemically-reacting flow of the hydrogen-air system, is formulated such that the equations are parabolic in the streamwise direction. A fully-implicit fully-coupled finite-difference algorithm is used to develop a computer code which solves the governing equations by marching in the streamwise direction. The combustion process is modeled by a two-step finite-rate chemistry whereas turbulence is simulated by an algebraic turbulence model. Results of two calculations of internal supersonic reacting flow show fairly good agreement with the results obtained by the more costly full Navier-Stokes procedure.

Chitsomboon, T.↗
NASA NTRS1992

Software design as a problem in learning theory (a research overview)

Our interest in automating software design has come out of our research in automated reasoning, inductive inference, learnability, and algebraic machine theory. We have investigated these areas extensively, in connection with specific problems of language representation, acquisition, processing, and design. In the case of formal context-free (CF) languages we established existence of finite learnable models ('behavioral realizations') and procedures for constructing them effectively. We also determined techniques for automatic construction of the models, inductively inferring them from finite examples of how they should 'behave'. These results were obtainable due to appropriate representation of domain knowledge, and constraints on the domain that the representation defined. It was when we sought to generalize our results, and adapt or apply them, that we began investigating the possibility of determining similar procedures for constructing correct software. Discussions with other researchers led us to examine testing and verification processes, as they are related to inference, and due to their considerable importance in correct software design. Motivating papers by other researchers, led us to examine these processes in some depth. Here we present our approach to those software design issues raised by other researchers, within our own theoretical context. We describe our results, relative to those of the other researchers, and conclude that they do not compare unfavorably.

Fass, Leona F.↗
DOE OSTI2023

Fast truncated SVD of sparse and dense matrices on graphics processors

We investigate the solution of low-rank matrix approximation problems using the truncated singular value decomposition (SVD). For this purpose, we develop and optimize graphics processing unit (GPU) implementations for the randomized SVD and a blocked variant of the Lanczos approach. Our work takes advantage of the fact that the two methods are composed of very similar linear algebra building blocks, which can be assembled using numerical kernels from existing high-performance linear algebra libraries. Furthermore, the experiments with several sparse matrices arising in representative real-world applications and synthetic dense test matrices reveal a performance advantage of the block Lanczos algorithm when targeting the same approximation accuracy.

Computer Science↗
DOE OSTI2020

Accelerating Scientific Computing in the Post-Moore’s Era

Novel uses of graphical processing units for accelerated computation revolutionized the field of high-performance scientific computing by providing specialized workflows tailored to algorithmic requirements. As the era of Moore’s law draws to a close, many new non–von Neumann processors are emerging as potential computational accelerators, including those based on the principles of neuromorphic computing, tensor algebra, and quantum information. While development of these new processors is continuing to mature, the potential impact on accelerated computing is anticipated to be profound. We discuss how different processing models can advance computing in key scientific paradigms: machine learning and constraint satisfaction. Significantly, each of these new processor types utilizes a fundamentally different model of computation, and this raises questions about how to best use such processors in the design and implementation of applications. While many processors are being developed with a specific domain target, the ubiquity of spin-glass models and neural networks provides an avenue for multi-functional applications. Furthermore, this also hints at the infrastructure needed to integrate next-generation processing units into future high-performance computing systems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1989

Image understanding and the man-machine interface II; Proceedings of the Meeting, Los Angeles, CA, Jan. 17, 18, 1989

Image understanding concepts and models, image understanding systems and applications, advanced digital processors and software tools, and advanced man-machine interfaces are among the topics discussed. Particular papers are presented on such topics as neural networks for computer vision, object-based segmentation and color recognition in multispectral images, the application of image algebra to image measurement and feature extraction, and the integration of modeling and graphics to create an infrared signal processing test bed.

Barrett, Eamon B.↗
NASA NTRS1945

Numerical Evaluation by Harmonic Analysis of the (Epsilon)-Function of the Theodorsen Arbitrary-Airfoil Potential Theory

Finite trigonometric series is fitted by harmonic analysis as an approximation function to the psi function of the Theodorsen arbitrary-airfoil potential theory. By harmonic synthesis, the corresponding conjugate trigonometric series is used as an approximation to the epsilon function. A set of coefficients of particularly simple form is obtained algebraically for direct calculation of the epsilon values from the corresponding set of psi values. Complete derivation of this process is presented.

Naiman, Irven↗
DOE OSTI2025

Scalable multilevel Monte Carlo methods exploiting parallel redistribution on coarse levels

Here, we study an element agglomeration coarsening strategy that requires data redistribution at coarse levels when the number of coarse elements becomes smaller than the number of MPI processes used on the finest level. The overall procedure generates coarse elements (general unstructured unions of fine grid elements) within the framework of element-based algebraic multigrid methods (or AMGe) studied previously. The AMGe-generated coarse spaces have the ability to exhibit approximation properties of the same order as the fine-level spaces since by construction they contain the piecewise polynomials of the same order as on the fine level. These approximation properties are key for the successful use of AMGe in multilevel solvers for nonlinear partial differential equations as well as for multilevel Monte Carlo (MLMC) simulations. The ability to coarsen without being constrained by the number of MPI processes, as described in the present paper, allows to improve the scalability of these solvers as well as the overall MLMC method. The paper illustrates this latter fact with detailed scalability study of MLMC simulations applied to model Darcy equations with a stochastic log-normal permeability field.

AMGe↗
DOE OSTI2022

Two-Stage Gauss-Seidel Preconditioners and Smoothers for Krylov Solvers on a GPU Cluster: Preprint

Gauss-Seidel (GS) relaxation is often employed as a preconditioner for a Krylov solver or as a smoother for Algebraic Multigrid (AMG). However, the requisite sparse triangular solve is difficult to parallelize on many-core architectures such as graphics processing units (GPUs). In the present study, the performance of the sequential GS relaxation based on a triangular solve is compared with two-stage variants, replacing the direct triangular solve with a fixed number of inner Jacobi-Richardson (JR) iterations. When a small number of inner iterations is sufficient to maintain the Krylov convergence rate, the two-stage GS (GS2) often outperforms the sequential algorithm on many-core architectures. The GS2 algorithm is also compared with JR. When they perform the same number of ops for SpMV (e.g. three JR sweeps compared to two GS sweeps with one inner JR sweep), the GS2 iterations, and the Krylov solver preconditioned with GS2, may converge faster than the JR iterations. Moreover, for some problems (e.g. elasticity), it was found that JR may diverge with a damping factor of one, whereas two-stage GS may improve the convergence with more inner iterations. Finally, to study the performance of the two-stage smoother and preconditioner for a practical problem, these were applied to incompressible uid ow simulations on GPUs.

algebraic multigrid↗
DOE OSTI2021

Communication-Avoiding and Memory-Constrained Sparse Matrix-Matrix Multiplication at Extreme Scale

Sparse matrix-matrix multiplication (SpGEMM) is a widely used kernel in various graph, scientific computing and machine learning algorithms. In this paper, we consider SpGEMMs performed on hundreds of thousands of processors generating trillions of nonzeros in the output matrix. Distributed SpGEMM at this extreme scale faces two key challenges: (1) high communication cost and (2) inadequate memory to generate the output. Furthermore, we address these challenges with an integrated communication-avoiding and memory-constrained SpGEMM algorithm that scales to 262,144 cores (more than 1 million hardware threads) and can multiply sparse matrices of any size as long as inputs and a fraction of output fit in the aggregated memory. As we go from 16,384 cores to 262,144 cores on a Cray XC40 supercomputer, the new SpGEMM algorithm runs 10x faster when multiplying large-scale protein-similarity matrices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Granular Temperature Modeling with Large-Scale CFD-DEM Data

The granular temperature is a measure of solids-phase fluctuating kinetic energy in particle-laden gas-solid flows. This report focuses on reduced-order models of granular temperature in triply-periodic cluster induced turbulent flow. The granular temperature data was generated by post-processing large-scale CFD-DEM simulations that were carried out as part of an ALCC awarded study. The algebraic model of Tang et al, originally fit to DNS data, was found to be amenable to the present data. The results of several regression analyses are presented building on the original expression. This work was performed in part through the National Nuclear Security Administration (NNSA) Minority Serving Institutions Internship Program (MSIIP).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1991

Application of a Reynolds Stress turbulence model to a supersonic hydrogen-air diffusion flame

A second-order differential Reynolds Stress turbulence model has been applied to the Favre-averaged Navier-Stokes equations for the study of supersonic flows undergoing hydrogen-air chemical reactions. An assumed Beta Probability Density Function is applied to account for the chemical source terms in the conservation equations. An algebraic Reynolds Flux model is used for the fluctuating density-velocity as well as the species mass fraction-velocity correlations. The variances of temperature and species fluctuations are also modelled using an algebraic flux technique. A seven-species, seven-reaction finite rate chemistry mechanism is used to simulate the combustion processes. The resulting formulation is validated by comparison with experimental data on reacting supersonic axisymmetric jets. Results obtained for specific conditions indicate that the effect of chemical reaction on the turbulence is significant.

Chandrasekhar, R.↗
NASA NTRS2005

Geometric analysis of Arabidopsis root apex reveals a new aspect of the ethylene signal transduction pathway in development

Structurally, ethylene is the simplest phytohormone and regulates multiple aspects of plant growth and development. Its effects are mediated by a signal transduction cascade involving receptors, MAP kinases and transcription factors. Many morphological effects of ethylene in plant development, including root size, have been previously described. In this article a combined geometric and algebraic approach has been used to analyse the shape and the curvature in the root apex of Arabidopsis seedlings. The process requires the fitting of Bezier curves that reproduce the root apex shape, and the calculation of the corresponding curvatures. The application of the method has allowed us to identify significant differences in the root curvatures of ethylene insensitive mutants (ein2-1 and etr1-1) with respect to the wild-type Columbia.

Arabidopsis/genetics/growth & development↗
NASA NTRS1988

Optical matrix-vector processing for computational fluid dynamics

An optical processor to solve partial differential equations for computational fluid dynamics applications is considered. This application is new and original for optical processors. The algorithms that are used are optical realizations of the Newton-Raphson method for nonlinear equations and a new optical LU direct decomposition and Gauss-Seidel iterative solution to the resultant linear algebraic equations. These algorithms are used to solve Burger's equation (a specific form of the momentum equation in fluid dynamics). The nonlinear equations provide 1-D velocity data at each time step. Simulation results of optical processing with these algorithms on computational fluid dynamics data is included.

Perlee, Caroline J.↗
NASA NTRS1985

Mesh-connected processor arrays for the transitive closure problem

The main purpose in this paper is to lay a theoretical foundation for the design of mesh-connected processor arrays for the transitive closure problem. Using a simple path-algebraic formulation of the problem and observing its similarity to certain well-known smoothing problems that occur in digital signal processing, it is shown how to draw upon existing techniques from the signal processing literature to derive regular iterative algorithms for determining the transitive closure of the graph. The regular iterative algorithms that are derived using these considerations, are then analyzed and synthesized on mesh-connected processor arrays. Among the vast number of mesh-connected processor arrays that can be designed using this unified approach, the systolic arrays reported in the literature for this problem are shown to be special cases.

Rao, S. K.↗
NASA NTRS1989

Stable Kalman filters for processing clock measurement data

Kalman filters have been used for some time to process clock measurement data. Due to instabilities in the standard Kalman filter algorithms, the results have been unreliable and difficult to obtain. During the past several years, stable forms of the Kalman filter have been developed, implemented, and used in many diverse applications. These algorithms, while algebraically equivalent to the standard Kalman filter, exhibit excellent numerical properties. Two of these stable algorithms, the Upper triangular-Diagonal (UD) filter and the Square Root Information Filter (SRIF), have been implemented to replace the standard Kalman filter used to process data from the Deep Space Network (DSN) hydrogen maser clocks. The data are time offsets between the clocks in the DSN, the timescale at the National Institute of Standards and Technology (NIST), and two geographically intermediate clocks. The measurements are made by using the GPS navigation satellites in mutual view between clocks. The filter programs allow the user to easily modify the clock models, the GPS satellite dependent biases, and the random noise levels in order to compare different modeling assumptions. The results of this study show the usefulness of such software for processing clock data. The UD filter is indeed a stable, efficient, and flexible method for obtaining optimal estimates of clock offsets, offset rates, and drift rates. A brief overview of the UD filter is also given.

Clements, P. A.↗
NASA NTRS1994

Differential rotation and turbulent convection: A new Reynolds stress model and comparison with solar data

In most hydrodynamic cases, the existence of a turbulent flow superimposed on a mean flow is caused by a shear instability in the latter. Boussinesq suggested the first model for the turbulent Reynolds stresses bar-(u(sub i)u(sub j)) in which the mean shear S(sub ij) is the cause (or source) of turbulence represented by the stress bar-(u(sub i)u(sub j)). In the case of solar differential rotation, exactly the reverse physical process occurs: turbulence (which must pre-exist) generates a mean flow which manifests itself in the form of differential rotation. Thus, the Boussinesq model is wholly inadequate because in the solar case, cause and effect are reversed. Since the Boussinesq model is inadequate, one needs an alternative model for the Reynolds stresses. We present a new dynamical model for the Reynolds stresses, convective fluxes, turbulent kinetic energy, and temperature fluctuations. The complete model requires the solution of 11 differential equations. We then introduce a set of simplifying assumptions which reduce the full dynamical model to a set of algebraic Reynolds stress models. We explicitly solve one of these models that entails only one differential equation. The overall agreement with the data is obtained with a model that is neither phenomenological nor one that requires a full numerical simulation, since it is algebraic in nature. The new model can play an important role in understanding the complex physics underlying the interplay between solar differential rotation and convection, as many physical processes can naturally be incorporated into the model.

Canuto, V. M.↗
DOE OSTI2022

Kinetics-Informed Neural Networks

Chemical kinetics and reaction engineering consists of the phenomenological framework for the disentanglement of reaction mechanisms, optimization of reaction performance and the rational design of chemical processes. Here, we utilize feed-forward artificial neural networks as basis functions to solve ordinary differential equations (ODEs) constrained by differential algebraic equations (DAEs) that describe microkinetic models (MKMs). We present an algebraic framework for the mathematical description and classification of reaction networks, types of elementary reaction, and chemical species. Under this framework, we demonstrate that the simultaneous training of neural nets and kinetic model parameters in a regularized multi-objective optimization setting leads to the solution of the inverse problem through the estimation of kinetic parameters from synthetic experimental data. We analyze a set of scenarios to establish the extent to which kinetic parameters can be retrieved from transient kinetic data, and assess the robustness of the methodology with respect to statistical noise. Furthermore, this approach to inverse kinetic ODEs can assist in the elucidation of reaction mechanisms based on transient data.

36 MATERIALS SCIENCE↗