Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Arbitrary functions”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Analytical integration of the tractions induced by non-singular dislocations on an arbitrary shaped triangular quadratic element

Here, an analytical model is proposed to evaluate the nodal force induced by a segment of dislocation upon an arbitrary shaped triangular element. This calculation is required in hybrid methods that associate dislocation dynamics to boundary or finite element to solve simultaneously the evolution of large ensembles of dislocations with complex boundary conditions. Nodal forces are defined as the triple integration of the unbalanced traction field induced by a straight dislocation upon the surface of the element. Following our previous approach (Queyreau et al 2014 Modelling Simul. Mater. Sci. Eng. 22 035004) on a simpler geometry and in the case of linear isotropic elasticity, triple integrals are solved by sequences of integration by parts that exhibit recurrence relations. The traction field is defined and finite everywhere even at the core of dislocations, thanks to the use of the non-singular stress expression formulated by Cai et al (2006 J. Mech. Phys. Solids 54 561–587). The nodal force expressions can be used when considering both a single convolution or double convolution of the Green's function with the core distribution. A solution is also proposed for the case of a semi-infinite segment through the study of the asymptotic behavior of the analytical expressions. The proposed approach is exact and very computationally efficient. The choice of an arbitrary shaped triangular element and quadratic shape functions allow the consideration of complex geometries and comply with automatic meshing procedures. These analytical expressions could also be employed to estimate dislocation interactions with interfaces.

42 ENGINEERING↗
DOE OSTI2022

ConKer: An algorithm for evaluating correlations of arbitrary order

Context. High order correlations in the cosmic matter density have become increasingly valuable in cosmological analyses. However, computing these correlation functions is computationally expensive. Aims. We aim to circumvent these challenges by developing a new algorithm called ConKer for estimating correlation functions. Methods. This algorithm performs convolutions of matter distributions with spherical kernels using FFT. Since matter distributions and kernels are defined on a grid, it results in some loss of accuracy in the distance and angle definitions. We study the algorithm setting at which these limitations become critical and suggest ways to minimize them. Results. ConKer is applied to the CMASS sample of the SDSS DR12 galaxy survey and corresponding mock catalogs, and is used to compute the correlation functions up to correlation order n = 5. We compare the n = 2 and n = 3 cases to traditional algorithms to verify the accuracy of the new algorithm. We perform a timing study of the algorithm and find that three of the four distinct processes within the algorithm are nearly independent of the catalog size N , while one subdominant component scales as O ( N ). The dominant portion of the calculation has complexity of O ( N c 4/3 log N c ), where N c is the of cells in a three-dimensional grid corresponding to the matter density. Conclusions. We find ConKer to be a fast and accurate method of probing high order correlations in the cosmic matter density, then discuss its application to upcoming surveys of large-scale structure.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

MiniDAQ-3: Providing concurrent independent subdetector data-taking on CMS production DAQ resources

The data acquisition (DAQ) of the Compact Muon Solenoid (CMS) experiment at CERN, collects data for events accepted by the Level-1 Trigger from the different detector systems and assembles them in an event builder prior to making them available for further selection in the High Level Trigger, and finally storing the selected events for offline analysis. In addition to the central DAQ providing global acquisition functionality, several separate, so-called “MiniDAQ” setups allow operating independent data acquisition runs using an arbitrary subset of the CMS subdetectors. During Run 2 of the LHC, MiniDAQ setups were running their event builder and High Level Trigger applications on dedicated resources, separate from those used for the central DAQ. This cleanly separated MiniDAQ setups from the central DAQ system, but also meant limited throughput and a fixed number of possible MiniDAQ setups. In Run 3, MiniDAQ-3 setups share production resources with the new central DAQ system, allowing each setup to operate at the maximum Level-1 rate thanks to the reuse of the resources and network bandwidth. Configuration management tools had to be significantly extended to support the synchronization of the DAQ configurations needed for the various setups. We report on the new configuration management features and on the first year of operational experience with the new MiniDAQ-3 system.

Amoiridis, Vassileios↗
DOE OSTI2021

