Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematics & Computing”

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 1,531 records · Page 85

Spectral Mesh-Free Quadrature for Planar Regions Bounded by Rational Parametric Curves

This article presents spectral, mesh-free, Green’s theorem-based numerical quadrature schemes for integrating functions over planar regions bounded by rational parametric curves. Our algorithm proceeds in two steps: (1) We first find intermediate quadrature rules for line integrals along the region’s boundary curves corresponding to Green’s theorem. (2) We then use a high-order quadrature rule to compute the numerical antiderivative of the integrand along a coordinate axis, which is used to evaluate the Green’s theorem line integral. We present two methods to compute the intermediate quadrature rule. The first is spectrally accurate (it converges faster than any algebraic order with respect to number of quadrature points) and is relatively easy to implement, but has no guarantee of polynomial exactness. The second guarantees exactness for polynomial integrands up to a pre-specified degree with an a priori-known number of quadrature points and retains the convergence properties of the first, but is slightly more complicated. The quadrature schemes have applications to computation of geometric moments, immersogeometric analysis, conservative field transfer between high-order meshes, and initialization of multi-material simulations with rational geometry. We compare the quadrature schemes produced using our method to other methods in the literature and show that they are much more efficient both in terms of number of quadrature points and computational time. We provide an open-source implementation of the algorithm in MATLAB.

97 MATHEMATICS AND COMPUTING↗

A new approach for simulating inhomogeneous chemical kinetics

Abstract In this paper, inhomogeneous chemical kinetics are simulated by describing the concentrations of interacting chemical species by a linear expansion of basis functions in such a manner that the coupled reaction and diffusion processes are propagated through time efficiently by tailor-made numerical methods. The approach is illustrated through modelling $$\alpha$$ α - and $$\gamma$$ γ -radiolysis in thin layers of water and at their solid interfaces from the start of the chemical phase until equilibrium was established. The method’s efficiency is such that hundreds of such systems can be modelled in a few hours using a single core of a typical laptop, allowing the investigation of the effects of the underlying parameter space. Illustrative calculations showing the effects of changing dose-rate and water-layer thickness are presented. Other simulations are presented which show the approach’s capability to solve problems with spherical symmetry (an approximation to an isolated radiolytic spur), where the hollowing out of an initial Gaussian distribution is observed, in line with previous calculations. These illustrative simulations show the generality and the computational efficiency of this approach to solving reaction-diffusion problems. Furthermore, these example simulations illustrate the method’s suitability for simulating solid-fluid interfaces, which have received a lot of experimental attention in contrast to the lack of computational studies.

97 MATHEMATICS AND COMPUTING↗

Transforming Energy Through Computational Excellence: Artificial Intelligence and Machine Learning

The National Renewable Energy Laboratory's (NREL's) expertise accelerates a decarbonized energy economy through the most advanced computational techniques, including artificial intelligence (AI) and Machine Learning (ML). AI is the simulation of human intelligence processes by machines, while ML encompasses the study of computer algorithms to imitate the way humans learn.

97 MATHEMATICS AND COMPUTING↗

Modeling Fluid Flow in Domains Containing Moving Interfaces

Numerical simulations of fluid flow in domains containing moving rigid objects or boundaries are still challenging when meshes have to be adapted and periodically regenerated. A numerical strategy that falls into the general category of Arbitrary Lagrangian - Eulerian (ALE) methods is being developed. The method is based on a fixed mesh that is locally modified both in space and time to describe the moving interfaces which are allowed to move independently of the mesh. This results in a fully robust formulation capable of calculating in irregular meshes containing moving devises of complex geometry and free of mesh entanglement problems. The present work constitutes the first stage in the development of a three-dimensional model to interface with the new KIVA-hpFE simulator. The method’s accuracy has been assessed in two dimensions using a case that has an analytical solution.

02 PETROLEUM↗

Comparing Mitigations under Uncertainty in Simulated Influenza Outbreak [Slides]

Consequences of an influenza outbreak and effects of factors determining mitigation strategies were studied by computer simulation using statistical design and analysis of experiments methods. Twelve input variables that specify differing degrees of disease mitigation were selected to be evaluated within the context of nine uncertain inputs that characterize influenza expression, e. g., reproductive number, case mortality rate, duration of infective period. Variables were characterized with probability distributions based on assessments of low, high, and typical values from expert opinion and literature review. An approach to experiment design called dispersion array based experiment was developed that incorporates orthogonal array based Latin hypercube sampling. The simulation experiment consisted of 128 combinations of mitigation factors each evaluated over 16 distinct disease characterizations and allowed a quick assessment of simulation results, particularly mitigation efficacy. Sensitivity evaluation of the mitigation factors showed effectiveness against the range of influenza expressions with little stress on the health care system.

