Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Embedded 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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Planet Formation by Gas-assisted Accretion of Small Solids

We compute the accretion efficiency of small solids, with radii 1 cm ≤ R s ≤ 10 m, on planets embedded in gaseous disks. Planets have masses 3 ≤ M p ≤ 20 Earth masses (M ⊕ ) and orbit within 10 au of a solar mass star. Disk thermodynamics is modeled via 3D radiation-hydrodynamics calculations that typically resolve the planetary envelopes. Both icy and rocky solids are considered, explicitly modeling their thermodynamic evolution. The maximum efficiencies of 1 ≤ R s ≤ 100 cm particles are generally ≲10%, whereas 10 m solids tend to accrete efficiently or be segregated beyond the planet’s orbit. A simplified approach is applied to compute the accretion efficiency of small cores, with masses M p ≤ 1 M ⊕ and without envelopes, for which efficiencies are approximately proportional to $M^{2/3}_{p}$. The mass flux of solids, estimated from unperturbed drag-induced drift velocities, provides typical accretion rates dM p /dt ≲ 10 -5 M ⊕ yr -1 . In representative disk models with an initial gas-to-dust mass ratio of 70–100 and total mass of 0.05–0.06 M ⊙ , the solids’ accretion falls below 10 -6 M ⊕ yr -1 after 1–1.5 Myr. The derived accretion rates, as functions of time and planet mass, are applied to formation calculations that compute dust opacity self-consistently with the delivery of solids to the envelope. Assuming dust-to-solid coagulation times of ≈0.3 Myr and disk lifetimes of ≈3.5 Myr, heavy-element inventories in the range 3–7 M ⊕ require that ≈90–150 M ⊕ of solids cross the planet’s orbit. The formation calculations encompass a variety of outcomes, from planets a few times M ⊕ , predominantly composed of heavy elements, to giant planets. The peak luminosities during the epoch of the solids’ accretion range from ≈10 -7 to ≈10 -6 L ⊙ .

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Optimal calibration of gates in trapped-ion quantum computers

Abstract To harness the power of quantum computing, it is essential that a quantum computer provide maximal possible fidelity for a quantum circuit. To this end, much work has been done in the context of qubit routing or embedding, i.e., mapping circuit qubits to physical qubits based on gate performance metrics to optimize the fidelity of execution. Here, we take an alternative approach that leverages a unique capability of a trapped-ion quantum computer, i.e., the all-to-all qubit connectivity. We develop a method to determine a fixed number (budget) of quantum gates that, when calibrated, will maximize the fidelity of a batch of input quantum programs. This dynamic allocation of calibration resources on randomly accessible gates, determined using our heuristics, increases, for a wide range of calibration budget, the average fidelity from 70% or lower to 90% or higher for a typical batch of jobs on an 11-qubit device, in which the fidelity of calibrated and uncalibrated gates are taken to be 99% and 90%, respectively. Our heuristics are scalable, more than 2.5 orders of magnitude faster than a randomized method for synthetic benchmark circuits generated based on real-world use cases.

Maksymov, Andrii (ORCID:0000000282442851)↗
DOE OSTI2021

Projector-Free Capped-Fragment Scheme within Density Functional Embedding Theory for Covalent and Ionic Compounds

