Search NASA⌕ Search

SEARCH · Search NASA

Results for “approximation”

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Developing a Control Strategy for Minimum Airflow Setting Considering CO2 Level and Energy Consumption in a Variable Air Volume System

In an office building equipped with a Variable Air Volume (VAV) system, this paper introduces a novel method for controlling the minimum supply airflow fraction in each zone’s VAV box, having a capability to consider indoor CO2 level and energy consumption. The EnergyPlus simulation using the medium office prototype model was employed, which evaluated the performance of the energy and CO2 concentration for five VAV box airflow control strategies. The paper focuses on CO2 concentration-based airflow control method and compares it with other four methods including conventional single-max, reduced minimum single-max, demand-controlled ventilation(DCV), and dualmax control methods according to guidelines and common practices. The newly proposed control strategy directly correlates the minimum airflow fraction to CO2 concentration. A general trend emerged when comparing CO2 concentrations—lower minimum airflow fractions were associated with higher concentrations. The proposed control method effectively maintained low CO2 concentrations and enabled a lower airflow fraction contributing to energy consumption reduction. It was confirmed that heating energy consumption in climate zone 4A, 5B, and 6A showed a maximum saving of approximately 30% compared to the conventional single-max and dual max control strategies. It was found that cooling energy consumption in climate zone 4A and 6A can achieve a maximum saving of approximately 10% compared to the conventional control strategies. The proposed CO2 concentration-based control logic is promising as it not only improves the indoor air quality lowering the CO2 concentration in the occupied spaces, but also contributes to HVAC energy savings.

Lee, Jong Man↗
DOE OSTI2025

Optimizing qubit control pulses for state preparation

In the burgeoning field of quantum computing, the precise design and optimization of quantum pulses are essential for enhancing qubit operation fidelity. This study focuses on refining the pulse engineering techniques for superconducting qubits, employing a detailed analysis of square and Gaussian pulse envelopes under various approximation schemes. We evaluated the effects of coherent errors induced by naive pulse designs. Furthermore, we identified the sources of these errors in the Hamiltonian model’s approximation level. We mitigated these errors through adjustments to the external driving frequency and pulse durations, thus implementing a pulse scheme with stroboscopic error reduction. Our results demonstrate that these refined pulse strategies improve performance and reduce coherent errors. Moreover, the techniques developed herein are applicable across different quantum architectures, such as ion-trap, atomic, and photonic systems.

Chirp modulation↗
DOE OSTI2025

Dynamic Strength and Equation of State of Epon 828 and Diethanolamine (DEA) Polymer Epoxy Under Shock Loading

Polymers are increasingly utilized in engineering applications that can experience high loading rates, necessitating increased understanding of their response under such conditions. The tamped Richtmyer-Meshkov Instability (RMI) method was used to characterize the equation of state and dynamic strength of the polymer Epon 828 cured with Diethanolamine (DEA). Plate impact experiments that drove a uniaxial shock compression wave across a sinusoidally corrugated metal-polymer interface were performed to generate shock stresses from 4-12 GPa and strain rates of approximately 1/s in the polymer. X-ray phase contrast imaging recorded the shock motion in the polymer and subsequent interface evolution. Analysis of this data yielded the polymer equation of state and, in conjunction with numerical modeling, the dynamic strength. The equation of state was validated against one-dimensional plate impact experiments from existing literature. The dynamic strength was compared to prior data for Epon 828 and related polymers at lower strain rates and found to exhibit significant strain rate and pressure-hardening effects. The strength of the Epon 828 polymer at 10 6 1/s was found to be approximately 1.5 GPa, suggesting that it is comparable to the strength of high strength metals at these dynamic conditions.

Equation of state↗
DOE OSTI2025

Leveraging operator learning to accelerate convergence of the preconditioned conjugate gradient method

We propose a new deflation strategy to accelerate the convergence of the preconditioned conjugate gradient (PCG) method for solving parametric large-scale linear systems of equations. Unlike traditional deflation techniques that rely on eigenvector approximations or recycled Krylov subspaces, we generate the deflation subspaces using operator learning, specifically the Deep Operator Network (DeepONet). To this aim, we introduce two complementary approaches for assembling the deflation operators. The first approach approximates near-null space vectors of the discrete PDE operator using the basis functions learned by the DeepONet. The second approach directly leverages solutions predicted by the DeepONet. To further enhance convergence, we also propose several strategies for prescribing the sparsity pattern of the deflation operator. Here, a comprehensive set of numerical experiments encompassing steady-state, time-dependent, scalar, and vector-valued problems posed on both structured and unstructured geometries is presented and demonstrates the effectiveness of the proposed DeepONet-based deflated PCG method, as well as its generalization across a wide range of model parameters and problem resolutions.