60 APPLIED LIFE SCIENCES↗

Physicochemical property distributions for accurate and rapid pairwise protein homology detection

Background: The challenge of remote homology detection is that many evolutionarily related sequences have very little similarity at the amino acid level. Kernel-based discriminative methods, such as support vector machines (SVMs), that use vector representations of sequences derived from sequence properties have been shown to have superior accuracy when compared to traditional approaches for the task of remote homology detection. Results: We introduce a new method for feature vector representation based on the physicochemical properties of the primary protein sequence. A distribution of physicochemical property scores are assembled from 4-mers of the sequence and normalized based on the null distribution of the property over all possible 4-mers. With this approach there is little computational cost associated with the transformation of the protein into feature space, and overall performance in terms of remote homology detection is comparable with current state-of-the-art methods. We demonstrate that the features can be used for the task of pairwise remote homology detection with improved accuracy versus sequence-based methods such as BLAST and other feature-based methods of similar computational cost. Conclusions: A protein feature method based on physicochemical properties is a viable approach for extracting features in a computationally inexpensive manner while retaining the sensitivity of SVM protein homology detection. Furthermore, identifying features that can be used for generic pairwise homology detection in lieu of family-based homology detection is important for applications such as large database searches and comparative genomics.

59 BASIC BIOLOGICAL SCIENCES↗

Hydrocode Development on the Ncube and the Connection Machine Hypercubes [Book Chapter]

Hydrocode simulations constitute an important tool at Sandia National Laboratories and elsewhere for analyzing complex two- and three-dimensional systems. However, current vector supercomputers do not provide a growth path to enable fast, routine, and cost-effective simulations of large problems. Future, massively-parallel computers will provide a solution. Sandia has already developed simplified versions of the production hydrocode CTH for the Connection Machine and the nCUBE massively-parallel supercomputers. The parallel versions solve problems in two-dimensional, multi-fluid, shock-wave physics. Code development strategy, coding methodology, visualization techniques and performance results for this work are described.

640410 -- Fluid Physics-- General Fluid Dynamics↗

Aerosol Plume Detection Algorithm Based on Image Segmentation of Scanning Atmospheric Lidar Data

An image-processing algorithm has been developed to identify aerosol plumes in scanning lidar backscatter data. The images in this case consist of lidar data in a polar coordinate system. Each full lidar scan is taken as a fixed image in time, and sequences of such scans are considered functions of time. The data are analyzed in both the original backscatter polar coordinate system and a lagged coordinate system. The lagged coordinate system is a scatterplot of two datasets, such as subregions taken from the same lidar scan (spatial delay), or two sequential scans in time (time delay). The lagged coordinate system processing allows for finding and classifying clusters of data. The classification step is important in determining which clusters are valid aerosol plumes and which are from artifacts such as noise, hard targets, or background fields. These cluster classification techniques have skill since both local and global properties are used. Furthermore, more information is available since both the original data and the lag data are used. Performance statistics are presented for a limited set of data processed by the algorithm, where results from the algorithm were compared to subjective truth data identified by a human.

97 MATHEMATICS AND COMPUTING↗

Estimating time since infection in early homogeneous HIV-1 samples using a poisson model

The occurrence of a genetic bottleneck in HIV sexual or mother-to-infant transmission has been well documented. This results in a majority of new infections being homogeneous, i.e., initiated by a single genetic strain. Early after infection, prior to the onset of the host immune response, the viral population grows exponentially. In this simple setting, an approach for estimating evolutionary and demographic parameters based on comparison of diversity measures is a feasible alternative to the existing Bayesian methods (e.g., BEAST), which are instead based on the simulation of genealogies. We have devised a web tool that analyzes genetic diversity in acutely infected HIV-1 patients by comparing it to a model of neutral growth. More specifically, we consider a homogeneous infection (i.e., initiated by a unique genetic strain) prior to the onset of host-induced selection, where we can assume a random accumulation of mutations. Previously, we have shown that such a model successfully describes about 80% of sexual HIV-1 transmissions provided the samples are drawn early enough in the infection. Violation of the model is an indicator of either heterogeneous infections or the initiation of selection. When the underlying assumptions of our model (homogeneous infection prior to selection and fast exponential growth) are met, we are under a very particular scenario for which we can use a forward approach (instead of backwards in time as provided by coalescent methods). This allows for more computationally efficient methods to derive the time since the most recent common ancestor. Furthermore, the tool performs statistical tests on the Hamming distance frequency distribution, and outputs summary statistics (mean of the best fitting Poisson distribution, goodness of fit p-value, etc). The tool runs within minutes and can readily accommodate the tens of thousands of sequences generated through new ultradeep pyrosequencing technologies. The tool is available on the LANL website.

