Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Symbolics”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Equation Discovery Using Fast Function Extraction: a Deterministic Symbolic Regression Approach

Advances in machine learning (ML) coupled with increased computational power have enabled identification of patterns in data extracted from complex systems. ML algorithms are actively being sought in recovering physical models or mathematical equations from data. This is a highly valuable technique where models cannot be built using physical reasoning alone. In this paper, we investigate the application of fast function extraction (FFX), a fast, scalable, deterministic symbolic regression algorithm to recover partial differential equations (PDEs). FFX identifies active bases among a huge set of candidate basis functions and their corresponding coefficients from recorded snapshot data. This approach uses a sparsity-promoting technique from compressive sensing and sparse optimization called pathwise regularized learning to perform feature selection and parameter estimation. Furthermore, it recovers several models of varying complexity (number of basis terms). FFX finally filters out many identified models using non-dominated sorting and forms a Pareto front consisting of optimal models with respect to minimizing complexity and test accuracy. Numerical experiments are carried out to recover several ubiquitous PDEs such as wave and heat equations among linear PDEs and Burgers, Korteweg–de Vries (KdV), and Kawahara equations among higher-order nonlinear PDEs. Additional simulations are conducted on the same PDEs under noisy conditions to test the robustness of the proposed approach.

42 ENGINEERING↗
DOE OSTI2017

SymPy: symbolic computing in Python

SymPy is an open source computer algebra system written in pure Python. It is built with a focus on extensibility and ease of use, through both interactive and programmatic applications. These characteristics have led SymPy to become a popular symbolic library for the scientific Python ecosystem. This paper presents the architecture of SymPy, a description of its features, and a discussion of select submodules. The supplementary material provide additional examples and further outline details of the architecture and features of SymPy.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

Bayesian Model Selection for Reducing Bloat and Overfitting in Genetic Programming for Symbolic Regression

When performing symbolic regression using genetic programming, overfitting and bloat can negatively impact generalizability and interpretability of the resulting equations as well as increase computation times. A Bayesian fitness metric is introduced and its impact on bloat and overfitting during population evolution is studied and compared to common alternatives in the literature. The proposed approach was found to be more robust to noise and data sparsity in numerical experiments, guiding evolution to a level of complexity appropriate to the dataset. Further evolution of the population resulted not in overfitting or bloat, but rather in slight simplifications in model form. The ability to identify an equation of complexity appropriate to the scale of noise in the training data was also demonstrated. In general, the Bayesian model selection algorithm was shown to be an effective means of regularization which resulted in less bloat and overfitting when any amount of noise was present in the training data.

Uncertainty quantification↗
DOE OSTI2025

Refining T c Prediction in Hydrides via Symbolic‐Regression‐Enhanced Electron‐Localization‐Function‐Based Descriptors

Hydrogen‐based materials are able to possess extremely high superconducting critical temperatures, T c s , due to hydrogen's low atomic mass and strong electron–phonon interaction. Recently, a descriptor based on the Electron Localization Function (ELF) has enabled the rapid estimation of the T c of hydrogen‐containing compounds from electronic networking properties, but its applicability has been limited by the small size and homogeneity of the training dataset used. Herein, the model is re‐examined, compiling a publicly available combined dataset of 244 binary and ternary hydride superconductors. The analysis shows that though ELF‐based networking remains a valuable descriptor, its predictive power declines with increasing compositional complexity. However, by introducing the molecularity index, defined as the highest value of the ELF at which two hydrogen atoms connect, and applying symbolic regression, the accuracy of the predictions can be substantially enhanced. These results establish a more robust framework for assessing superconductivity in hydride materials, facilitating accelerated screening of novel candidates through integration with crystal structure prediction methods or high‐throughput searches.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

Boundaries of amplituhedra and NMHV symbol alphabets at two loops