Deflation↗
DOE OSTI2025

Projection-based multifidelity linear regression for data-scarce applications

Surrogate modeling for systems with high-dimensional quantities of interest remains challenging, particularly when training data are costly to acquire. This work develops multifidelity methods for multiple-input multiple-output linear regression targeting data-limited applications with high-dimensional outputs. Multifidelity methods integrate many inexpensive low-fidelity model evaluations with limited, costly high-fidelity evaluations. We introduce two projection-based multifidelity linear regression approaches with linear and nonlinear features that leverage principal component basis vectors for dimensionality reduction and combine multifidelity data through: (i) a direct data augmentation using low-fidelity data, and (ii) a data augmentation incorporating explicit linear corrections between low-fidelity and high-fidelity data. The data augmentation approaches combine high-fidelity and low-fidelity data into a unified training set and train the linear regression model through weighted least squares with fidelity-specific weights. We introduce a proximity-based weighting scheme with automatic weight selection strategy through cross-validation. Here, the proposed multifidelity linear regression methods are demonstrated on approximating the surface pressure field of a hypersonic vehicle in flight and the temperature field on an aircraft disc braking system. In an ultra low-data regime of no more than twelve high-fidelity samples, multifidelity linear regression achieves approximately 2% – 12% improvement in median accuracy and a higher R 2 score relative to single-fidelity methods at comparable computational cost.

data augmentation↗
DOE OSTI2025

A note on the reliability of goal-oriented error estimates for Galerkin finite element methods with nonlinear functionals

Here, we consider estimating the discretization error in a nonlinear functional J (u) in the setting of an abstract variational problem: find u ϵ $\mathscr{V}$ such that B (u, φ) = L (φ) ∀φ ϵ $\mathscr{V}$, as approximated by a Galerkin finite element method. Here, $\mathscr{V}$ is a Hilbert space, B (. , .) is a bilinear form, and L (∙) is a linear functional. We consider well-known error estimates η of the form J (u) - J (u h ) ≈ η = L (z) - B (u h , z), where u h denotes a finite element approximation to u, and z denotes the solution to an auxiliary adjoint variational problem. We show that there exist nonlinear functionals for which error estimates of this form are not reliable, even in the presence of an exact adjoint solution z. An estimate η is said to be reliable if there exists a constant C ϵ $\mathbb{R}$ >0 independent of u h such that |J (u) - J (u h )| ≤ C|η|. We present several example pairs of bilinear forms and nonlinear functionals where reliability of η is not achieved.

A posteriori↗
DOE OSTI2024

A new 181 Ta neutron resolved resonance region evaluation

A new 181 Ta neutron resolved resonance region evaluation has been performed from the thermal energy range up to approximately 2.5 keV. The R-matrix SAMMY code was used with the Reich–Moore approximation to evaluate resonance parameters from several experimental data sets. A Monte Carlo approach was used for resonance spin assignments and generating 59 small fictitious resonance levels which were shown to improve the cumulative level, Porter-Thomas, and Wigner distributions as compared to theoretical predictions. Covariance information was also generated for the entire resolved resonance region. Finally, the positive impact of the new evaluation was validated through benchmark calculations which were sensitive to the 181 Ta cross section and showed improvement in the reactivity bias for several benchmark cases.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2024

Griffin: A MOOSE-based reactor physics application for multiphysics simulation of advanced nuclear reactors

