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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Characterizing degraded visual environments with scanning lenses to improve contrast recovery

Atmospheric aerosols, such as fog and smoke, degrade optical signals via the scattering and absorption of light, making it difficult to recover information from the surrounding environment. Here, we present a technique that measures the angular distribution of light in scattering environments to help recover these degraded optical signals. This is done by passing a collimated beam through the aerosol environment and collecting the scattered and unscattered light with an f-theta scan lens. The lens transforms the angular distribution of the scattered light into the linear domain, mapping the collected light onto a detector. The measured angular scattering distribution is then used to estimate the point spread function of the environment at an arbitrary stand-off distance. This point spread function can be used to deconvolve images blurred by the aerosol environment in which the angular scattering distribution was initially measured. With this approach, we demonstrate improvements in the effective resolution of deblurred images up to 26% over a 120-cm stand-off distance. Experimentation was performed in the Sandia National Laboratories tabletop fog chamber, a platform that generates aerosol environments analogous to real-world fogs. We intend to leverage this technique in future work to develop a low-SWaP system for the in situ characterization of aerosol environments.

Aerosols↗
DOE OSTI2026

Learning the generating functional for variance reduction in lattice QCD

The generating functional in quantum field theory provides the natural framework for constructing correlation functions as derivatives with respect to source operators. We present a methodology that leverages machine-learned normalizing flows to reduce the variance of arbitrary $N$-point correlation functions of bosonic operators in lattice gauge field theory calculations by encoding a representation of the generating functional. We show that it is possible to systematically approach noiseless estimators of correlation functions in this framework. We demonstrate this methodology with applications to calculations of glueball correlation functions and Wilson loops in Quantum Chromodynamics and Yang-Mills theory. The results show up to three orders of magnitude variance reduction.