In this sequel to [3] we classify the boundaries of amplituhedra relevant for determining the branch points of general two-loop amplitudes in planar N = 4 super-Yang-Mills theory. We explain the connection to on-shell diagrams, which serves as a useful cross-check. Here we determine the branch points of all two-loop NMHV amplitudes by solving the Landau equations for the relevant configurations and are led thereby to a conjecture for the symbol alphabets of all such amplitudes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Symbol alphabets from plabic graphs III: n = 9

Symbol alphabets of n-particle amplitudes in N = 4 super-Yang-Mills theory are known to contain certain cluster variables of G(4, n) as well as certain algebraic functions of cluster variables. In this paper we solve the C Z = 0 matrix equations associated to several cells of the totally non-negative Grassmannian, combining methods of arXiv:2012.15812 for rational letters and arXiv:2007.00646 for algebraic letters. We identify sets of parameterizations of the top cell of G + (5, 9) for which the solutions produce all of (and only) the cluster variable letters of the 2-loop nine-particle NMHV amplitude, and identify plabic graphs from which all of its algebraic letters originate.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

A simple amplitude decision based symbol timing synchronization method for real-time IMDD-OOFDM systems

A simple amplitude decision based symbol timing synchronization method for real-time IMDD-OOFDM transmission systems is proposed and experimentally evaluated by using directly modulated DFB laser in 25 km SSMF. The experimental results show that the hardware resource consumption of the proposed synchronization technique is only 6% of the total system which can effectively release the computation complexity without sacrificing the synchronization accuracy. Less than 2 samples offset error of synchronization accuracy can be achieved at received optical power as low as − 20 dBm without employing correlation and multiplication operations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Stress intensity factor models using mechanics-guided decomposition and symbolic regression

The finite element method can be used to compute accurate stress intensity factors (SIFs) for cracks with complex geometries and boundary conditions. In contrast, handbook solutions act as surrogate SIF models that provide significantly faster evaluation times. However, the development of conventional surrogate SIF models relies on manual development based on low-order parameterizations. This limits surrogate model accuracy and generalizability. Here, in this paper, we develop a framework for the automated development of mechanics-guided handbook SIF solutions by using interpretable machine learning via genetic programming for symbolic regression (GPSR). Formalizing the mechanics-based approach of Raju and Newman, SIF training data is decomposed into multiple subsets. This decomposition enables parallel GPSR model development of subfunctions, each of which accounts for specific geometrical corrections with respect to a known analytical model. Using this mechanics-based approach with GPSR allows for equations to be learned with improved accuracy and reduced complexity relative to the Raju Newman equations while maintaining the inherent interpretability of mathematical expressions. In this paper, we present equations that match the complexity of the Raju Newman equations while having reduced error, as well as equations with similar errors and reduced complexity.

42 ENGINEERING↗
DOE OSTI2020

Simple descriptor derived from symbolic regression accelerating the discovery of new perovskite catalysts

Symbolic regression (SR) is an approach of interpretable machine learning for building mathematical formulas that best fit certain datasets. In this work, SR is used to guide the design of new oxide perovskite catalysts with improved oxygen evolution reaction (OER) activities. A simple descriptor, μ/t, where μ and t are the octahedral and tolerance factors, respectively, is identified, which accelerates the discovery of a series of new oxide perovskite catalysts with improved OER activity. We successfully synthesise five new oxide perovskites and characterise their OER activities. Remarkably, four of them, Cs 0.4 La 0.6 Mn 0.25 Co 0.75 O 3 , Cs 0.3 La 0.7 NiO 3 , SrNi 0.75 Co 0.25 O 3 , and Sr 0.25 Ba 0.75 NiO 3 , are among the oxide perovskite catalysts with the highest intrinsic activities. Our results demonstrate the potential of SR for accelerating the data-driven design and discovery of new materials with improved properties.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2014

Derivatives of the Pochhammer and reciprocal Pochhammer symbols and their use in epsilon-expansions of Appell and Kampé de Fériet functions