Griffin is a Multiphysics Object-Oriented Simulation Environment (MOOSE) based reactor physics application for multiphysics simulations of advanced reactor designs jointly developed by Idaho National Laboratory and Argonne National Laboratory. This paper summarizes the motivation, significance, architecture, design, and features of Griffin. Griffin offers flexible and extensible features to address the challenges associated with advanced reactor designs. These features range from fundamental particle transport to specific reactor physics tasks. The features cover a wide range including on-the-fly and traditional two-step cross-section generation methods, steady-state and transient transport solvers suitable for both heterogeneous and homogeneous models, high-fidelity depletion where thousands of isotopes can be tracked and low-fidelity depletion characterized by burnup, etc. The most fundamental aspect that sets Griffin apart from other reactor analysis codes is that it is developed based on the MOOSE framework. A modular development approach is strongly enforced, with multiphysics being an essential element considered since the beginning of Griffin’s development. Griffin links various MOOSE physics modules and couples to other MOOSE-based applications and non-MOOSE-based applications for multiphyiscs simulations. Griffin includes three modules: ISOXML for preparing and managing multigroup cross sections, radiation transport for solving the neutron transport equation, and reactor analysis for user-oriented reactor physics analysis functionalities. Griffin uses various finite element methods for spatial discretization, multigroup approximation for energy discretization and discrete ordinates method, spherical harmonics expansion method, and diffusion approximation for streaming direction discretization to solve the neutron transport equation. Griffin’s flexibility is evidenced through Griffin’s various applications to fast reactor, high-temperature reactor, pebble bed reactor, molten salt reactor, and microreactor designs. Griffin development follows the software quality assurance procedure for MOOSE-based applications and with software requirements consistent with the ASME NQA-1 standard. Griffin has been adopted into the reactor analysis system for the U.S. NRC and is in use at U.S. companies, universities and national laboratories.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Design-informed neutronics assessment of long-lived fission product transmutation in a tokamak fusion reactor blanket

This study presents a neutronics-based assessment of the feasibility and viability of transmuting six major long-lived fission products (LLFPs) from light-water reactors, namely 99 Tc, 129 I, 79 Se, 93 Zr, 126 Sn, and 135 Cs, within the blanket region of a tokamak fusion reactor, using the MIT ARC design as a concrete fusion configuration. Monte Carlo neutronics simulations were performed to evaluate LLFP transmutation and to compare the results with a reference boiling water reactor (BWR). The results indicate that transmutation of all six LLFPs is neutronics-feasible in fusion reactors, with transmutation half-lives significantly shorter than their natural decay half-lives. For elemental targets, transmutation of 135 Cs, 126 Sn, and 93 Zr was found potentially viable, as the net mass transmuted exceeded that achievable in the reference BWR under identical target volume and irradiation time. When isotopically separated targets were considered, transmutation of 126 Sn and 93 Zr appeared potentially viable. A parametric study demonstrated that plasma geometry modifications can enhance local neutron flux, increasing the transmuted 93 Zr mass by approximately 33% and reducing the transmutation half-life from approximately 240 years to 180 years. Repositioning the target and adjusting material layer thickness reduced the transmutation half-life of 93 Zr to 67 years and increased the net mass transmuted by a factor of 50. Furthermore, these results demonstrate that fusion reactors can enable LLFP transmutation beyond the practical limits of thermal fission reactors and highlight the critical role of reactor and blanket design optimization. Engineering and fuel-cycle considerations required for deployment are beyond the scope of this neutronics-focused study.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Comparative techno-economic and environmental analysis of using nuclear energy and fossil energy with carbon sequestration in U.S. Gulf Coast petroleum refineries

U.S. Gulf Coast refineries have processing capacity of approximately 9.4 million barrels of crude oil per day—about 50% of U.S. national capacity—while consuming natural gas, electricity, and hydrogen, resulting in approximately 100 million metric tonnes (MMT) of onsite CO₂ emissions in 2022. This study evaluates two alternative refinery energy supply pathways: nuclear energy (NE) and fossil energy-derived hydrogen with carbon capture and sequestration (FE-CCS; autothermal reforming), intermittent renewable sources are not considered as they cannot reliably meet continuous industrial heat and hydrogen demands. Using publicly available data for refineries, we conducted a bottom-up, facility-level assessment to estimate energy use by type, well-to-gate refinery emissions, and associated costs of integration. Compared to current refinery operations using natural gas energy supply and conventional hydrogen production (steam methane reforming without sequestration), NE and FE-CCS could produce, respectively, average emissions reductions of 37% and 42%, total abatement costs of $\$$52–$\$$221 and $\$$211–$\$$612/MT CO₂, and additional costs of about $\$$0.2–$\$$6 and $\$$3–$\$$11 per barrel of crude, respectively. Our analysis indicates that 25 out of 27 refineries have lower total additional cost ($\$$/bbl.) for the NE scenario than the FE-CCS scenario, making a strong case for NE integration with petroleum refineries. This work's main contribution is a detailed bottom-up refinery-level analysis method that can be utilized by the worldwide refining industry and stakeholders as they assess different technological options, along with their costs and environmental impacts for a specific refinery operation.

Carbon capture and sequestration↗
DOE OSTI2025

Efficient shallow Ritz method for 1D diffusion problems