59 BASIC BIOLOGICAL SCIENCES↗

The Mimetic Finite Element Method and the Virtual Element Method for elliptic problems with arbitrary regularity

We develop and analyze a new family of virtual element methods on unstructured polygonal meshes for the diffusion problem in primal form, that use arbitrarily regular discrete spaces V h $\subset$ C α } ϵ $\mathbb{N}$. The degrees of freedom are (a) solution and derivative values of various degree at suitable nodes and (b) solution moments inside polygons. The convergence of the method is proven theoretically and an optimal error estimate is derived. The connection with the Mimetic Finite Difference method is also discussed. Numerical experiments confirm the convergence rate that is expected from the theory.

97 MATHEMATICS AND COMPUTING↗

KIVA Development - 2012

Los Alamos National Laboratory and its collaborators are facilitating engine modeling by improving accuracy of the modeling, and improving the robustness of software. We also continue to improve the physical modeling methods. We are developing and implementing new mathematical algorithms, those which represent the physics within an engine. We provide software that others may use directly or that they may alter with various models e.g., sophisticated chemical kinetics, different turbulent closure methods or other fuel injection systems.

02 PETROLEUM↗

Deflagration Wave Profiles

Shock initiation in a plastic-bonded explosives (PBX) is due to hot spots. Current reactive burn models are based, at least heuristically, on the ignition and growth concept. The ignition phase occurs when a small localized region of high temperature (or hot spot) burns on a fast time scale. This is followed by a growth phase in which a reactive front spreads out from the hot spot. Propagating reactive fronts are deflagration waves. A key question is the deflagration speed in a PBX compressed and heated by a shock wave that generated the hot spot. Here, the ODEs for a steady deflagration wave profile in a compressible fluid are derived, along with the needed thermodynamic quantities of realistic equations of state corresponding to the reactants and products of a PBX. The properties of the wave profile equations are analyzed and an algorithm is derived for computing the deflagration speed. As an illustrative example, the algorithm is applied to compute the deflagration speed in shock compressed PBX 9501 as a function of shock pressure. The calculated deflagration speed, even at the CJ pressure, is low compared to the detonation speed. The implication of this are briefly discussed.

36 MATERIALS SCIENCE↗

Exascale Co-Design Center for Materials in Extreme Environments (ExMatEx) Annual Report — Year 2

All activities of the Exascale Co-design Center for Materials in Extreme Environments (ExMatEx) are focused on the two ultimate goals of the project: (1) demonstrating and delivering a prototype scale-bridging materials science application based upon adaptive physics refinement, and (2) identifying the requirements for the exascale ecosystem that are necessary to perform computational materials science simulations (both single- and multi-scale). During the first year of ExMatEx, our focus was on establishing how we do computational materials science, by developing an initial suite of flexible proxy applications. These “proxy apps” are the primary vehicle for the co-design process, involving assessments and tradeoff evaluations both within the ExMatEx team, and with the entire exascale ecosystem. These interactions have formed the basis of our second year activities. The set of artifacts from these co-design interactions are the lessons learned, that are used to re-express the applications and algorithms within the context of emerging architectures, programming models, and runtime systems.

36 MATERIALS SCIENCE↗

Bayesian sequential optimal experimental design for nonlinear models using policy gradient reinforcement learning

We present a mathematical framework and computational methods for optimally designing a finite sequence of experiments. This sequential optimal experimental design (sOED) problem is formulated as a finite-horizon partially observable Markov decision process (POMDP) under a Bayesian setting and with information-theoretic utilities. The formulation is general and may accommodate continuous random variables, non-Gaussian posteriors, and nonlinear forward models. The sOED design policy incorporates elements of feedback and lookahead simultaneously, and we show it to generalize the commonly-used batch and greedy design strategies. We solve for the sOED policy using the policy gradient (PG) method from reinforcement learning, and provide a derivation for the PG expression in the sOED context. Adopting an actor-critic approach, the policy and value functions are parameterized using deep neural networks and improved via PG estimates produced from simulated episodes of designs and observations. The new PG-sOED algorithm is first validated on a linear-Gaussian benchmark, and then compared against other design baselines on a sensor movement problem for contaminant source inversion in a convection-diffusion field. As a result, we provide explanation for the policy behaviors using knowledge of the underlying physical process.

97 MATHEMATICS AND COMPUTING↗

DAKOTA : a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis. Version 5.0, user's reference manual.

The DAKOTA (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. DAKOTA contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic finite element methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the DAKOTA toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a reference manual for the commands specification for the DAKOTA software, providing input overviews, option descriptions, and example specifications.

97 MATHEMATICS AND COMPUTING↗