Quantum-mechanics-(QM)-based simulations now routinely aid in understanding and even discovering new chemistries involving molecules and materials exhibiting desired functionalities. Ab initio correlated wavefunction (CW) theories systematically improve QM methods, with many exhibiting high accuracy. However, execution of CW methods requires expensive computations that typically scale poorly with system size. Divide-and-conquer approaches partition large systems into smaller fragments; a lower level of theory treats fragment interactions while a preferred higher level of theory describes the important fragment. These methods offer ways to incorporate CWs into chemical simulations of large systems, e.g., biomolecules, surfaces, large inorganic clusters, bulk crystals, etc. Here we propose a partitioning protocol that utilizes capping atoms to saturate severed covalent bonds at fragment interfaces and density functional embedding theory (DFET) to describe fragment interactions. The capping groups in each fragment provide an ad-hoc potential that approximates the effects of the environment. An embedding potential optimized via DFET then serves as an augmentation of the capping group to simulate the effects of the environment. We concurrently use an auxiliary fragment (a separate system comprised of only the combined capping groups) to account for, and thereby correct, the electron density contributions of all the capping groups added to all of the fragments. This method depends only on the capped-subsystem and auxiliary-fragment electron densities, forgoing, as with the original DFET developed for metallic systems, orbital-based projector approaches that determine a nonlocal action of the embedding potential onto the fragment electrons. By using an auxiliary fragment, the method maintains a purely electron-density-dependent embedding potential, substantially lessening the cost and leading to simpler implementation. In this work, we demonstrate the utility of our capped-DFET and ensuing capped embedded CW method in two contrasting systems, namely, an organic molecule and an ionic metal oxide cluster.

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

Poincaré complex diagonals and the Bass trace conjecture

For a finitely dominated Poincaré duality space M, we show how the first author's total obstruction μ M to the existence of a Poincaré embedding of the diagonal map M→M×M relates to the Reidemeister trace of the identity map of M. We then apply this relationship to show that μ M vanishes when suitable conditions on the fundamental group of M are satisfied.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Qubit Regularization and Qubit Embedding Algebras

Qubit regularization is a procedure to regularize the infinite dimensional local Hilbert space of bosonic fields to a finite dimensional one, which is a crucial step when trying to simulate lattice quantum field theories on a quantum computer. When the qubit-regularized lattice quantum fields preserve important symmetries of the original theory, qubit regularization naturally enforces certain algebraic structures on these quantum fields. We introduce the concept of qubit embedding algebras (QEAs) to characterize this algebraic structure associated with a qubit regularization scheme. We show a systematic procedure to derive QEAs for the O(N) lattice spin models and the SU(N) lattice gauge theories. While some of the QEAs we find were discovered earlier in the context of the D-theory approach, our method shows that QEAs are far richer. A more complete understanding of the QEAs could be helpful in recovering the fixed points of the desired quantum field theories.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Triple Excitations in Green’s Function Coupled Cluster Solver for Studies of Strongly Correlated Systems in the Framework of Self-Energy Embedding Theory

Embedding theories became important approaches used for accurate calculations of both molecules and solids. In these theories, a small chosen subset of orbitals is treated with an accurate method, called an impurity solver, capable of describing higher correlation effects. Ideally, such a chosen fragment should contain multiple orbitals responsible for the chemical and physical behavior of the compound. Handling a large number of chosen orbitals presents a very significant challenge for the current generation of solvers used in the physics and chemistry community. Here, we develop a Green’s function coupled cluster singles doubles and triples (GFCCSDT) solver that can be used for a quantitative description in both molecules and solids. This solver allows us to treat orbital spaces that are inaccessible to other accurate solvers. At the same time, GFCCSDT maintains high accuracy of the resulting self-energy. Moreover, in conjunction with the GFCCSD solver, it allows us to test the systematic convergence of computational studies. Developing the CC family of solvers paves the road to fully systematic Green’s function embedding calculations in solids. In this paper, we focus on the investigation of GFCCSDT self-energies for a strongly correlated problem of SrMnO 3 solid. Subsequently, we apply this solver to solid MnO showing that an approximate variant of GFCCSDT is capable of yielding a high accuracy orbital resolved spectral function.

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

Investigating the Chinese postman problem on a quantum annealer

