Search NASA⌕ Search

SEARCH · Search NASA

Results for “FUNCTION SPACE”

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 19 records
All sourcesNASA NTRSDOE OSTI
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 OSTI2024

D2NO: Efficient handling of heterogeneous input function spaces with distributed deep neural operators

Neural operators have been applied in various scientific fields, such as solving parametric partial differential equations, dynamical systems with control, and inverse problems. However, challenges arise when dealing with input functions that exhibit heterogeneous properties, requiring multiple sensors to handle functions with minimal regularity. To address this issue, discretization-invariant neural operators have been used, allowing the sampling of diverse input functions with different sensor locations. However, existing frameworks still require an equal number of sensors for all functions. We propose a novel distributed approach to further relax the discretization requirements and solve the heterogeneous dataset challenges. Our method involves partitioning the input function space and processing individual input functions using independent and separate neural networks. A centralized neural network is used to handle shared information across all output functions. This distributed methodology reduces the number of gradient descent back-propagation steps, improving efficiency while maintaining accuracy. Here, we demonstrate that the corresponding neural network is a universal approximator of continuous nonlinear operators and present three numerical examples to validate its performance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Measuring Impact: Evaluating Thermal Zoning Simplification on Energy Efficiency Measures Analysis

Building Energy Modeling (BEM) is a versatile tool for designing, retrofitting, ensuring code compliance, obtaining certifications, qualifying for incentives, and enabling real-time building control. However, capturing all the details of building geometry for thermal zoning can be time-consuming, costly, and sometimes computationally challenging. As a result, modelers have been applying zoning simplification based on factors such as space functions and internal loads, as well as relying on their experience and judgment while adhering to zoning rules outlined in industry standards. Despite the prevalence of this common practice, a notable gap exists in the literature regarding studies quantifying the influence of simplified thermal zoning on the evaluation of Energy Efficiency Measures (EEMs). Recognizing this gap, this paper seeks to contribute to the field by enhancing the understanding of how the simplification of thermal zoning influences the evaluation of EEMs against a baseline design. The study utilized a medium office prototype model with a detailed floor plan featuring over 20 zones per floor covering diverse functional spaces with varying internal loads and occupancy schedules. A standard thermal zoning strategy outlined in ASHRAE Standard 90.1 Appendix G was employed as the simplified zoning method. This strategy condenses the zoning into a core zone and four perimeter zones per floor. It was compared with the detailed zoning approach, which involves one zone per space. Common Energy EEMs, such as enhanced envelope, high-efficiency appliances and equipment, and HVAC controls, were individually implemented and evaluated. The results indicate that the performance comparison between the two zoning methods varies depending on the type of measures considered. Basic measures, such as adding wall insulation, demonstrate similar energy impacts, while advanced HVAC control measures, such as static pressure reset, exhibit a more substantial difference that cannot be overlooked.

Xie, Jiarong↗
DOE OSTI2025

Random Phase Approximation Correlation Energy Using Real-Space Density Functional Perturbation Theory

We present a real-space method for computing the random phase approximation (RPA) correlation energy within Kohn–Sham density functional theory, leveraging the low-rank nature of the frequency-dependent density response operator. In particular, we employ a cubic-scaling formalism based on density functional perturbation theory that circumvents the calculation of the response function matrix, instead relying on the ability to compute its product with a vector through the solution of the associated Sternheimer linear systems. We develop a large-scale parallel implementation of this formalism using the subspace iteration method in conjunction with the spectral quadrature method while employing the Kronecker product-based method for the application of the Coulomb operator and the conjugate orthogonal conjugate gradient method for the solution of the linear systems. We demonstrate convergence with respect to key parameters and verify the method’s accuracy by comparing with plane-wave results. We show that the framework achieves good strong scaling to many thousands of processors, reducing the time to solution for a lithium hydride system with 128 electrons to around 150 s on 4608 processors.

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

Ultrastable Carboxyl–Functionalized Pore–Space–Partitioned Metal–Organic Frameworks for Gas Separation