Useful expressions of the derivatives, to any order, of Pochhammer and reciprocal Pochhammer symbols with respect to their arguments are presented. They are building blocks of a procedure, recently suggested, for obtaining the ε-expansion of functions of the hypergeometric class related to Feynman integrals. The procedure is applied to some examples of such kind of functions taken from the literature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Semi-classical properties of Berezin–Toeplitz operators with C{sup k}-symbol

We obtain the semi-classical expansion of the kernels and traces of Toeplitz operators with C{sup k}-symbol on a symplectic manifold. We also give a semi-classical estimate of the distance of a Toeplitz operator to the space of self-adjoint and multiplication operators.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

SYMBA: symbolic computation of squared amplitudes in high energy physics with machine learning

The cross section is one of the most important physical quantities in high-energy physics and the most time consuming to compute. While machine learning has proven to be highly successful in numerical calculations in high-energy physics, analytical calculations using machine learning are still in their infancy. In this work, we use a sequence-to-sequence model, specifically, a transformer, to compute a key element of the cross section calculation, namely, the squared amplitude of an interaction. We show that a transformer model is able to predict correctly 97.6% and 99% of squared amplitudes of quantum chromodynamics and quantum electrodynamics processes, respectively, at a speed that is up to orders of magnitude faster than current symbolic computation frameworks. We discuss the performance of the current model, its limitations and possible future directions for this work.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Machine learning of Kondo physics using variational autoencoders and symbolic regression

In this work, we employ variational autoencoders to extract physical insight from a dataset of one-particle Anderson impurity model spectral functions. Autoencoders are trained to find a low-dimensional, latent space representation that faithfully characterizes each element of the training set, as measured by a reconstruction error. Variational autoencoders, a probabilistic generalization of standard autoencoders, further condition the learned latent space to promote highly interpretable features. In our study, we find that the learned latent variables strongly correlate with well known, but nontrivial, parameters that characterize emergent behaviors in the Anderson impurity model. In particular, one latent variable correlates with particle-hole asymmetry, while another is in near one-to-one correspondence with the Kondo temperature, a dynamically generated low-energy scale in the impurity model. Using symbolic regression, we model this variable as a function of the known bare physical input parameters and "rediscover" the nonperturbative formula for the Kondo temperature. The machine learning pipeline we develop suggests a general purpose approach, which opens opportunities to discover new domain knowledge in other physical systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Symbolic pregression: Discovering physical laws from distorted video

In this work, we present a method for unsupervised learning of equations of motion for objects in raw and optionally distorted unlabeled synthetic video (or, more generally, for discovering and modeling predictable features in time-series data). We first train an autoencoder that maps each video frame into a low-dimensional latent space where the laws of motion are as simple as possible, by minimizing a combination of nonlinearity, acceleration, and prediction error. Differential equations describing the motion are then discovered using Pareto-optimal symbolic regression. We find that our pre-regression (“pregression”) step is able to rediscover Cartesian coordinates of unlabeled moving objects even when the video is distorted by a generalized lens. Using intuition from multidimensional knot theory, we find that the pregression step is facilitated by first adding extra latent space dimensions to avoid topological problems during training and then removing these extra dimensions via principal component analysis. An inertial frame is autodiscovered by minimizing the combined equation complexity for multiple experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Stellarator Design Exploration Using Symbolic-Regression Neutronics Surrogates

Systems codes require fast, simplified models to rapidly evaluate fusion power plant concepts, but neutronics analyses are often a computational bottleneck. Here, to address this, surrogate models for key neutronics responses have been developed using 3-D neutronics-ready models built with the open-source code ParaStell from a database of stellarator equilibria. Neutronics responses such as tritium breeding ratio (TBR), nuclear heating, and neutron-induced radiation damage displacements per atom (dpa) were simulated using OpenMC. Through sensitivity analysis and symbolic regression (SR), simple power-law formulas were derived connecting these neutronics responses to global stellarator parameters, including fusion power, plasma surface area, and plasma elongation. Validation shows these formulas can predict the simulation results with low error, enabling quick and accurate assessment of neutronics requirements in stellarator design exploration activities with systems codes.

Modeling↗