Abbott, Ryan [Columbia U.] (ORCID:0000000258778005↗
DOE OSTI2025

Graph-based Reversible Evaluation and Tangents Library

GRETL is a C++ library for evaluation, re-evaluation and algorithmic differentiation of functional operations on an arbitrary computational graph with limited memory usage. Similar to popular machine learning frameworks in Python, like PyTorch and JAX, it tracks and stores both operations and output data as functions are evaluated. Once this composition of functions is built up, the entire chain of operations can be back propagated to compute sensitivities of the final result with respect to any number of inputs. In contrast to most machine learning applications, memory usage becomes the bottleneck for back propagation in many physics applications, especially for time-dependent PDEs. Dynamic check pointing becomes essential. An important distinguishing feature of GRETL is its ability to limit the maximum memory usage by automatically dynamic checkpointing the data output for each graph operation (see Wang, Moin, Iaccarino, 2009). During backpropagation, parts of the graph that are no longer in memory are automatically re-evaluated from upstream checkpointed states as needed for derivative sensitivity calculations (or more precisely, for vector-Jacobian products). GRETL is particularly beneficial for applications, such as coupled multi-physics, where deriving adjoint-based sensitivities and managing checkpoint memory across modules becomes onerous. Cases which can be readily handled by the GRETL library include: different time-integration algorithms per physics (e.g., coupled predictor-corrector algorithms, IMEX, etc.), sub-cycling, asynchronous integrators, state dependent timestep sizes, iterative solvers and coupling algorithms, controller algorithms, and more.

Tupek, MichaelR [Lawrence Livermore National Labor↗
DOE OSTI2023

Black hole horizon edge partition functions

We extend a formula for 1-loop black hole determinants by Denef, Hartnoll, and Sachdev (DHS) to spinning fields on any (d + 1)-dimensional static spherically symmetric black hole. By carefully analyzing the regularity condition imposed on the Euclidean eigenfunctions, we reveal an unambiguous bulk-edge split in the 1-loop Euclidean partition function for tensor fields of arbitrary integer spin: the bulk part captures the “renormalized” thermal canonical partition function recently discussed in [1]; the edge part is related to quasinormal modes (QNMs) that fail to analytically continue to a subset of Euclidean modes with enhanced fall-offs near the origin. Since the edge part takes the form of a path integral on S d–1 , this suggests that these are associated with degrees of freedom living on the bifurcation surface in the Lorentzian two-sided black hole geometry. For massive higher spin on static BTZ and massive vector on Nariai black holes, we find that the edge partition function is related to the QNMs with lowest overtone numbers.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

What is the gradient of a scalar function defined on a subspace of square matrices?

We illustrate a technique to calculate the gradient of scalar functions that are defined on any arbitrary matrix subspace. It generalizes our earlier work titled “What is the gradient of a scalar function of a symmetric matrix ?”(Indian Journal of Pure and Applied Mathematics (2022), doi:10.1007/s13226-022-00313-x), in which we considered the special case of the subspace of symmetric matrices. Extant methods to calculate the gradient in such cases have an inherent flaw which leads to spurious results that populate several publications, as well as respected textbooks and handbooks on matrix calculus. We examine these sources and results in a rigorous and concrete mathematical setting of a finite-dimensional inner-product space and discover the inherent flaw and also a remedy. We demonstrate two ways to calculate the derivative/gradient and second derivative for scalar functions of matrices defined over an arbitrary matrix subspace; the first method is by considering any (differentiable) extension to the space of square matrices and projection of its gradient onto the given subspace. The second method utilizes an ordered basis and computes each component of the gradient through evaluation of the directional derivative. All the ideas presented are illustrated by non-trivial examples, namely, considering the subspace of 3 × 3 circulant and Toeplitz matrices and presenting the results of gradient-descent with both the spurious and correct gradients. Moreover, our bibliography makes it clear that a rigorous approach to matrix calculus is not common in practice, and our presentation of matrix calculus in the language of inner-product spaces will be significant and meaningful for applied mathematicians, engineers and researchers working in inter-disciplinary fields to avoid the conceptual pitfalls that exist.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

What is the gradient of a scalar function defined on a subspace of square matrices?

We illustrate a technique to calculate the gradient of scalar functions that are defined on any arbitrary matrix subspace. It generalizes our earlier work titled “What is the gradient of a scalar function of a symmetric matrix ?”(Indian Journal of Pure and Applied Mathematics (2022), https://doi.org/10.1007/s13226-022-00313-x), in which we considered the special case of the subspace of symmetric matrices. Extant methods to calculate the gradient in such cases have an inherent flaw which leads to spurious results that populate several publications, as well as respected textbooks and handbooks on matrix calculus. Here, we examine these sources and results in a rigorous and concrete mathematical setting of a finite-dimensional inner-product space and discover the inherent flaw and also a remedy. We demonstrate two ways to calculate the derivative/gradient and second derivative for scalar functions of matrices defined over an arbitrary matrix subspace; the first method is by considering any (differentiable) extension to the space of square matrices and projection of its gradient onto the given subspace. The second method utilizes an ordered basis and computes each component of the gradient through evaluation of the directional derivative. All the ideas presented are illustrated by non-trivial examples, namely, considering the subspace of 3 x 3 circulant and Toeplitz matrices and presenting the results of gradient-descent with both the spurious and correct gradients. Moreover, our bibliography makes it clear that a rigorous approach to matrix calculus is not common in practice, and our presentation of matrix calculus in the language of inner-product spaces will be significant and meaningful for applied mathematicians, engineers and researchers working in inter-disciplinary fields to avoid the conceptual pitfalls that exist.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

The inflationary wavefunction from analyticity and factorization

Here, we study the analytic properties of tree-level wavefunction coefficients in quasi-de Sitter space. We focus on theories which spontaneously break dS boost symmetries and can produce significant non-Gaussianities. The corresponding inflationary correlators are (approximately) scale invariant, but are not invariant under the full conformal group. We derive cutting rules and dispersion formulas for the late-time wavefunction coefficients by using factorization and analyticity properties of the dS bulk-to-bulk propagator. This gives a unitarity method which is valid at tree-level for general n-point functions and for fields of arbitrary mass. Using the cutting rules and dispersion formulas, we are able to compute n-point functions by gluing together lower-point functions. As an application, we study general four-point, scalar exchange diagrams in the EFT of inflation. We show that exchange diagrams constructed from boost-breaking interactions can be written as a finite sum over residues. Finally, we explain how the dS identities used in this work are related by analytic continuation to analogous identities in Anti-de Sitter space.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

The Functor system: a new on-the-fly take on Material Properties based on C++ functions

In the context of solving multiphysics problems, the discretization of the partial differential equations (PDE) at hand often takes the spotlight. However, for most engineering users and even application developers, the discretization of the equations has already been performed. Instead, they are tasked with implementing specific closure relations and material properties. MOOSE has long enabled this using the Materials system. This system relied on the pre-computation of all properties before they are used in the PDE or in postprocessing. In this talk we will introduce the Functor system, which was deployed in MOOSE in 2021, then present a few applications of functors in flow modeling simulations by the NEAMS program. Functors first offer great flexibility in their evaluation. Rather than storing various arrays for material properties, they are evaluated on the fly at the location and state, e.g. current or old value, requested. Unlike regular material properties, several operations such as the time derivative, the divergence and the curl can be requested from a functor. Similar to material properties, functors can be made to depend on arbitrary combinations of variables, functions, postprocessors and other properties. However, unlike material properties, any of these can be substituted for a functor material property. Thanks to this, objects no longer need to be duplicated based on the types of their parameters.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2025

General field evaluation in high-order meshes on GPUs

Robust and scalable function evaluation at any arbitrary point in the finite/spectral element mesh is required for querying the partial differential equation solution at points of interest, comparison of solution between different meshes, and Lagrangian particle tracking. This is a challenging problem, particularly for high-order unstructured meshes partitioned in parallel with MPI, as it requires identifying the element that overlaps a given point and computing the corresponding reference space coordinates. Here, we present a robust and efficient technique for general field evaluation in large-scale high-order meshes with quadrilaterals and hexahedra. In the proposed method, a combination of globally partitioned and processor-local maps are used to first determine a list of candidate MPI ranks, and then locally candidate elements that could contain a given point. Next, element-wise bounding boxes further reduce the list of candidate elements. Finally, Newton’s method with trust region is used to determine the overlapping element and corresponding reference space coordinates. Since GPU-based architectures have become popular for accelerating computational analyses using meshes with tensor-product elements, specialized kernels have been developed to utilize the proposed methodology on GPUs. The method is also extended to enable general field evaluation on surface meshes. The paper concludes by demonstrating the use of the proposed method in various applications ranging from mesh-to-mesh transfer during r-adaptivity to Lagrangian particle tracking.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Improved surrogates in inertial confinement fusion with manifold and cycle consistencies

Neural networks have become the method of choice in surrogate modeling because of their ability to characterize arbitrary, high-dimensional functions in a data-driven fashion. This paper advocates for the training of surrogates that are 1) consistent with the physical manifold, resulting in physically meaningful predictions, and 2) cyclically consistent with a jointly trained inverse model; i.e., backmapping predictions through the inverse results in the original input parameters. We find that these two consistencies lead to surrogates that are superior in terms of predictive performance, are more resilient to sampling artifacts, and tend to be more data efficient. Using inertial confinement fusion (ICF) as a test-bed problem, we model a one-dimensional semianalytic numerical simulator and demonstrate the effectiveness of our approach.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Constraints on OPF Surrogates for Learning Stable Local Volt/Var Controllers

We consider the problem of learning local Volt/Var controllers in distribution grids (DGs). Our approach starts from learning separable surrogates that take both local voltages and reactive powers as arguments and predict the reactive power setpoints that approximate optimal power flow (OPF) solutions. We propose an incremental control algorithm and identify two different sets of slope conditions on the local surrogates such that the network is collectively steered toward desired configurations asymptotically. Our results reveal the trade-offs between each set of conditions, with coupled voltage-power slope constraints allowing an arbitrary shape of surrogate functions but risking limitations on exploiting generation capabilities, and reactive power slope constraints taking full advantage of generation capabilities but constraining the shape of surrogate functions. AC power flow simulations on the IEEE 37-bus feeder illustrate their guaranteed stability properties and respective advantages in two DG scenarios.

asymptotic stability↗
DOE OSTI2023

Functionally discrete fine roots differ in microbial assembly, microbial functional potential, and produced metabolites

Traditionally, fine roots were grouped using arbitrary size categories, rarely capturing the heterogeneity in physiology, morphology and functionality among different fine root orders. Fine roots with different functional roles are rarely separated in microbiome-focused studies and may result in confounding microbial signals and host-filtering across different root microbiome compartments. Using a 26-year-old common garden, we sampled fine roots from four temperate tree species that varied in root morphology and sorted them into absorptive and transportive fine roots. The rhizoplane and rhizosphere were characterized using 16S rRNA gene and internal transcribed spacer region amplicon sequencing and shotgun metagenomics for the rhizoplane to identify potential microbial functions. Fine roots were subject to metabolomics to spatially characterize resource availability. Both fungi and bacteria differed according to root functional type. We observed additional differences between the bacterial rhizoplane and rhizosphere compartments for absorptive but not transportive fine roots. Rhizoplane bacteria, as well as the root metabolome and potential microbial functions, differed between absorptive and transportive fine roots, but not the rhizosphere bacteria. Functional differences were driven by sugar transport, peptidases and urea transport. Our data highlights the importance of root function when examining root-microbial relationships, emphasizing different host selective pressures imparted on different root microbiome compartments.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Extending Parsimonious Bayesian Inference

Parsimonious Bayesian inference is a theoretical framework for efficient data assimilation that seeks to balance increased consistency between predictions and training data against corresponding increases in model complexity. Within this framework, over-training is understood as optimization that encodes excessive information within model parameters while only achieving small improvements between predictions and training data. This project aims to develop practical methods of limiting excess model information during optimization. One key observation is that practical heuristics for parsimonious learning in high-dimensions must balance expressivity, i.e. the ability of the model to capture diverse predictions with only a few non-zero parameters, against discoverability, i.e. the ability to train the model with gradient-based optimization and drive parameters to low information states. As such, we developed logical activation functions that are able to adaptively approximate arbitrary truth tables that define Boolean logic operations within a probabilistic framework. These functions have demonstrated the ability to learn exclusive disjunction (XOR) and conditioned disjunction (if [condition] then [result_if_true] else [result_if_false]) within a single layer of a neural network. To efficiently exploit these activation functions to drive parsimonious learning required several other advances within the domain of variational inference. The most efficient form of complexity suppression is structured sparsification, driving most model parameters to zero while achieving the structural coherence among nonzeros needed for bandwidth reduction. Such models are not only far more efficient at suppressing information-theoretic complexity, they also reduce the other forms of complexity (computations, communication, storage, and the number of dependencies needed to evaluate predictions). Aiming to support enhanced sparsification, this project examined new approaches to high-dimensional variational inference that allow us to calibrate and control parameter uncertainty during optimization. By identifying which parameters can sustain sparsifying perturbations with little impact on prediction quality, we can develop better pruning strategies by framing them as approximate Bayesian inference. These advances also open paths to mitigate concerns with deploying advanced learning methods in resource-constrained environments, such as running models on power-limited or communication-limited devices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

FunDiff: diffusion models over function spaces for physics-informed generative modeling

Recent advances in generative modeling-particularly diffusion models and flow matching-have been widely used for synthesizing discrete data such as images and videos. However, adapting these models to physical applications remains challenging, as the quantities of interest are continuous functions governed by complex physical laws. To address this, we introduce FunDiff, an efficient and robust framework for generative modeling in function spaces. FunDiff combines a latent diffusion process with a function autoencoder architecture to handle input functions with varying discretizations, generates continuous functions that can be evaluated at arbitrary locations, and seamlessly incorporate physical priors. These priors are enforced through architectural constraints or physics-informed loss functions, ensuring that generated samples satisfy fundamental physical laws. We theoretically establish minimax optimality guarantees for density estimation in function spaces, demonstrating that diffusion-based estimators achieve optimal convergence rates under suitable regularity conditions. We further demonstrate the practical effectiveness of FunDiff across diverse applications in fluid dynamics and solid mechanics. Empirical results indicate that our method can generate physically consistent samples with high fidelity to the target distribution, and exhibit robustness to noisy and low-resolution data.

Wang, Sifan [Yale University, New Haven, CT (Unite↗
DOE OSTI2025

A resolution independent neural operator

The Deep operator network (DeepONet) is a powerful yet simple neural operator architecture that utilizes two deep neural networks to learn mappings between infinite-dimensional function spaces. This architecture is highly flexible, allowing the evaluation of the solution field at any location within the desired domain. However, it imposes a strict constraint on the input space, requiring all input functions to be discretized at the same locations; this limits its practical applications. Here, in this work, we introduce a general framework for operator learning from input–output data with arbitrary number and locations of sensors. This begins by introducing a resolution-independent DeepONet (RI-DeepONet), enabling it to handle input functions that are arbitrarily, but sufficiently finely, discretized. To this end, we propose two dictionary learning algorithms to adaptively learn a set of appropriate continuous basis functions, parameterized as implicit neural representations (INRs), from correlated signals defined on arbitrary point cloud data. These basis functions are then used to project arbitrary input function data as a point cloud onto an embedding space (i.e., a vector space of finite dimensions) with dimensionality equal to the dictionary size, which can be directly used by DeepONet without any architectural changes. In particular, we utilize sinusoidal representation networks (SIRENs) as trainable INR basis functions. The introduced dictionary learning algorithms are then used in a similar way to learn an appropriate dictionary of basis functions for the output function data, which defines a new neural operator architecture referred to as the R esolution I ndependent N eural O perator (RINO). In the RINO, the operator learning task simplifies to learning a mapping from the coefficients of input basis functions to the coefficients of output basis functions. We demonstrate the robustness and applicability of RINO in handling arbitrarily (but sufficiently richly) sampled input and output functions during both training and inference through several numerical examples.

Deep operator network (DeepONet)↗
DOE OSTI2024

Self‐Consistent Convolutional Density Functional Approximations: Application to Adsorption at Metal Surfaces

The exchange-correlation (XC) functional in density functional theory is used to approximate multi-electron interactions. A plethora of different functionals are available, but nearly all are based on the hierarchy of inputs commonly referred to as “Jacob's ladder.” This paper introduces an approach to construct XC functionals with inputs from convolutions of arbitrary kernels with the electron density, providing a route to move beyond Jacob's ladder. We derive the variational derivative of these functionals, showing consistency with the generalized gradient approximation (GGA), and provide equations for variational derivatives based on multipole features from convolutional kernels. A proof-of-concept functional, PBEq, which generalizes the PBEα framework with mathematical equation being a spatially-resolved function of the monopole of the electron density, is presented and implemented. It allows a single functional to use different GGAs at different spatial points in a system, while obeying PBE constraints. Analysis of the results underlines the importance of error cancellation and the XC potential in data-driven functional design. After testing on small molecules, bulk metals, and surface catalysts, the results indicate that this approach is a promising route to simultaneously optimize multiple properties of interest.

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

Generalized kinetic equation for tokamak plasma equilibrium distribution function

A generalised kinetic equation for the equilibrium distribution function in a finite beta, arbitrary tokamak plasma is derived. The equation is correct to second order in ρ/L (ρ is the particle Larmor radius and L is the system size). Resolving finite Larmor radius length scales with no restriction on the ratio of poloidal to total equilibrium magnetic field, B $\vartheta$ /B, it generalises the drift kinetic theory of [Hazeltine Phys. Plasmas 15 (1973) 77] to the limit of B $\vartheta$ /B ~ 1 (e.g. to ensure validity for spherical tokamaks). Two cases are considered. The first provides the equilibrium distribution function, consistent with the generalised gyrokinetic formalism of [Dudkovskaia et al. Plasma Phys. Control. Fusion 65 (2023) 045010], derived specifically to capture neoclassical equilibrium currents in gyrokinetic stability analyses in strong gradient regions. The second assumes short length scales in the direction perpendicular to the magnetic field, which can occur as a result of small coherent magnetic structures in the plasma, such as neoclassical tearing mode magnetic islands close to threshold. This then extends the drift island equations of [Dudkovskaia et al. Nucl. Fusion 63 (2023) 016020] for the plasma response to magnetic islands to a spherical tokamak plasma configuration. In conclusion, resolving ρ ~ ρ $\vartheta$ (or B $\vartheta$ ~ B), where ρ $\vartheta$ is the particle poloidal Larmor radius, is also expected to influence calculations of the magnetic island propagation frequency and the associated contributions to the island onset conditions.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Scattering equations in AdS: scalar correlators in arbitrary dimensions

We introduce a bosonic ambitwistor string theory in AdS space. Even though the theory is anomalous at the quantum level, one can nevertheless use it in the classical limit to derive a novel formula for correlation functions of boundary CFT operators in arbitrary space-time dimensions. The resulting construction can be treated as a natural extension of the CHY formalism for the flat-space S-matrix, as it similarly expresses tree-level amplitudes in AdS as integrals over the moduli space of Riemann spheres with punctures. These integrals localize on an operator-valued version of scattering equations, which we derive directly from the ambitwistor string action on a coset manifold. As a testing ground for this formalism we focus on the simplest case of ambitwistor string coupled to two cur- rent algebras, which gives bi-adjoint scalar correlators in AdS. In order to evaluate them directly, we make use of a series of contour deformations on the moduli space of punctured Riemann spheres and check that the result agrees with tree level Witten diagram computations to all multiplicity. We also initiate the study of eigenfunctions of scattering equations in AdS, which interpolate between conformal partial waves in different OPE channels, and point out a connection to an elliptic deformation of the Calogero-Sutherland model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