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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS1973

An historical survey of computational methods in optimal control.

Review of some of the salient theoretical developments in the specific area of optimal control algorithms. The first algorithms for optimal control were aimed at unconstrained problems and were derived by using first- and second-variation methods of the calculus of variations. These methods have subsequently been recognized as gradient, Newton-Raphson, or Gauss-Newton methods in function space. A much more recent addition to the arsenal of unconstrained optimal control algorithms are several variations of conjugate-gradient methods. At first, constrained optimal control problems could only be solved by exterior penalty function methods. Later algorithms specifically designed for constrained problems have appeared. Among these are methods for solving the unconstrained linear quadratic regulator problem, as well as certain constrained minimum-time and minimum-energy problems. Differential-dynamic programming was developed from dynamic programming considerations. The conditional-gradient method, the gradient-projection method, and a couple of feasible directions methods were obtained as extensions or adaptations of related algorithms for finite-dimensional problems. Finally, the so-called epsilon-methods combine the Ritz method with penalty function techniques.

Polak, E.↗
NASA NTRS2000

Retrieving the Balanced Winds on the Globe as a Generalized Inverse Problem

A generalized inverse technique is applied to retrieve two types of balanced winds that characterize the large-scale dynamics of the atmosphere: rotational winds based upon the linear balance equation, and divergent winds based upon the vorticity budget equation. Both balance equations are singular at or near the equator. The balance equations are transformed in spherical harmonic function space to an under-determined system, for which the scale-weighed least-squares solution consists of a sum of principal and singular components. The principal components represent the response to the source function for the regular eigenmodes, while the singular components are determined by the projection of an independent measurement on the singular eigenmodes. The method was tested with the NCEP/NCAR reanalysis data in which a quasi-balance condition exists. A realistic balanced wind field is retrievable when the singular components are computed based upon the reanalyzed wind data.

Lu, Huei-Iin↗
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↗
NASA NTRS1983

Investigation of the feasibility of temperature profiling optical diagnostics in the SSME fuel pre-burner

Results of an analytical investigation to determine the feasibility of temperature profiling in the space shuttle main engine (SSME) fuel preburner are presented. In this application it is desirable to measure temperature in the preburner combustor with a remote, nonintrusive optical technique. Several techniques using laser excitation were examined with a consideration of the constraints imposed by optical access in the fuel preburner and the problems associated with operation near the functioning space shuttle engine. The potential performance of practical diagnostic systems based on spontaneous Raman backscattering, laser induced fluorescence, and coherent anti-Stokes Raman spectroscopy were compared analytically. A system using collection of spontaneous Raman backscattering excited by a remotely located 5 to 10 watt laser propagated to the SSME through a small diameter optical fiber was selected as the best approach. Difficulties normally associated with Raman scattering: weak signal strength and interference due to background radiation are not expected to be problematic due to the very high density in this application, and the low flame luminosity expected in the fuel rich hydrogen oxygen flame.

Shirley, J. A.↗
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 ↗
DOE OSTI2024

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Two-loop master integrals for leading-color $$ pp\to t\overline{t}H $$ amplitudes with a light-quark loop

Abstract We compute the two-loop master integrals for leading-color QCD scattering amplitudes including a closed light-quark loop in$$ t\overline{t}H $$ t t ¯ H production at hadron colliders. Exploiting numerical evaluations in modular arithmetic, we construct a basis of master integrals satisfying a system of differential equations inϵ-factorized form. We present the analytic form of the differential equations in terms of a minimal set of differential one-forms. We explore properties of the function space of analytic solutions to the differential equations in terms of iterative integrals which can be exploited for studying the analytic form of related scattering amplitudes. Finally, we solve the differential equations using generalized series expansions to numerically evaluate the master integrals in physical phase space. As the first computation of a set of two-loop seven-scale master integrals, our results provide valuable input for analytic studies of scattering amplitudes in processes involving massive particles and a large number of kinematic scales.

Physics↗
DOE OSTI2024

Generalization error guaranteed auto-encoder-based nonlinear model reduction for operator learning

Many physical processes in science and engineering are naturally represented by operators between infinite-dimensional function spaces. The problem of operator learning, in this context, seeks to extract these physical processes from empirical data, which is challenging due to the infinite or high dimensionality of data. An integral component in addressing this challenge is model reduction, which reduces both the data dimensionality and problem size. In this paper, we utilize low-dimensional nonlinear structures in model reduction by investigating Auto-Encoder-based Neural Network (AENet). AENet first learns the latent variables of the input data and then learns the transformation from these latent variables to corresponding output data. Our numerical experiments validate the ability of AENet to accurately learn the solution operator of nonlinear partial differential equations. Furthermore, we establish a mathematical and statistical estimation theory that analyzes the generalization error of AENet. Finally, our theoretical framework shows that the sample complexity of training AENet is intricately tied to the intrinsic dimension of the modeled process, while also demonstrating the robustness of AENet to noise.

Auto-encoder↗
DOE OSTI2026