This paper studies the shallow Ritz method for solving the one-dimensional diffusion problem. It is shown that the shallow Ritz method improves the order of approximation dramatically for non-smooth problems. To realize this optimal or nearly optimal order of the shallow Ritz approximation, we develop a damped block Newton (dBN) method that alternates between updates of the linear and non-linear parameters. Per each iteration, the linear and the non-linear parameters are updated by exact inversion and one step of a modified, damped Newton method applied to a reduced non-linear system, respectively. The computational cost of each dBN iteration is $\mathcal{O}$(n). Starting with the non-linear parameters as a uniform partition of the interval, numerical experiments show that the dBN is capable of efficiently moving mesh points to nearly optimal locations. In conclusion, to improve the efficiency of the dBN further, we propose an adaptive damped block Newton (AdBN) method by combining the dBN with the adaptive neuron enhancement (ANE) method [28].

Diffusion problems↗
DOE OSTI2024

Resonant Raman in armchair graphene nanoribbons from first-principles

Resonant Raman spectra of armchair graphene nanoribbons (AGNRs) are computed using Density Functional Theory (DFT) and third-order perturbation theory. Results are benchmarked against available experimental data and compared to previously used theoretical approaches based on the Placzek approximation. Comparable agreement with experiments is found for both previously and presently used methods. In addition, a numerical analysis is carried out to provide a justification for the resonant modeling method based on the use of the frequency-dependent dielectric tensor in the Placzek approximation. Finally, this work also provides additional predictions and references for wide AGNRs that might be investigated with Raman scattering experiments in the future.

42 ENGINEERING↗
DOE OSTI2024

Interface PINNs (I-PINNs): A physics-informed neural networks framework for interface problems

Here, we present a novel physics-informed neural networks (PINNs) framework for modeling interface problems, termed Interface PINNs (I-PINNs). I-PINNs uses different neural networks for any two subdomains separated by a sharp interface such that the neural networks differ only through their activation functions while the other parameters remain identical. The performance of I-PINNs, conventional PINNs, and other existing domain-decomposition PINNs methods such as extended PINNs (XPINNs) and multi-domain PINN (M-PINN) is compared through several one-dimensional, two-dimensional, and three-dimensional benchmark elliptic interface problems. The results demonstrate that I-PINNs provides a root-mean-square-error accuracy, at least two orders of magnitude better than conventional PINNs and XPINNs at approximately one-tenth of the computational cost of conventional PINNs and half the cost of XPINNs. Additionally, while I-PINNs and M-PINN provide comparable accuracies, M-PINN is found to be approximately 50% more expensive.

42 ENGINEERING↗
DOE OSTI2024

Bayesian reduced-order deep learning surrogate model for dynamic systems described by partial differential equations

We propose a reduced-order deep-learning surrogate model for dynamic systems described by time-dependent partial differential equations. This method employs space–time Karhunen–Loève expansions (KLEs) of the state variables and space-dependent KLEs of space-varying parameters to identify the reduced (latent) dimensions. Subsequently, a deep neural network (DNN) is used to map the parameter latent space to the state variable latent space. An approximate Bayesian method is developed for uncertainty quantification (UQ) in the proposed KL-DNN surrogate model. The KL-DNN method is tested for the linear advection–diffusion and nonlinear diffusion equations, and the Bayesian approach for UQ is compared with the deep ensembling (DE) approach, commonly used for quantifying uncertainty in DNN models. It was found that the approximate Bayesian method provides a more informative distribution of the PDE solutions in terms of the coverage of the reference PDE solutions (the percentage of nodes where the reference solution is within the confidence interval predicted by the UQ methods) and log predictive probability. The DE method is found to underestimate uncertainty and introduce bias. For the nonlinear diffusion equation, we compare the KL-DNN method with the Fourier Neural Operator (FNO) method and find that KL-DNN is 10% more accurate and needs less training time than the FNO method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Data-driven projection pursuit adaptation of polynomial chaos expansions for dependent high-dimensional parameters

Uncertainty quantification (UQ) and inference involving a large number of parameters are valuable tools for problems associated with heterogeneous and non-stationary behaviors. The difficulty with these problems is exacerbated when these parameters are statistically dependent requiring statistical characterization over joint measures. Probabilistic modeling methodologies stand as effective tools in the realms of UQ and inference. Among these, polynomial chaos expansions (PCE), when adapted to low-dimensional quantities of interest (QoI), provide effective yet accurate approximations for these QoI in terms of an adapted orthogonal basis. These adaptation techniques have been cast as projection pursuits in Gaussian Hilbert space in what has been referred to as a projection pursuit adaptation (PPA) by Xiaoshu Zeng and Roger Ghanem (2023). The PPA method efficiently identifies an optimal low-dimensional space for representing the QoI and simultaneously evaluates an optimal PCE within that space. The quality of this approximation clearly depends on the size of the training dataset, which is typically a function of the adapted reduced dimension. Here, the complexity of the problem is thus mediated by the complexity of the low-dimensional quantity of interest and not the complexity of the high-dimensional parameter space.