Isoreticular chemistry, which enables property optimization by changing compositions without changing topology, is a powerful synthetic strategy. One of the biggest challenges facing isoreticular chemistry is to extend it to ligands with strongly coordinating substituent groups such as unbound –COOH, because competitive interactions between such groups and metal ions can derail isoreticular chemistry. It is even more challenging to have an isoreticular series of carboxyl-functionalized MOFs capable of encompassing chemically disparate metal ions. Furthermore, with the simultaneous introduction of carboxyl functionalization and pore space partition, a family of carboxyl-functionalized materials is developed in diverse compositions from homometallic Cr 3+ and Ni 2+ to heterometallic Co 2+ /V 3+ , Ni 2+ /V 3+ , Co 2+ /In 3+ , Co 2+ /Ni 2+ . Cr-MOFs remain highly crystalline in boiling water. Unprecedentedly, one Cr-MOF can withstand the treatment cycle with 10m NaOH and 12m HCl, allowing reversible inter-conversion between unbound –COOH acid form and –COO – base form. These materials exhibit excellent sorption properties such as high uptake capacity for CO 2 (100.2 cm 3 g –1 ) and hydrocarbon gases (e.g., 142.1 cm 3 g –1 for C 2 H 2 , 110.5 cm 3 g –1 for C 2 H 4 ) at 1 bar and 298K, high benzene/cyclohexane selectivity (up to ≈40), and promising separation performance for gas mixtures such as C 2 H 2 /CO 2 and C 2 H 2 /C 2 H 4 .

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

Velocity-space distribution function of fast ions in a sawtoothing plasma

This study explores the influence of sawtooth oscillations on the velocity space distribution of fast ions in tokamak plasma discharges. The relevant Fokker–Planck equation for fast ions is solved analytically. Two distinct effects arising from the temperature drop associated with a sawtooth crash and their impact on the distribution function of fast ions are considered. The first effect involves the modulation of the fusion alpha particle source on the timescale of the sawtooth period, linked to the drop in fusion yield resulting from the sawtooth temperature relaxations. The second effect is tied to the increase of the slowing-down time during the sawtooth ramp, causing particles born later in the sawtooth cycle to experience reduced slowing down compared to those born right after the crash, creating an accumulation-like mechanism at higher energies. In regimes where the sawtooth period is shorter than the fast ion slowing-down time, the combined influence of these effects gives rise to fast ion distribution functions that transiently exhibit positive slopes in velocity space.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
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 OSTI2026

A projection method for particle resampling

Particle discretizations of partial differential equations are advantageous for high-dimensional kinetic models in phase-space due to their better scalability than continuum approaches with respect to dimension. Complex processes collectively referred to as particle noise hamper long time simulations with particle methods. One approach to address this problem is particle mesh adaptivity, or remapping, known as particle resampling and remeshing. Here, this work introduces a resampling method that projects particles to and from a (finite element) function space. The method is simple, using standard sparse linear algebra and finite element techniques, and it preserves all moments up to the order of a polynomial represented exactly by the continuum function space. It is distinguished from most other mesh-based methods in that new particle positions and number are decoupled from the mesh, allowing particle and continuum meshes to be adapted relatively independently. While this work is developed with structured particle and continuum phase-space grids on 1X + 1V Vlasov-Poisson models of Landau damping and two-stream instability, the method is well-suited to unstructured grids. Stable long time dynamics are demonstrated up to time T = 500. Reproducibility artifacts and data are publicly available.

Kinetic methods↗
DOE OSTI2025

EMPDF : inferring the Milky Way mass with data-driven distribution function in phase space

We introduce the emPDF (empirical distribution function), a novel dynamical modelling method that infers the gravitational potential from kinematic tracers with optimal statistical efficiency under the minimal assumption of steady state. emPDF determines the best-fitting potential by maximizing the similarity between instantaneous kinematics and the time-averaged phase-space distribution function (DF), which is empirically constructed from observation upon the theoretical foundation of oPDF (Han et al. 2016). This approach eliminates the need for presumed functional forms of DFs or orbit libraries required by conventional DF- or orbit-based methods. emPDF stands out for its flexibility, efficiency, and capability in handling observational effects, making it preferable to the popular Jeans equation or other minimal assumption methods, especially for the Milky Way (MW) outer halo where tracers often have limited sample size and poor data quality. We apply emPDF to infer the MW mass profile using Gaia DR3 data of satellite galaxies and globular clusters, obtaining enclosed masses of M (,r) = 26±8, 46±8, 90±13⁠, and 149±40 x 10 10 M ⊙ at r = 30, 50, 100⁠, and 200 kpc, respectively. These are consistent with the updated constraints from simulation-informed DF fitting (Li et al. 2020). While the simulation-informed DF offers superior precision owing to the additional information extracted from simulations, emPDF is independent of such supplementary knowledge and applicable to general tracer populations. emPDF is currently implemented for tracers with complete 6D kinematics within spherical potentials, but it can potentially be extended to address more general problems.

Astrophysics of Galaxies (astro-ph.GA)↗
DOE OSTI2024

Improving the precision of forces in real-space pseudopotential density functional theory