Moments of the Boltzmann collision operator for Coulomb interactions

Exact moments of the Boltzmann collision operator are calculated in the irreducible Hermitian moment expansion written in terms of the random-velocity variable of each species. The formulas are presented in closed, algebraic form and can be straightforwardly implemented in computer algebra systems. They are valid for two arbitrary masses, temperatures, and flow velocities, and hence include all other existing results derived for distribution functions expanded with respect to reference states of one temperature and flow velocity. In comparison, the Landau collisional moments are good approximations for large Coulomb logarithm and small relative flow velocity, but they fail to predict the correct behavior of most collisional moments for large relative flow even for weakly coupled plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Nonequilibrium spectral moment sum rules of the Holstein–Hubbard model

Abstract We derive a general procedure for evaluating the n th derivative of a time-dependent operator in the Heisenberg representation and employ this approach to calculate the zeroth to third spectral moment sum rules of the retarded electronic Green’s function and self-energy for a system described by the Holstein–Hubbard model allowing for arbitrary spatial and time variation of all parameters (including spatially homogeneous electric fields and parameter quenches). For a translationally invariant (but time-dependent) Hamiltonian, we also provide sum rules in momentum space. The sum rules can be applied to various different phenomena like time-resolved angle-resolved photoemission spectroscopy and benchmarking the accuracy of numerical many-body calculations. This work also corrects some errors found in earlier work on simpler models.

Physics↗
DOE OSTI2024

Reconstructing the spatial structure of quantum correlations in materials

Quantum correlations are a fundamental property of quantum many-body states. Yet they remain experimentally elusive, hindering certification of genuine quantum behavior, especially in quantum materials. Here we show that the momentum-dependent dynamical susceptibility measured via inelastic neutron scattering enables the systematic reconstruction of a general family of quantum correlation functions, which express the degree of quantum coherence in the fluctuations of two spins at an arbitrary mutual distance. Using neutron scattering data for the compound KCuF 3 —a system of weakly coupled S = 1 / 2 Heisenberg chains—and numerically exact quantum Monte Carlo data, we show that quantum correlations possess a radically different spatial structure with respect to conventional correlations. Indeed, they exhibit a different emergent length scale—the quantum coherence length—which is finite at any finite temperature (including when long-range magnetic order develops). Moreover, we show theoretically that coupled Heisenberg spin chains exhibit a form of quantum monogamy, with a trade-off between quantum correlations along and transverse to the spin chains. These results highlight real-space quantum correlators as an informative, model-independent means of probing the underlying quantum state of real quantum materials. Published by the American Physical Society 2024

36 MATERIALS SCIENCE↗
DOE OSTI2022

Accessing scattering amplitudes using quantum computers

Future quantum computers may serve as a tool to access non-perturbative real-time correlation functions. In this talk, we discuss the prospects of using these to study Compton scattering for arbitrary kinematics. The restriction to a finite-volume spacetime, unavoidable in foreseeable quantum-computer simulations, must be taken into account in the formalism for extracting scattering observables. One approach is to work with a non-zero iϵ-prescription in the Fourier transform to definite momentum and then to estimate an ordered double limit, in which the spacetime volume is sent to infinity before ϵ is sent to 0. For the amplitudes and parameters considered here, we find that significant volume effects arise, making the required limit very challenging. We present a practical solution to this challenge that may allow for future determinations of deeply virtual Compton scattering amplitudes, as well as many other reactions that are presently outside the scope of standard lattice QCD calculations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Efficient, direct compilation of SU(N) operations into SNAP & Displacement gates