The recent availability of quantum annealers has fueled a new area of information technology where such devices are applied to address practically motivated and computationally difficult problems with hardware that exploits quantum mechanical phenomena. D-Wave annealers are promising platforms to solve these problems in the form of quadratic unconstrained binary optimization. Here we provide a formulation of the Chinese postman problem that can be used as a tool for probing the local connectivity of graphs and networks. We treat the problem classically with a tabu algorithm and simulated annealing, and using a D-Wave device. The efficiency of quantum annealing with respect to the simulated annealing has been demonstrated using the optimal time to solution metric. We systematically analyze computational parameters associated with the specific hardware. Our results clarify how the interplay between the embedding due to limited connectivity of the Chimera graph, the definition of logical qubits, and the role of spin-reversal controls the probability of reaching the expected solution

36 MATERIALS SCIENCE↗
DOE OSTI2020

The second-generation Shifted Boundary Method and its numerical analysis

Recently, the Shifted Boundary Method (SBM) was proposed within the class of unfitted (or immersed, or embedded) finite element methods. By reformulating the original boundary value problem over a surrogate (approximate) computational domain, the SBM avoids integration over cut cells and the associated problematic issues regarding numerical stability and matrix conditioning. Accuracy is maintained by modifying the original boundary conditions using Taylor expansions. Hence the name of the method, that shifts the location and values of the boundary conditions. In this article, we present enhanced variational SBM formulations for the Poisson and Stokes problems with improved flexibility and robustness. These simplified variational forms allow to relax some of the assumptions required by the mathematical proofs of stability and convergence of earlier implementations. First, we show that these new SBM implementations can be proved asymptotically stable and convergent even without the rather restrictive assumption that the inner product between the normals to the true and surrogate boundaries is positive. Second, we show that it is not necessary to introduce a stabilization term involving the tangential derivatives of the solution at Dirichlet boundaries, therefore avoiding the calibration of an additional stabilization parameter. Finally, we prove enhanced L 2 -estimates without the cumbersome assumption – of earlier proofs – that the surrogate domain is convex. Instead we rely on a conventional assumption that the boundary of the true domain is smooth, which can also be replaced by requiring convexity of the true domain. The aforementioned improvements open the way to a more general and efficient implementation of the Shifted Boundary Method, particularly in complex three-dimensional geometries. We complement these theoretical developments with numerical experiments in two and three dimensions.

42 ENGINEERING↗
DOE OSTI2025

Molecular property prediction for very large databases with natural language processing: a case study in ionic liquid design

The prospect of using artificial intelligence (AI) to accurately screen very large databases of compounds for multiple properties has yet to be realized. Here, we explore this possibility using ionic liquids (ILs) which offer unique physicochemical properties and excellent tunability, making them highly versatile solvents for various research applications. Screening millions of potential ILs for the best perfomance for use in specific tasks with experimental methods alone however, is impractical. Further, traditional’ physics-based computational chemistry is hindered by high computational cost. To address this challenge, we leverage a natural language processing (NLP)-based molecular embedding technique with advanced machine learning (ML) models to predict seven key IL properties: viscosity, density, ionic conductivity, surface tension, melting temperature, toxicity, and water solubility. Comprehensive datasets for these properties are obtained, then NLP featurization with Mol2vec is compared with other featurization techniques such as 2D Morgan fingerprints, and 3D quantum chemistry-derived sigma profiles. NLP-based featurization exhibited the best predictive performance, achieving the highest R 2 and lowest RMSE values for all the studied IL properties. Further, we present case studies of how ILs might be screened using combined property criteria for practical cases – lignocellulosic biomass processing, CO 2 capture, and optimal electrolytes for batteries – screening a novel database of ∼10.6 million generated feasible ILs. The results introduce NLP as a powerful tool for engineering many designer solvents with desirable properties for task specific applications.