The high-order finite difference real-space pseudopotential density functional theory (DFT) approach is a valuable method for large-scale, massively parallel DFT calculations. A significant challenge in the approach is the oscillating “egg-box” error introduced by aliasing associated with a coarse grid spacing. To address this issue while minimizing computational cost, we developed a finite difference interpolation (FDI) scheme [Roller et al., J. Chem. Theory Comput. 19, 3889 (2023)] as a means of exploiting the high resolution of the pseudopotential to reduce egg-box effects systematically. Here, we show an implementation of this method in the PARSEC code and examine the practical utility of the combination of FDI with additional methods for improving force precision and/or reducing its computational cost, including orbital-based forces, compensating charges (namely, adding and subtracting a judiciously chosen charge density such that the total density is unaltered), and a modified spatial domain in which the real-space grid is defined. Using selected small molecules, as well as metallic Li, as test cases, we show that a combination of all four aspects leads to a significant reduction in computational cost while retaining a high level of precision that supports accurate structures and vibrational spectra, as well as stable and accurate molecular dynamics runs.

Chemistry↗
DOE OSTI2025

Hyper Spectral Anomaly Detection

The HSA is a statistics based anomaly detection model. The model performs unsupervised anomaly detection, based on a datapoint's density and similarity within a dataset. Density and similarity data are encoded into an affinity matrix. The affinity matrix is evolved to summarize the data's structure on greater topographical scales within the data's function space. The set of evolved affinity matrices and an anomaly score vector are passed to a user defined penalized objective function. The penalized objective function of anomaly scores is then minimized. Data points where the absolute value of the z-scores of anomaly scores greater than a specified threshold are predicted as anomalies. A novel multi-filter feature has also been implemented. To reduce false positive rates, the multi-filter records the indexes of the HSA predictions. A new dataset and data loader are instantiated consisting of all the initial HSA predictions and non-anomalous data points in a 10% and 90% split respectively. The HSA is then run through this data set and a count of number of times a data point is predicted is kept. In this way the initial predictions may be compared with data spanning the entire dataset. After the multi-filter is complete, all datapoints will have an associated anomaly score, as well as a multi-filter prediction count to further filter the anomalous predictions.