Complementary effects of supplemental feeding and straw retention on winter biodiversity in rice agroecosystems

Rice paddies are both major food-production systems and critical winter habitats for wildlife. In the Civilian Control Zone (CCZ) adjoining the Korean Demilitarized Zone (DMZ), post-harvest interventions such as supplementary grain feeding and straw retention are promoted through agronomic and conservation incentives. These measures differ in ecological scope: feeding provides direct, concentrated energetic subsidies, whereas straw management alters habitat structure and resource bases. We clarified whether these pathways function in complementary or substitutive ways to support resilient, long-term conservation strategies in rice agroecosystems. Using camera traps, we evaluated the effects of three straw treatments (chopped-straw, whole-straw, straw-removed) and supplemental feeding on winter bird and mammal communities across 48 rice fields in the CCZ. Our results demonstrate that feeding produced strong, localized increases in bird abundance and richness, driven mainly by cranes (Grus japonensis and Antigone vipio) and geese (Anser spp.), with limited effects on Shannon diversity or functional structure. Among non-feeding fields, chopped-straw paddies consistently supported higher richness and Shannon diversity than whole-straw or straw-removed fields, while centroid shifts in taxonomic and functional space were modest. Mammal abundance and diversity were largely insensitive to feeding or straw regimes, varying instead with road and forest distance and regional context. Supplemental feeding and straw retention are therefore not interchangeable tools: feeding concentrates a few avian guilds, whereas chopped-straw retention enhances baseline diversity across farmland. Collectively, our findings suggest integrating low-input straw retention with targeted feeding offers a more robust pathway for sustaining winter biodiversity in rice agroecosystems.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2024

Separable physics-informed DeepONet: Breaking the curse of dimensionality in physics-informed machine learning

The deep operator network (DeepONet) has shown remarkable potential in solving partial differential equations (PDEs) by mapping between infinite-dimensional function spaces using labeled datasets. However, in scenarios lacking labeled data, the physics-informed DeepONet (PI-DeepONet) approach, which utilizes the residual loss of the governing PDE to optimize the network parameters, faces significant computational challenges, particularly due to the curse of dimensionality. This limitation has hindered its application to high-dimensional problems, making even standard 3D spatial with 1D temporal problems computationally prohibitive. Additionally, the computational requirement increases exponentially with the discretization density of the domain. Here, to address these challenges and enhance scalability for high-dimensional PDEs, we introduce the Separable physics-informed DeepONet (Sep-PI-DeepONet). This framework employs a factorization technique, utilizing sub-networks for individual one-dimensional coordinates, thereby reducing the number of forward passes and the size of the Jacobian matrix required for gradient computations. By incorporating forward-mode automatic differentiation (AD), we further optimize computational efficiency, achieving linear scaling of computational cost with discretization density and dimensionality, making our approach highly suitable for high-dimensional PDEs. We demonstrate the effectiveness of Sep-PI-DeepONet through three benchmark PDE models: the viscous Burgers’ equation, Biot’s consolidation theory, and a parameterized heat equation. Our framework maintains accuracy comparable to the conventional PI-DeepONet while reducing training time by two orders of magnitude. Notably, for the heat equation solved as a 4D problem, the conventional PI-DeepONet was computationally infeasible (estimated 289.35 h), while the Sep-PI-DeepONet completed training in just 2.5 h. These results underscore the potential of Sep-PI-DeepONet in efficiently solving complex, high-dimensional PDEs, marking a significant advancement in physics-informed machine learning.

Neural operator↗
DOE OSTI2025

Real-time inference and extrapolation with Time-Conditioned UNet: Applications in hypersonic flows, incompressible flows, and global temperature forecasting

Neural Operators are fast and accurate surrogates for nonlinear mappings between functional spaces within training domains. Extrapolation beyond the training domain remains a grand challenge across all application areas. We present Time-Conditioned UNet (TC-UNet) as an operator learning method to solve time-dependent PDEs continuously in time without any temporal discretization, including in extrapolation scenarios. TC-UNet incorporates the temporal evolution of the PDE into its architecture by combining a parameter conditioning approach with the attention mechanism from the Transformer architecture. After training, TC-UNet makes real-time inferences on an arbitrary temporal grid. We demonstrate its extrapolation capability on a climate problem by estimating the global temperature for several years and also for inviscid hypersonic flow around a double cone. We propose different training strategies involving temporal bundling and sub-sampling. We demonstrate performance improvements for several benchmarks, performing extrapolation for long time intervals and zero-shot super-resolution time.

Deep learning↗
DOE OSTI2025

Physics-informed latent neural operator for real-time predictions of time-dependent parametric PDEs