Mohan, Mood [Oak Ridge National Laboratory (ORNL),↗
DOE OSTI2022

ImpactX v0.1

ImpactX is the next generation of the IMPACT-Z code. It is a s-based simulation code for modeling intense beams in particle accelerators using symplectic tracking methods and includes collective effects. It is multi-node parallel and supports modern compute hardware such as GPUs, modern algorithms such as mesh-refinement and realistic geometries (embedded boundaries).

Huebl, Axel↗
DOE OSTI2024

Active doping controls the mode of failure in dense colloidal gels

Mechanical properties of disordered materials are governed by their underlying free energy landscape. In contrast to external fields, embedding a small fraction of active particles within a disordered material generates nonequilibrium internal fields, which can help to circumvent kinetic barriers and modulate the free energy landscape. In this work, we investigate through computer simulations how the activity of active particles alters the mechanical response of deeply annealed polydisperse colloidal gels. We show that the “swim force” generated by the embedded active particles is responsible for determining the mode of mechanical failure, i.e., brittle vs. ductile. We find, and theoretically justify, that at a critical swim force the mechanical properties of the gel decrease abruptly, signaling a change in the mode of mechanical failure. The weakening of the elastic modulus above the critical swim force results from the change in gel porosity and distribution of attractive forces among gel particles, while below the critical swim force, the ductility enhancement is caused by an increase of gel structural disorder. Above the critical swim force, the gel develops a pronounced heterogeneous structure characterized by multiple pore spaces, and the mechanical response is controlled by dynamical heterogeneities. We contrast these results with those of a simulated monodisperse gel that exhibits a nonmonotonic trend of ductility modulation with increasing swim force, revealing a complex interplay between the gel energy landscape and embedded activity.

Zhou, Tingtao (ORCID:000000021766719X)↗
DOE OSTI2021

An embedded variable step IMEX scheme for the incompressible Navier–Stokes equations

This report presents a series of implicit–explicit (IMEX) variable stepsize algorithms for the incompressible Navier–Stokes equations (NSE). Here, IMEX means the nonlinear term is treated fully explicitly while the remaining terms are treated implicitly. With the advent of new computer architectures there has been growing demand for low memory solvers of this type. The addition of time adaptivity improves the accuracy and greatly enhances the efficiency of the algorithm. We prove energy stability of an embedded first–second order IMEX pair. For the first order member of the pair, we prove stability for variable stepsizes, and analyze convergence. We believe this to be the first proof of this type for a variable stepsize IMEX scheme for the incompressible NSE. We then define and test a variable stepsize, variable order IMEX scheme using these methods. Our work contributes several firsts for IMEX NSE schemes, including an energy argument and error analysis of a two-step, variable stepsize method, and embedded error estimation for an IMEX multi-step method.

42 ENGINEERING↗
DOE OSTI2025

A Hybrid Dynamic/Steady-State Tool With Protection Simulation for Cascading-Outage Analysis of Extreme Events in Power Systems

The bulk electric power grid is subject to vulnerabilities from component outages, which in certain combinations (extreme events) might lead to cascading outages. Some of these outages can be severe enough to trigger brownouts and blackouts. Much is known about mitigating the first few failures near the beginning of a cascade, but there are few established methods and tools for directly analyzing the risks of cascading component outages over a longer time scale. Current power system tools have limited ability to perform detailed and accurate cascading-outage analysis, which could be computationally intensive. The Dynamic Contingency Analysis Tool (DCAT) enables power system planning engineers to more realistically assess the consequences of extreme contingencies and potential cascading events across their systems and interconnections. DCAT has several unique features: (i) detailed hybrid dynamic and steady-state analysis of power systems to mimic real-world cascading outages, (ii) detailed modeling of protection systems embedded in the dynamic simulation, (iii) simulation of corrective action after transients, (iv) simulation of islanding , and (v) high-performance computing capability to simulate a large number of contingencies in a reasonable time. DCAT outputs will help find technically sound solutions to reduce the risk of cascading outages. This paper provides details of DCAT methodology and shows its capabilities with extreme events on real-world cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

ATHENA: Analytical Tool for Heterogeneous Neuromorphic Architectures

The ASC program seeks to use machine learning to improve efficiencies in its stockpile stewardship mission. Moreover, there is a growing market for technologies dedicated to accelerating AI workloads. Many of these emerging architectures promise to provide savings in energy efficiency, area, and latency when compared to traditional CPUs for these types of applications — neuromorphic analog and digital technologies provide both low-power and configurable acceleration of challenging artificial intelligence (AI) algorithms. If designed into a heterogeneous system with other accelerators and conventional compute nodes, these technologies have the potential to augment the capabilities of traditional High Performance Computing (HPC) platforms [5]. This expanded computation space requires not only a new approach to physics simulation, but the ability to evaluate and analyze next-generation architectures specialized for AI/ML workloads in both traditional HPC and embedded ND applications. Developing this capability will enable ASC to understand how this hardware performs in both HPC and ND environments, improve our ability to port our applications, guide the development of computing hardware, and inform vendor interactions, leading them toward solutions that address ASC’s unique requirements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Robust, Accurate, and Efficient: Quantum Embedding Using the Huzinaga Level-Shift Projection Operator for Complex Systems

Using wave function (WF) in density functional theory (DFT) embedding methods provides a framework for performing localized, high-accuracy WF calculations on a system, while not incurring the full computational cost of the WF calculation on the full system. To effectively partition a system into localized WF and DFT subsystems, we utilize the Huzinaga level-shift projection operator within an absolutely localized basis. In this work, we study the ability of the absolutely localized Huzinaga level-shift projection operator method to study complex WF and DFT partitions, including partitions between multiple covalent bonds, a double bond, and transition-metal–ligand bonds. We find that our methodology can accurately describe all of these complex partitions. Additionally, we study the robustness of this method with respect to the WF method, specifically where the embedded systems were described using a multiconfigurational WF method. We found that the method is systematically improvable with respect to both the number of atoms in the WF region and the size of the basis set used, with energy errors less than 1 kcal/mol. Additionally, we calculated the adsorption energy of H2 to a model of an iron metal–organic framework (Fe-MOF-74) to within 1 kcal/mol compared to CASPT2 calculations performed on the full model while incurring only a small fraction of the full computational cost. In conclusion, this work demonstrates that the absolutely localized Huzinaga level-shift projection operator method is applicable to very complex systems with difficult electronic structures.

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

A high-order Shifted Interface Method for Lagrangian shock hydrodynamics

Here, we present a new method for two-material Lagrangian hydrodynamics, which combines the Shifted Interface Method (SIM) with a high-order Finite Element Method. Our approach relies on an exact (or sharp) material interface representation, that is, it uses the precise location of the material interface. The interface is represented by the zero level-set of a continuous high-order finite element function that moves with the material velocity. This strategy allows to evolve curved material interfaces inside curved elements. By reformulating the original interface problem over a surrogate (approximate) interface, located in proximity of the true interface, the SIM avoids cut cells and the associated problematic issues regarding implementation, numerical stability, and matrix conditioning. Accuracy is maintained by modifying the original interface conditions using Taylor expansions. We demonstrate the performance of the proposed algorithms on established numerical benchmarks in one, two and three dimensions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Sequential Learning of Active Subspaces

This study shows that in recent years, active subspace methods (ASMs) have become a popular means of performing subspace sensitivity analysis on black-box functions. Naively applied, however, ASMs require gradient evaluations of the target function. In the event of noisy, expensive, or stochastic simulators, evaluating gradients via finite differencing may be infeasible. In such cases, often a surrogate model is employed, on which finite differencing is performed. When the surrogate model is a Gaussian process (GP), we show that the ASM estimator is available in closed form, rendering the finite-difference approximation unnecessary. We use our closed-form solution to develop acquisition functions focused on sequential learning tailored to sensitivity analysis on top of ASMs. We also show that the traditional ASM estimator may be viewed as a method of moments estimator for a certain class of GPs. We demonstrate how uncertainty on GP hyperparameters may be propagated to uncertainty on the sensitivity analysis, allowing model-based confidence intervals on the active subspace. Our methodological developments are illustrated on several examples.

97 MATHEMATICS AND COMPUTING↗