We present a function which connects the parameter of a previously published short sequence of selective number-dependent arbitrary phase (SNAP) and displacement gates acting on a qudit encoded into the Fock states of a superconducting cavity, $V_k(\alpha)=D(\alpha)R_\pi(k)D(-2\alpha)R_\pi(k)D(\alpha)$ to the angle of the Givens rotation $G(\theta)$ on levels $|k\rangle,|k+1\rangle$ that sequence approximates, namely $\alpha=\Phi(\theta) = \frac{\theta}{4\sqrt{k+1}}$. Previous publications left the determination of an appropriate $\alpha$ to numerical optimization at compile time. The map $\Phi$ gives us the ability to compile directly any $d$-dimensional unitary into a sequence of SNAP and displacement gates in $O(d^3)$ complex floating point operations with low constant prefactor, avoiding the need for numerical optimization. Numerical studies demonstrate that the infidelity of the generated gate sequence $V_k$ per Givens rotation $G$ scales as approximately $O(\theta^6)$. We find numerically that the error on compiled circuits can be made arbitrarily small by breaking each rotation into $m$$\theta/m$ rotations, with the full $d\times d$ unitary infidelity scaling as approximately $O(m^{-4})$. This represents a significant reduction in the computational effort to compile qudit unitaries either to SNAP and displacement gates or to generate them via direct low-level pulse optimization via optimal control.

Job, Joshua↗
DOE OSTI2024

Shorter function summaries for finite state machine-based high consequence systems using logic synthesis and tautologies (Final Report LDRD 24-1302)

Computer programs are often viewed as collections of functions – each function has parameters (inputs) and computes a return value, and each has potential side effects that modify program state (outputs). In this research, a Sandia symbolic execution tool designed to support “human-in-the-loop” analysis was modified to automatically create “function summaries,” and a new tool, “diaboolical,” was created to support enhancing readability of the summary using a novel approach to bit-vector simplification that leverages logic synthesis and tautologies. For this effort, students at Auburn University created several finite state machines (FSMs) to serve as exemplars for high-consequence systems. Function summaries for each of the machines were obtained, and then portions of the summaries were simplified using both diaboolical and the simplification procedure of a popular SMT solver. A comparison of the results shows that diaboolical can often produce smaller function summaries, with expression length improvements over the unsimplified function summaries ranging from 0% to 90% for diaboolical and 0% to 65% for the SMT solver, though diaboolical had a significantly greater cost in time. Diaboolical was evaluated against a collection of “arbitrary” C-code as well as FSM exemplars, and for both datasets it achieved an approximately 10% improvement in expression length compared to simplifications that could be obtained using existing techniques. Function summaries can assist assurance efforts that evaluate existing systems and their executable code. A smaller function summary is likely easier for humans to understand and could thus increase the ability and efficacy of assurance practices centered around the analysis of executable artifacts.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A simplified framework for prediction of sensor network coverage in real-time structural health monitoring of plate-like structures

In this article, the coverage area prediction of piezoelectric sensor network for detecting a specific type of under-surface crack in plate-like structures is addressed. In particular, this article proposes a simplified framework to estimate the coverage of any given sensor network arrangement when a critical defect is known. Based on numerical results from finite element methods (FEM), a simplified framework to estimate coverage area of any given network arrangement is developed. Using such a simplified framework, one can avoid time-consuming procedure of evaluating numerous FEM models in estimating sensor network coverage. Back-scatter fields of partial cracks are estimated using a proposed function, whose parameters are estimated from the results of a limited number of FEM simulations. The proposed function efficiently predicts the back-scattered field of any combination of transmitters and receivers for a given crack geometry. Superposition is used to estimate the coverage area of an arbitrary piezoelectric (e.g., PZT) sensor network. It is shown that the coverage area of a sensor network depends on both sensor network geometry and defect properties (e.g., crack inclination) and it is not necessarily a linear function of the number of sensors. Furthermore, it is shown that the network arrangement has an important effect on the geometry of the coverage area. Experimental results of a network of 14 PZTs in two clusters confirm the accuracy of the method.

Engineering↗
DOE OSTI2024

Diamond surface functionalization via visible light–driven C–H activation for nanoscale quantum sensing