Deep operator network (DeepONet) has shown significant promise as surrogate models for systems governed by partial differential equations (PDEs), enabling accurate mappings between infinite-dimensional function spaces. However, when applied to systems with high-dimensional input-output mappings arising from large numbers of spatial and temporal collocation points, these models often require heavily overparameterized networks, leading to long training times. Latent DeepONet addresses some of these challenges by introducing a two-step approach: first learning a reduced latent space using a separate model, followed by operator learning within this latent space. While efficient, this method is inherently data-driven and lacks mechanisms for incorporating physical laws, limiting its robustness and generalizability in data-scarce settings. Here, in this work, we propose PI-Latent-NO, a physics-informed latent neural operator framework that integrates governing physics directly into the learning process. Our architecture features two coupled DeepONets trained end-to-end: a Latent-DeepONet that learns a low-dimensional representation of the solution, and a Reconstruction-DeepONet that maps this latent representation back to the physical space. By embedding PDE constraints into the training via automatic differentiation, our method eliminates the need for labeled training data and ensures physics-consistent predictions. The proposed framework is both memory and compute-efficient, exhibiting near-constant scaling with problem size and demonstrating significant speedups over traditional physics-informed operator models. We validate our approach on a range of parametric PDEs, showcasing its accuracy, scalability, and suitability for real-time prediction in complex physical systems.

Latent representations↗
DOE OSTI2025

Uncertainty propagation in feed-forward neural network models

We develop new uncertainty propagation methods for feed-forward neural network architectures with leaky ReLU activation functions subject to random perturbations in the input vectors. In particular, we derive analytical expressions for the probability density function (PDF) of the neural network output and its statistical moments as a function of the input uncertainty and the parameters of the network, i.e., weights and biases. A key finding is that an appropriate linearization of the leaky ReLU activation function yields accurate statistical results even for large perturbations in the input vectors. This can be attributed to the way information propagates through the network. We also propose new analytically tractable Gaussian copula surrogate models to approximate the full joint PDF of the neural network output. To validate our theoretical results, we conduct Monte Carlo simulations and a thorough error analysis on a multi-layer neural network representing a nonlinear integro-differential operator between two polynomial function spaces. Our findings demonstrate excellent agreement between the theoretical predictions and Monte Carlo simulations.

MLP networks↗
DOE OSTI2024

Characterization of switchgrass ( Panicum virgatum L.) PvKSL1 as a levopimaradiene/abietadiene‐type diterpene synthase

Abstract The diverse class of plant diterpenoid metabolites serves important functions in mediating growth, chemical defence, and ecological adaptation. In major monocot crops, such as maize (Zea mays), rice (Oryza sativa), and barley (Hordeum vulgare), diterpenoids function as core components of biotic and abiotic stress resilience. Switchgrass (Panicum virgatum) is a perennial grass valued as a stress‐resilient biofuel model crop. Previously we identified an unusually large diterpene synthase family that produces both common and species‐specific diterpenoids, several of which accumulate in response to abiotic stress. Here, we report discovery and functional characterization of a previously unrecognized monofunctional class I diterpene synthase (PvKSL1) viain vivoco‐expression assays with different copalyl pyrophosphate (CPP) isomers, structural and mutagenesis studies, as well as genomic and transcriptomic analyses. In particular, PvKSL1 convertsent‐CPP intoent‐abietadiene,ent‐palustradiene,ent‐levopimaradiene, andent‐neoabietadiene via a 13‐hydroxy‐8(14)‐ent‐abietene intermediate. Notably, although featuring a distinctent‐stereochemistry, this product profile is near‐identical to bifunctional (+)‐levopimaradiene/abietadiene synthases occurring in conifer trees. PvKSL1 has three of four active site residues previously shown to control (+)‐levopimaradiene/abietadiene synthase catalytic specificity. However, mutagenesis studies suggest a distinct catalytic mechanism in PvKSL1. Genome localization ofPvKSL1distant from other diterpene synthases, and its phylogenetic distinctiveness from known abietane‐forming diterpene synthases, support an independent evolution of PvKSL1 activity. Albeit at low levels,PvKSL1gene expression predominantly in roots suggests a role of diterpenoid formation in belowground tissue. Together, these findings expand the known chemical and functional space of diterpenoid metabolism in monocot crops.

Plant Sciences↗
DOE OSTI2025

Estimating Eigenenergies from Quantum Dynamics: A Unified Noise-Resilient Measurement-Driven Approach

Ground state energy estimation in physical, chemical, and materials sciences is one of the most promising applications of quantum computing. In this work, we introduce a new hybrid approach that finds the eigenenergies by collecting real-time measurements and post-processing them using the machinery of dynamic mode decomposition (DMD). From the perspective of quantum dynamics, we establish that our approach can be formally understood as a stable variational method on the function space of observables available from a quantum many-body system. We also provide strong theoretical and numerical evidence that our method converges rapidly even in the presence of a large degree of perturbative noise, and show that the method bears an isomorphism to robust matrix factorization methods developed independently across various scientific communities. Our numerical benchmarks on spin and molecular systems demonstrate an accelerated convergence and a favorable resource reduction over state-of-the-art algorithms. The DMD-centric strategy can systematically mitigate noise and stands out as a leading hybrid quantum-classical eigensolver.

Shen, Yizhi↗