SEARCH · Search NASA
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.
There is a significant impact of dimensional errors in systems. Dimensional analysis is difficult due to the large size of systems. SA4U and Scalpel are practical programs which can have an impact beyond traditional software as they are able to perform precise dimensional analysis and repair C++ source code.
We report that Q-POP-Thermo is a program designed to compute thermodynamic monodomain equilibrium states and their properties for ferroelectric single crystals and thin films based on the Landau-Ginzburg-Devonshire (LGD) Theory. Utilizing symbolic manipulation with the SymPy Library, the governing equations along with appropriate boundary conditions are solved for speedy minimization of the free energy of a crystal. Utilizing the popular Differential Evolution algorithm, with appropriate hybridization, multiple phase diagrams, such as the pressure-temperature phase diagram for bulk single crystals and the common strain-temperature phase diagram for monodomain thin-film systems can be readily generated. Furthermore, a variety of material properties of stable ferroelectric phases, including dielectric, piezoelectric, and electrocaloric properties, can simultaneously be calculated. Validation studies are presented for both thin-film and single crystal systems to test the effectiveness and capability of the open-source program.
In this paper the application of machine learning techniques for the development of constitutive material models is being investigated. A flow stress model, for strain rates ranging from 10 –4 to 10 12 (quasi-static to highly dynamic), and temperatures ranging from room temperature to over 1000 K, is obtained by beginning directly with experimental stress-strain data for Copper. An incrementally objective and fully implicit time integration scheme is employed to integrate the hypo-elastic constitutive model, which is then implemented into a finite element code for evaluation. Accuracy and performance of the flow stress models derived from symbolic regression are assessed by comparison to Taylor anvil impact data. The results obtained with the free-form constitutive material model are compared to well-established strength models such as the Preston-Tonks-Wallace (PTW) model and the Mechanical Threshold Stress (MTS) model. Here, preliminary results show candidate free-form models comparing well with data in regions of stress-strain space with sufficient experimental data, pointing to a potential means for both rapid prototyping in future model development, as well as the use of machine learning in capturing more data as a guide for more advanced model development.
Explore the source record for details and available documents.
In this work, we present a combination of approaches for the verification of event-condition-action (ECA) systems. The analyzed ECA systems range from structurally simple to structurally complex systems. We address the verification of reachability properties and behavioral properties. Reachability properties are represented by assertions in the program and we determine statically whether an assertion holds for all execution paths. Behavioral properties are represented as linear temporal logic formulas specifying the input/output behavior of the program. Our approach assumes a finite state space. We compare a symbolic analysis with an exhaustive state space exploration and discuss the trade-offs between the approaches in terms of the number of computed states and run-time behavior. All variants compute a state transition graph which can also be passed to an LTL verifier. The variants have a different impact on the number of computed states in the state transition graph which in turn impacts the run-time and memory consumption of subsequent phases. Finally, we evaluate the different analysis variants with the RERS benchmarks.
Dynamical systems with translational or rotational symmetry arise frequently in studies of spatially extended physical systems, such as Navier-Stokes flows on periodic domains. In these cases, it is natural to express the state of the fluid in terms of a Fourier series truncated to a finite number of modes. Here, we study a 4-dimensional model with chaotic dynamics and SO(2) symmetry similar to those that appear in fluid dynamics problems. A crucial step in the analysis of such a system is symmetry reduction. We use the model to illustrate different symmetry-reduction techniques. The system's relative equilibria are conveniently determined by rewriting the dynamics in terms of a symmetry-invariant polynomial basis. However, for the analysis of its chaotic dynamics, the “method of slices,” which is applicable to very high-dimensional problems, is preferable. We show that a Poincaré section taken on the 'slice' can be used to further reduce this flow to what is for all practical purposes a unimodal map. This enables us to systematically determine all relative periodic orbits and their symbolic dynamics up to any desired period. We then present cycle averaging formulas adequate for systems with continuous symmetry and use them to compute dynamical averages using relative periodic orbits. The convergence of such computations is discussed.
Undocumented Orphaned Wells (UOWs) are wells without an operator that have limited or no documentation with regulatory authorities. An estimated 310,000 to 800,000 UOWs exist in the United States (US), whose locations are largely unknown. These wells can potentially leak methane and other volatile organic compounds to the atmosphere, and contaminate groundwater. In this study, we developed a novel framework utilizing a state-of-the-art computer vision neural network model to identify the precise locations of potential UOWs. The U-Net model is trained to detect oil and gas well symbols in georeferenced historical topographic maps, and potential UOWs are identified as symbols that are further than 100 m from any documented well. A custom tool was developed to rapidly validate the potential UOW locations. We applied this framework to four counties in California and Oklahoma, leading to the discovery of 1301 potential UOWs across >40,000 km 2 . We confirmed the presence of 29 UOWs from satellite images and 15 UOWs from magnetic surveys in the field with a spatial accuracy on the order of 10 m. This framework can be scaled to identify potential UOWs across the US since the historical maps are available for the entire nation.
Abstract Compact symbolic expressions have been shown to be more efficient than neural network (NN) models in terms of resource consumption and inference speed when implemented on custom hardware such as field-programmable gate arrays (FPGAs), while maintaining comparable accuracy (Tsoi et al 2024 EPJ Web Conf. 295 09036). These capabilities are highly valuable in environments with stringent computational resource constraints, such as high-energy physics experiments at the CERN Large Hadron Collider. However, finding compact expressions for high-dimensional datasets remains challenging due to the inherent limitations of genetic programming (GP), the search algorithm of most symbolic regression (SR) methods. Contrary to GP, the NN approach to SR offers scalability to high-dimensional inputs and leverages gradient methods for faster equation searching. Common ways of constraining expression complexity often involve multistage pruning with fine-tuning, which can result in significant performance loss. In this work, we propose S y m b o l N e t , a NN approach to SR specifically designed as a model compression technique, aimed at enabling low-latency inference for high-dimensional inputs on custom hardware such as FPGAs. This framework allows dynamic pruning of model weights, input features, and mathematical operators in a single training process, where both training loss and expression complexity are optimized simultaneously. We introduce a sparsity regularization term for each pruning type, which can adaptively adjust its strength, leading to convergence at a target sparsity ratio. Unlike most existing SR methods that struggle with datasets containing more than O ( 10 ) inputs, we demonstrate the effectiveness of our model on the LHC jet tagging task (16 inputs), MNIST (784 inputs), and SVHN (3072 inputs).
Overview of work completed as a summer intern in the CCD.
Quantum theory of measurements is an extremely important part of quantum mechanics. Currently perturbations by quantum measurements of observable quantities of atomic systems are rarely taken into account in computing algorithms and calculations. In the previous studies of the authors, constructive model of quantum measurements has been developed and implemented in the form of symbolic and numerical calculations for the hydrogen-like atoms. This work describes a generalization of these results to the alkali metal atoms.
SAND2021-1654 O The Python Material Tensor code (PyMTensor) applies crystal symmetries to arbitrary material tensors. It uses symbolic algebra to exactly determine the zero tensor components and the relationships between the nonzero components for all crystallographic point groups. It is capable of computing components of higher-order material tensors needed when treating nonlinear effects. It has a simple and flexible interface for inputting tensor rank information and any known symmetries between tensor indices.Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.
Accurately classifying chemical structures is essential for cheminformatics and bioinformatics, including tasks such as identifying bioactive compounds of interest, screening molecules for toxicity to humans, finding non-organic compounds with desirable material properties, or organizing large chemical libraries for drug discovery or environmental monitoring. However, manual classification is labor-intensive and difficult to scale to large chemical databases. Existing automated approaches either rely on manually constructed classification rules, or are deep learning methods that lack explainability. This work presents an approach that uses generative artificial intelligence to automatically write chemical classifier programs for classes in the Chemical Entities of Biological Interest (ChEBI) database. These programs can be used for efficient deterministic run-time classification of SMILES structures, with natural language explanations. The programs themselves constitute an explainable computable ontological model of chemical class nomenclature, which we call the ChEBI Chemical Class Program Ontology (C3PO). We validated our approach against the ChEBI database, and compared our results against deep learning models and a naive SMARTS pattern based classifier. C3PO outperforms the naive classifier, but does not reach the performance of state of the art deep learning methods. However, C3PO has a number of strengths that complement deep learning methods, including explainability and reduced data dependence. C3PO can be used alongside deep learning classifiers to provide an explanation of the classification, where both methods agree. The programs can be used as part of the ontology development process, and iteratively refined by expert human curators.
We study the well-posedness of initial-value problems for abstract integrodifferential equations with unbounded operator coefficients in Hilbert spaces and provide a spectral analysis of operator functions that are symbols of the specified equations. These equations represent an abstract form of linear partial integrodifferential equations arising in viscoelasticity theory and other important applications. For the said integrodifferential equations, we obtain well-posedness results in weighted Sobolev spaces of vector functions defined on the positive semiaxis and valued in a Hilbert space. For the symbols of the said equations, we find the localization and the structure of the spectrum.
Here, we consider the interaction between acceptor pairs in doped semiconductors in the limit of large interacceptor separation relevant for low doping densities. Modeling individual acceptors via the spherical model of Baldereschi and Lipari, we calculate matrix elements of the quadrupole tensor between the four degenerate ground states and show that the acceptor has a nonzero quadrupole moment. As a result, the dominant contribution to the large-separation acceptor-acceptor interaction comes from direct (charge-density) terms rather than exchange terms. The quadrupole is the leading nonzero moment, so the electric quadrupole-quadrupole interaction dominates for large separation. We calculate the matrix elements of the quadrupole-quadrupole interaction Hamiltonian in a product-state basis and diagonalize, obtaining a closed-form expression for the energies and degeneracies of the sixteen-state energy spectrum. All dependence on material parameters enters via an overall prefactor, resulting in surprisingly simple and universal results. This simplicity is due, in part, to a mathematical happenstance, the nontrivial vanishing of a particular Wigner 6-$\mathcal{j}$ symbol, $^\{\frac{^2_3}{\small2} \frac{^2_3}{\small2} \frac{^2_3}{\small2}$$^\}$ = 0. Results are relevant to the control of two-qubit interactions in quantum computing implementations based on acceptor spins, as well as calculations of the thermodynamic properties of insulating $\mathcal{p}$-type semiconductors.
Explore the source record for details and available documents.
Abstract not provided.
With the rise of Large Language Model (LLM) generated code, including in domains like scientific computing, ensuring not only syntactical, but also mathematical correctness, has become a critical task. Traditional formal methods approaches often struggle with the ambiguity of floating-point code, and full symbolic execution is extremely costly and limited. We propose a chain-of-reasoning approach that iteratively lifts basic semantics from code into the SPIRAL system and then establishes numerical equivalency to the desired mathematical operation. Here, we leverage the ample mathematical knowledge already formalized in SPIRAL to enable the system to recognize not just different implementations of the same algorithm but fully separate approaches to solving the given problem. The chain establishes tight error bounds on the output of given code with respect to the true continuous solution it approximates, quantifying all sources of error. We demonstrate this approach by establishing the correctness of a pseudospectral solver for a simple 1-dimensional Poisson problem.
Hardware architectures become increasingly complex as the compute capabilities grow to exascale. Here, we present the Analytical Memory Model with Pipelines (AMMP) of the Performance Prediction Toolkit (PPT). PPT-AMMP takes high-level source code and hardware architecture parameters as input and predicts runtime of that code on the target hardware platform, which is defined in the input parameters. PPT-AMMP transforms the code to an (architecture-independent) intermediate representation, then (i) analyzes the basic block structure of the code, (ii) processes architecture-independent virtual memory access patterns that it uses to build memory reuse distance distribution models for each basic block, and (iii) runs detailed basic-block level simulations to determine hardware pipeline usage. PPT-AMMP uses machine learning and regression techniques to build the prediction models based on small instances of the input code, then integrates into a higher-order discrete-event simulation model of PPT running on Simian PDES engine. We validate PPT-AMMP on four standard computational physics benchmarks and present a use case of hardware parameter sensitivity analysis to identify bottleneck hardware resources on different code inputs. We further extend PPT-AMMP to predict the performance of a scientific application code, namely, the radiation transport mini-app SNAP. To this end, we analyze multi-variate regression models that accurately predict the reuse profiles and the basic block counts. We validate predicted SNAP runtimes against actual measured times.