SEARCH · Engineering Papers
Results for “SYMBOL”
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.
Lattice Thermal Conductivity Prediction Using Symbolic Regression and Machine Learning
Not provided.
Symbolic methods for the evaluation of sum rules of Bessel functions
The use of the umbral formalism allows a significant simplification of the derivation of sum rules involving products of special functions and polynomials. We rederive in this way known sum rules and addition theorems for Bessel functions. Furthermore, we obtain a set of new closed form sum rules involving various special polynomials and Bessel functions. The examples we consider are relevant for applications ranging from plasma physics to quantum optics.
Information transmission in bosonic memory channels using Gaussian matrix-product states as near-optimal symbols
We seek for a realistic implementation of multimode Gaussian entangled states that can realize the optimal encoding for quantum bosonic Gaussian channels with memory. For a Gaussian channel with classical additive Markovian correlated noise and a lossy channel with non-Markovian correlated noise, we demonstrate the usefulness using Gaussian matrix-product states (GMPS). These states can be generated sequentially, and may, in principle, approximate well any Gaussian state. We show that we can achieve up to 99.9% of the classical Gaussian capacity with GMPS requiring squeezing parameters that are reachable with current technology. This may offer a way towards an experimental realization.
Landau-Pomeranchuk-Migdal effect in sequential bremsstrahlung: From large- N QCD to N = 3 via the SU ( N ) analog of Wigner 6 - j symbols
Not Available
X-symbols for non-Abelian symmetries in tensor networks
Not Available
Symbolic Analysis of Concurrency Errors in OpenMP Programs
Abstract not provided
Symmetry reduction of tensor networks in many-body theory: I. Automated symbolic evaluation of SU(2) algebra
Abstract The ongoing progress in (nuclear) many-body theory is accompanied by an ever-rising increase in complexity of the underlying formalisms used to solve the stationary Schrödinger equation. The associated working equations at play in state-of-the-art ab initio nuclear many-body methods can be analytically reduced with respect to angular-momentum, i.e. SU (2), quantum numbers whenever they are effectively employed in a symmetry-restricted context. The corresponding procedure constitutes a tedious and error-prone but yet an integral part of the implementation of those many-body frameworks. Indeed, this symmetry reduction is a key step to advance modern simulations to higher accuracy since the use of symmetry-adapted tensors can decrease the computational complexity by orders of magnitude. While attempts have been made in the past to automate the (anti-) commutation rules linked to Fermionic and Bosonic algebras at play in the derivation of the working equations, there is no systematic account to achieve the same goal for their symmetry reduction. In this work, the first version of an automated tool performing graph-theory-based angular-momentum reduction is presented. Taking the symmetry-unrestricted expressions of a generic tensor network as an input, the code provides their angular-momentum-reduced form in an error-safe way in a matter of seconds. Several state-of-the-art many-body methods serve as examples to demonstrate the generality of the approach and to highlight the potential impact on the many-body community.
Creating Human Readable Path Constraints from Symbolic Execution.
Abstract not provided.
Multi-bit symbol error detection and correction
Explore the source record for details and available documents.
Symmetry Analysis Using Symbolic Computation
The symmetry group of a system of differential equations reveals basic invariant properties of the underlying model and its solutions. In many cases symmetry groups have simple geometric interpretations that can be applied to simplify the model and determine certain classes of solutions explicitly. The general procedure to compute the symmetry group of a given system of differential equations follows a well-known algorithm. However, this procedure involves a large number of laborious and usually error-prone calculations, especially in the case of higher-order systems. The purpose of this report is explain how to use an existing software program designed to automate the major steps of this algorithm in order to calculate the symmetry group of any system of differential equations more efficiently.
Establishing a data-driven deformation model for Tin using symbolic regression and genetic programming .
Abstract not provided.
Improved Plasticity and Damage Models By Symbolic Regression of Microscale Finite Element Simulations.
Abstract not provided.
Machine learning of symbolic expressions to model dispersion curves in metamaterials.
Abstract not provided.
A Data-driven Approach for Improving the Existing Gurson Material Damage Model Using Genetic Programming for Symbolic Regression.
Abstract not provided.
Uncertainty Quantification for Interpretable Constitutive Models using Genetic Programming based Symbolic Regression
Explore the source record for details and available documents.