Rogers, DempseyD [Idaho National Laboratory (INL),↗
DOE OSTI2025

The latent variable proximal point algorithm for variational problems with inequality constraints

The latent variable proximal point (LVPP) algorithm is a framework for solving infinite-dimensional variational problems with pointwise inequality constraints. The algorithm is a saddle point reformulation of the Bregman proximal point algorithm. At the continuous level, the two formulations are equivalent, but the saddle point formulation is more amenable to discretization because it introduces a structure-preserving transformation between a latent function space and the feasible set. Working in this latent space is much more convenient for enforcing inequality constraints than the feasible set, as discretizations can employ general linear combinations of suitable basis functions, and nonlinear solvers can involve general additive updates. LVPP yields numerical methods with observed mesh-independence for obstacle problems, contact, fracture, plasticity, and others besides; in many cases, for the first time. The framework also extends to more complex constraints, providing means to enforce convexity in the Monge–Ampère equation and handling quasi-variational inequalities, where the underlying constraint depends implicitly on the unknown solution. Here, in this paper, we describe the LVPP algorithm in a general form and apply it to ten problems from across mathematics.

Inequality constraints↗
DOE OSTI2026

Neural Scaling Laws of Deep ReLU and Deep Operator Network: A Theoretical Study

Neural scaling laws play a pivotal role in the performance of deep neural networks and have been observed in a wide range of tasks. However, a complete theoretical framework for understanding these scaling laws remains underdeveloped. In this paper, we explore the neural scaling laws for deep operator networks, which involve learning mappings between function spaces, with a focus on the Chen and Chen style architecture. These approaches, which include the popular Deep Operator Network (DeepONet), approximate the output functions using a linear combination of learnable basis functions and coefficients that depend on the input functions. We establish a theoretical framework to quantify the neural scaling laws by analyzing its approximation and generalization errors. We articulate the relationship between the approximation and generalization errors of deep operator networks and key factors such as network model size and training data size. Moreover, we address cases where input functions exhibit low-dimensional structures, allowing us to derive tighter error bounds. These results also hold for deep ReLU networks and other similar structures. Our results offer a partial explanation of the neural scaling laws in operator learning and provide a theoretical foundation for their applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Neural operators for stochastic modeling of nonlinear structural system response to natural hazards

Traditionally, neural networks have been employed to learn the mapping between finite-dimensional Euclidean spaces. However, recent research has opened up new horizons, focusing on the utilization of deep neural networks to learn operators capable of mapping infinite-dimensional function spaces. Here, in this work, we employ two state-of-the-art neural operators, the deep operator network (DeepONet) and the Fourier neural operator (FNO) for the prediction of the nonlinear time history response of structural systems exposed to natural hazards, such as earthquakes and windstorms. Specifically, we propose two architectures, a self-adaptive FNO and a fast Fourier transform-based DeepONet (DeepFNOnet), where we employ a FNO beyond the DeepONet to learn the discrepancy between the ground truth and the solution predicted by the DeepONet. To demonstrate the efficiency and applicability of the architectures, two problems are considered. In the first, we use the proposed model to predict the seismic nonlinear dynamic response of a six-story shear building subject to stochastic ground motions. In the second problem, we employ the operators to predict the wind-induced nonlinear dynamic response of a high-rise building while explicitly accounting for the stochastic nature of the wind excitation. In both cases, the trained metamodels achieve high accuracy while being orders of magnitude faster than their corresponding high-fidelity models.

DeepONet↗
DOE OSTI2024

Learning the boundary-to-domain mapping using Lifting Product Fourier Neural Operators for partial differential equations

Neural operators such as the Fourier Neural Operator (FNO) have been shown to provide resolution-independent deep learning models that can learn mappings between function spaces. For example, an initial condition can be mapped to the solution of a partial differential equation (PDE) at a future time-step using a neural operator. Despite the popularity of neural operators, their use to predict solution functions over a domain given only data over the boundary (such as a spatially varying Dirichlet boundary condition) remains unexplored. In this paper, we refer to such problems as boundary-to-domain problems; they have a wide range of applications in areas such as fluid mechanics, solid mechanics, heat transfer etc. We present a novel FNO-based architecture, named Lifting Product FNO (or LP-FNO) which can map arbitrary boundary functions defined on the lower-dimensional boundary to a solution in the entire domain. Specifically, two FNOs defined on the lower-dimensional boundary are lifted into the higher dimensional domain using our proposed lifting product layer. We demonstrate the efficacy and resolution independence of the proposed LP-FNO for the 2D Poisson equation.

Kashi, Aditya↗
DOE OSTI2024

Three-point energy correlators in hadronic Higgs boson decays

We present the analytic calculation of the leading-order three-point energy correlator (EEEC) in hadronic Higgs decays, including both the gluon-initiated channel H → g g + X and quark-initiated channel H → q q ¯ + X . The phase-space integration is evaluated directly using Mandelstam variables s i j = ( p i + p j ) 2 , and the appearing square roots can be rationalized by either conformal ratios or celestial coordinate variables. Throughout the calculation, we observe the same transcendental function space as in N = 4 super–Yang-Mills theory and e + e − → hadrons . Different infrared limits are also explored using the full analytic result, offering the fixed-order data for EEEC factorization and resummation. Given its nontrivial shape dependence, the EEEC presents an excellent opportunity to explore the dynamics of gluon jets originating from the H → g g decay channel at future lepton colliders. Published by the American Physical Society 2024

Astronomy & Astrophysics↗
DOE OSTI2025

Efficient Training of Deep Neural Operator Networks via Randomized Sampling

Neural operators (NOs) employ deep neural networks to learn the mappings between infinitedimensional function spaces. Deep operator network (DeepONet), a popular NO architecture, has demonstrated success in the real-time prediction of complex dynamics across various scientific and engineering applications. In this work, we introduce a random sampling technique to be adopted during the training of DeepONet, aimed at improving the generalization ability of the model, while significantly reducing the computational time. The proposed approach targets the trunk network of the DeepONet model that outputs the basis functions corresponding to the spatiotemporal locations of the bounded domain on which the physical system is defined. While constructing the loss function, DeepONet training traditionally considers a uniform grid of spatiotemporal points at which all the output functions are evaluated for each iteration. This approach leads to a larger batch size, resulting in poor generalization and increased memory demands, due to the limitations of the stochastic gradient descent (SGD) optimizer. The proposed random sampling over the inputs of the trunk net mitigates these challenges, improving generalization and reducing the memory requirements during training, resulting in significant computational gains. We validate our hypothesis through three benchmark examples, demonstrating substantial reductions in training time while achieving comparable or lower overall test errors relative to the traditional training approach. Our results indicate that incorporating randomization in the trunk network inputs during training enhances the efficiency and robustness of DeepONet, offering a promising avenue for improving the framework’s performance in modeling complex physical systems.

Karumuri, Sharmila [Department of Civil & Systems ↗