Nitrogen-vacancy (NV) centers in diamond are a promising platform for nanoscale NMR sensing. Despite significant progress toward using NV centers to detect and localize nuclear spins down to the single spin level, NV-based spectroscopy of individual, intact, arbitrary target molecules remains elusive. Such sensing requires that target molecules are immobilized within nanometers of NV centers with long spin coherence. The inert nature of diamond typically requires harsh functionalization techniques such as thermal annealing or plasma processing, limiting the scope of functional groups that can be attached to the surface. Solution-phase chemical methods can be readily generalized to install diverse functional groups, but they have not been widely explored for single-crystal diamond surfaces. Moreover, realizing shallow NV centers with long spin coherence times requires highly ordered single-crystal surfaces, and solution-phase functionalization has not yet been shown with such demanding conditions. In this work, we report a versatile strategy to directly functionalize C–H bonds on single-crystal diamond surfaces under ambient conditions using visible light, forming C–F, C–Cl, C–S, and C–N bonds at the surface. This method is compatible with NV centers within 10 nm of the surface with spin coherence times comparable to the state of the art. As a proof-of-principle demonstration, we use shallow ensembles of NV centers to detect nuclear spins from surface-bound functional groups. Our approach to surface functionalization opens the door to deploying NV centers as a tool for chemical sensing and single-molecule spectroscopy.

Science & Technology - Other Topics↗
DOE OSTI2023

Universal linear intensity transformations using spatially incoherent diffractive processors

Abstract Under spatially coherent light, a diffractive optical network composed of structured surfaces can be designed to perform any arbitrary complex-valued linear transformation between its input and output fields-of-view (FOVs) if the total number ( N ) of optimizable phase-only diffractive features is ≥~2 N i N o , where N i and N o refer to the number of useful pixels at the input and the output FOVs, respectively. Here we report the design of a spatially incoherent diffractive optical processor that can approximate any arbitrary linear transformation in time-averaged intensity between its input and output FOVs. Under spatially incoherent monochromatic light, the spatially varying intensity point spread function ( H ) of a diffractive network, corresponding to a given, arbitrarily-selected linear intensity transformation, can be written as H ( m , n ; m ′, n ′) = | h ( m , n ; m ′, n ′)| 2 , where h is the spatially coherent point spread function of the same diffractive network, and ( m , n ) and ( m ′, n ′) define the coordinates of the output and input FOVs, respectively. Using numerical simulations and deep learning, supervised through examples of input-output profiles, we demonstrate that a spatially incoherent diffractive network can be trained to all-optically perform any arbitrary linear intensity transformation between its input and output if N ≥ ~2 N i N o . We also report the design of spatially incoherent diffractive networks for linear processing of intensity information at multiple illumination wavelengths, operating simultaneously. Finally, we numerically demonstrate a diffractive network design that performs all-optical classification of handwritten digits under spatially incoherent illumination, achieving a test accuracy of >95%. Spatially incoherent diffractive networks will be broadly useful for designing all-optical visual processors that can work under natural light.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Noncommutative Bohnenblust–Hille inequalities

Abstract Bohnenblust–Hille inequalities for Boolean cubes have been proven with dimension-free constants that grow subexponentially in the degree (Defant et al. in Math Ann 374(1):653–680, 2019). Such inequalities have found great applications in learning low-degree Boolean functions (Eskenazis and Ivanisvili in Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, pp 203–207, 2022). Motivated by learning quantum observables, a qubit analogue of Bohnenblust–Hille inequality for Boolean cubes was recently conjectured in Rouzé et al. (Quantum Talagrand, KKL and Friedgut’s theorems and the learnability of quantum Boolean functions, 2022. arXiv preprint arXiv:2209.07279 ). The conjecture was resolved in Huang et al. (Learning to predict arbitrary quantum processes, 2022. arXiv preprint arXiv:2210.14894 ). In this paper, we give a new proof of these Bohnenblust–Hille inequalities for qubit system with constants that are dimension-free and of exponential growth in the degree. As a consequence, we obtain a junta theorem for low-degree polynomials. Using similar ideas, we also study learning problems of low degree quantum observables and Bohr’s radius phenomenon on quantum Boolean cubes.

Volberg, Alexander↗
DOE OSTI2022

A fast approximation to supershell partition functions