Data-driven↗
DOE OSTI2025

An end-to-end deep learning method for solving nonlocal Allen–Cahn and Cahn–Hilliard phase-field models

Here, we propose an efficient end-to-end deep learning method for solving nonlocal Allen–Cahn (AC) and Cahn–Hilliard (CH) phase-field models. One motivation for this effort emanates from the fact that discretized partial differential equation-based AC or CH phase-field models result in diffuse interfaces between phases, with the only recourse for remediation is to severely refine the spatial grids in the vicinity of the true moving sharp interface whose width is determined by a grid-independent parameter that is substantially larger than the local grid size. In this work, we introduce non-mass conserving nonlocal AC or CH phase-field models with regular, logarithmic, or obstacle double-well potentials. Because of non-locality, some of these models feature totally sharp interfaces separating phases. The discretization of such models can lead to a transition between phases whose width is only a single grid cell wide. Another motivation is to use deep learning approaches to ameliorate the otherwise high cost of solving discretized nonlocal phase-field models. To this end, loss functions of the customized neural networks are defined using the residual of the fully discrete approximations of the AC or CH models, which results from applying a Fourier collocation method and a temporal semi-implicit approximation. To address the long-range interactions in the models, we tailor the architecture of the neural network by incorporating a nonlocal kernel as an input channel to the neural network model. We then provide the results of extensive computational experiments to illustrate the accuracy, predictive capabilities, and cost reductions of the proposed method.

42 ENGINEERING↗
DOE OSTI2025

Accelerating Hamiltonian Monte Carlo for Bayesian inference in neural networks and neural operators

Hamiltonian Monte Carlo (HMC) is a powerful and accurate method to sample from the posterior distribution in Bayesian inference. However, HMC techniques are computationally demanding for Bayesian neural networks due to the high dimensionality of the network’s parameter space and the non-convexity of their posterior distributions. Therefore, various approximation techniques, such as variational inference (VI) or stochastic gradient MCMC, are often employed to infer the posterior distribution of the network parameters. Such approximations introduce inaccuracies in the inferred distributions, resulting in unreliable uncertainty estimates. In this work, we propose a hybrid approach that combines inexpensive VI and accurate HMC methods to efficiently and accurately quantify uncertainties in neural networks and neural operators. The proposed approach leverages an initial VI training on the full network. We examine the influence of individual parameters on the prediction uncertainty, which shows that a large proportion of the parameters do not contribute substantially to uncertainty in the network predictions. This information is then used to significantly reduce the dimension of the parameter space, and HMC is performed only for the subset of network parameters that strongly influence prediction uncertainties. This yields a framework for accelerating the full batch HMC for posterior inference in neural networks. We demonstrate the efficiency and accuracy of the proposed framework on deep neural networks and operator networks, showing that inference can be performed for large networks with tens to hundreds of thousands of parameters. Finally, we show that this method can effectively learn surrogates for complex physical systems by modeling the operator that maps from upstream conditions to wall-pressure data on a cone in hypersonic flow.

Bayesian inference↗
DOE OSTI2026

Interpretable and flexible non-intrusive reduced-order models using reproducing kernel Hilbert spaces

This paper develops an interpretable, non-intrusive reduced-order modeling technique using regularized kernel interpolation. Existing non-intrusive approaches approximate the dynamics of a reduced-order model (ROM) by solving a data-driven least-squares regression problem for low-dimensional matrix operators. Our approach instead leverages regularized kernel interpolation, which yields an optimal approximation of the ROM dynamics from a user-defined reproducing kernel Hilbert space. We show that our kernel-based approach can produce interpretable ROMs whose structure mirrors full-order model structure by embedding judiciously chosen feature maps into the kernel. The approach is flexible and allows a combination of informed structure through feature maps and closure terms via more general nonlinear terms in the kernel. We also derive a computable a posteriori error bound that combines standard error estimates for intrusive projection-based ROMs and kernel interpolants. In conclusion, the approach is demonstrated in several numerical experiments that include comparisons to operator inference using both proper orthogonal decomposition and quadratic manifold dimension reduction.

Data-driven model reduction↗