A formula for supershell partition functions, which play a major role in the Super Transition Array approach to radiative-opacity calculations, is derived as a functional of the distribution of energies within the supershell. It consists in an alternative expansion for an arbitrary number of electrons or holes which also allows for quick approximate evaluations with truncated number of terms in the expansion.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Continuously bounds-preserving discontinuous Galerkin methods for hyperbolic conservation laws

For finite element approximations of transport phenomena, it is often necessary to apply a form of limiting to ensure that the discrete solution remains well-behaved and satisfies physical constraints. However, these limiting procedures are typically performed at discrete nodal locations, which is not sufficient to ensure the robustness of the scheme when the solution must be evaluated at arbitrary locations (e.g., for adaptive mesh refinement, remapping in arbitrary Lagrangian–Eulerian solvers, overset meshes, etc.). In this work, a novel limiting approach for discontinuous Galerkin methods is presented which ensures that the solution is continuously bounds-preserving (i.e., across the entire solution polynomial) for any arbitrary choice of basis, approximation order, and mesh element type. Through a modified formulation for the constraint functionals, the proposed approach requires only the solution of a single spatial scalar minimization problem per element for which a highly efficient numerical optimization procedure is presented. Here, the efficacy of this approach is shown in numerical experiments by enforcing continuous constraints in high-order unstructured discontinuous Galerkin discretizations of hyperbolic conservation laws, ranging from scalar transport with maximum principle preserving constraints to compressible gas dynamics with positivity-preserving constraints.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Recent Advances toward Efficient Calculation of Higher Nuclear Derivatives in Quantum Chemistry

In this article, we provide an overview of state-of-the-art techniques that are being developed for efficient calculation of second and higher nuclear derivatives of quantum mechanical (QM) energy. Calculations of nuclear Hessians and anharmonic terms incur high costs and memory and scale poorly with system size. Three emerging classes of methods—machine learning (ML), automatic differentiation (AD), and matrix completion (MC)—have demonstrated promise in overcoming these challenges. We illustrate studies that employ unsupervised ML methods to reduce the need for multiple Hessian calculations in dynamics simulations and those that utilize supervised ML to construct approximate potential energy surfaces and estimate Hessians and anharmonic terms at reduced cost. By extension, if electronic structure operations could be written in a manner similar to functions underlying ML methods, rapid differentiation or AD routines can be employed to inexpensively calculate higher arbitrary-order derivatives. While ML approaches are typically black-box, we describe methods such as compressed sensing (CS) and MC, which explicitly leverage problem-specific mathematical properties of higher derivatives such as sparsity and low-rank, to complete higher derivative information using only a small, incomplete sample. The three classes of methods facilitate reliable predictions of observables ranging from infrared spectra to thermal conductivity and constitute a promising way forward in accurately capturing otherwise intractable higher-order responses of QM energy to nuclear perturbations.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗
DOE OSTI2020

Phase control of coherent acoustic phonons in gold bipyramids for optical memory and manipulating plasmon–exciton coupling

Recent efforts have targeted manipulation of nanomaterial vibrational modes in applications such as chemical/mass sensing, optical switching, and phonon-driven photochemistry. While impulsive photoexcitation can generate coherent phonons, multiple excitation pulses offer the prospect of control and manipulation of coherent phonon modes for functions of optical memory and logic. In this work, we use such an approach to inject an arbitrary coherent phonon phase into a colloidal ensemble of highly monodisperse gold bipyramids. We then demonstrate that this technique can be applied to a system that exhibits plasmon-exciton coupling to further manipulate the hybridization of the system. This ability to manipulate acoustic phonons and hybridization can enable optical logic applications of acoustic phonons in addition to optical memory.

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

Laika BOSS (Binary Object Scanning System)

Laika BOSS (Binary Object Scanning System), often written as "Laikaboss", is an object scanner and intrusion detection system that strives to be scalable, flexible, and verbose. Its goal is to take arbitrary file input and extract all relevant subfiles and metadata for use in helping analysts determine the function and maliciousness of a file at a glance. This is an extension to the original code developed by Lockheed Martin.

Walkup, Gregory↗