SEARCH · Engineering Papers
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.
Here, the Chebyshev Rational Approximation Method (CRAM) algorithm has become the method of choice for modern nuclear depletion calculations. A simple modification of the CRAM yields not only depleted nuclide amounts but also time-averaged nuclide amounts, with little additional calculation cost.
Thwaites developed an approximate method for determining the evolution of laminar boundary layers. The approximation follows from an assumption that the growth of a laminar boundary layer in the presence of pressure gradients could be parameterized solely as a function of the Holstein–Bohlen flow parameter, thus reducing the von Kármán momentum integral to a first-order ordinary differential equation. This method is useful for the analysis of laminar flows, and in computational potential flow solvers to account for the viscous effects. In this work, an approximate method for determining the momentum thickness of a two-dimensional, turbulent boundary layer is proposed following Thwaites’ work. It is shown that the method provides good estimates of the momentum thickness for multiple boundary layers, including both favourable and adverse pressure gradient effects, up to the point of separation. In the limit of high Reynolds numbers, it is possible to derive a criterion for the onset of separation from the proposed model, which is shown to be in agreement with prior empirical observations. The sensitivity of the separation location with respect to upstream perturbations is also analysed through this model for the NASA/Boeing speed bump and the transonic Bachalo–Johnson bump.
In this study, we evaluate how an iterative portfolio approach compares to a more traditional capacity credit method, using the U.S. Southeast as a case study region. Using open-source planning and resource adequacy tools, we compare results using a capacity credit approximation method with those from iterating behind the two. We also explore how the iterative approach performs under a range of sensitivities, including higher load growth, regional coordination, and alternative weather years. We find that traditional capacity credit approximation methods can function well in today's system, but may face challenges for systems with higher levels of solar and storage. As such, integrating planning and resource adequacy models can address some of these gaps, helping planners deliver more reliable systems.
Explore the source record for details and available documents.
The strong interdependence of electricity, gas, and heating systems can facilitate fault propagation within integrated energy systems (IESs), posing significant challenges to secure operation. This paper proposes a polynomial chaos expansion (PCE)-based approximation method to accurately characterize the IES security region boundary (IES–SRB). By integrating the Karush-Kuhn-Tucker conditions with PCE theory, the IES-SRB approximation problem is reformulated as a set of nonlinear equations concerning the approximation coefficients. Using the Galerkin projection method, these equations are further transformed into a system of projection equations that govern the polynomial approximation coefficients in the IES-SRB approximation. To reduce computational complexity while maintaining high approximation accuracy, a piecewise polynomial approximation method is proposed. Numerical studies on the E39-G20-H6 and E118-G96-H52 IES test systems demonstrate that the proposed method can accurately and effectively construct IES security regions.
Individual seismic catalogs can contain multiscale observations from fault level to global scales and associated waveforms from discrete events reflect crustal structure across many different scales and locations. Seismic network aperture, geographic location, and observation distance may not provide informative guidance or intuition on how different catalogs will behave across models trained under different conditions. We rely on uncertainty to provide guardrails for when to trust model decisions, but understanding when our uncertainty is trustworthy is an open challenge. Here, in this work, we explore Bayesian approximation methods for assigning predictive uncertainty in seismic event classification problems. We find that computationally expensive Bayesian approximations do not outperform simple ensemble methods. We also find that when exploiting multiple seismic event catalogs, joint training with data from all the catalogs combined with Bayesian approximations and supervised training for classification can obscure bias and result in less robust uncertainty while also not providing substantial performance benefits compared to training individual models for each catalog.
Partial integro-differential equations (PIDEs) have broad applications in the sciences, from electro-magnetism to options pricing. Here, in this paper, we introduce a new finite expression method (FEX) to solve PIDEs. This approach builds upon the original FEX and its inherent advantages with new advances: 1) A novel method of parameter grouping is proposed to reduce the number of coefficients in high-dimensional function approximation; 2) A Taylor series approximation method is implemented to significantly improve the computational efficiency and accuracy of the evaluation of the integral terms of PIDEs. The new FEX based method, denoted FEX-PG to indicate the addition of the parameter grouping (PG) step to the algorithm, provides both high accuracy and interpretable numerical solutions, with the outcome being an explicit equation that facilitates intuitive understanding of the underlying solution structures. These features are often absent in traditional methods, such as finite element methods (FEM) and finite difference methods, as well as in deep learning-based approaches. To benchmark our method against recent advances, we apply the new FEX-PG to solve benchmark PIDEs in the literature. In high-dimensional settings, FEX-PG exhibits strong and robust performance, achieving relative errors on the order of single precision machine epsilon, significantly outperforming existing approaches based on neural networks.
Deep learning has exhibited remarkable results across diverse areas. To understand its success, substantial research has been directed towards its theoretical foundations. Nev- ertheless, the majority of these studies examine how well deep neural networks can model functions with uniform regularities. In this paper, we explore a different angle: how deep neural networks can adapt to varying degrees of smoothness in functions and nonuni- form data distributions across different locations and scales. More precisely, we focus on a broad class of functions defined by nonlinear tree-based approximation methods. This class encompasses a range of function types, such as functions with uniform regularities and discontinuous functions. We develop nonparametric approximation and estimation theories for this class using deep ReLU networks. Our results show that deep neural networks are adaptive to the nonuniform smoothness of functions and nonuniform data distributions at different locations and scales. We apply our results to several function classes, and derive the corresponding approximation and generalization errors. The validity of our results is demonstrated through numerical experiments.
We propose a deterministic sampling framework using Score-Based Transport Modeling for sampling an unnormalized target density π given only its score ∇ log π. Our method approximates the Wasserstein gradient flow on KL($f_t$∥π) by learning the time-varying score ∇ log $f_t$ on the fly using score matching. While having the same marginal distribution as Langevin dynamics, our method produces smooth deterministic trajectories, resulting in monotone noise-free convergence. We prove that our method dissipates relative entropy at the same rate as the exact gradient flow, provided sufficient training. Numerical experiments validate our theoretical findings: our method converges at the optimal rate, has smooth trajectories, and is often more sample efficient than its stochastic counterpart. Experiments on high-dimensional image data show that our method produces high-quality generations in as few as 15 steps and exhibits natural exploratory behavior. The memory and runtime scale linearly in the sample size.
Bifacial photovoltaic (PV) modules have the advantage of using light reflected off of the ground to contribute to power production. Predicting the energy gain is challenging and requires complex models to do so accurately. Often, module degradation over time is neglected in models for the sake of simplicity or is underestimated. Comparing outdoor and indoor current–voltage (I–V) performance for bifacial modules is more challenging than for monofacial modules, as there are additional variables to consider such as rear albedo non-uniformity, cell mismatch, and their effects on temperature. This challenge is compounded when heterogeneous degradation modes occur, such as polarization-type potential-induced degradation (PID-p). To examine the effects of PID-p on I–V predictions using an empirical data-driven approach, 16 bifacial PERC modules are installed outdoors on racks with different albedo conditions. A subset is exposed to high-voltage biases of −1500 V or +1500 V. Outdoor data are traced at irradiance ranges of 150–250 W/m 2 , 500–600 W/m 2 , and 900–1000 W/m 2 . These curves are corrected using control module temperature, wire resistivity, and module resistance measured indoors. We examine several methods to transform indoor I–V curves to accurately, and more simply than existing methods, approximate outdoor performance for bifacial modules without and with varying levels of PID-p degradation. This way, bifacial performance modeling can be more accessible and informed by fielded, degraded modules. Distributions of percent errors between indoor and outdoor performance parameters and Mean Absolute Percent Errors (MAPEs) are used to assess method quality. Results including low-irradiance data (150–250 W/m 2 ) are discussed but are filtered for quantifying method quality as these data introduce substantial errors. The method with the most optimal tradeoff between low MAPE and analysis simplicity involves measuring the front side of a module indoors at an irradiance equal to plane-of-array irradiance plus the product of module bifaciality and albedo irradiance. This method gives MAPE values of 1–6.5% for non-degraded and 1.6–5.9% for PID-p degraded module performance.
One commonly used approach in seismic probabilistic safety assessment (PSA) is the discrete method. This method follows the standard PSA framework and can be applied to various models, such as multi-unit models, while reducing computational costs using standard software. However, due to the inability to subdivide intervals infinitely, the discrete method approximates with a finite number of subintervals. In practice, different numbers of subintervals are applied, and the representative ground motion level is selected based on expert judgment. When employing a smaller number of subintervals, it is important to take caution to prevent underestimation. This study analyzes the impact of the representative ground motion level on seismic risk. It confirms that underestimation can occur with a small number of subintervals depending on the representative ground motion level. This study also proposes a method for determining the boundary of underestimation and overestimation. The method is demonstrated through examples, providing a mathematical foundation for selecting appropriate representative ground motion levels. By avoiding underestimation, this research helps prevent the oversight of significant risk contributors and enhances the understanding of seismic risk.
We present an optimized random phase approximation method (optRPA26) that significantly improves upon conventional RPA through an optimized choice of reference orbitals and energy components, rather than a modification of the RPA correlation functional itself. The method employs an empirically constructed hybrid functional to generate DFT orbitals to evaluate the RPA correlation energy, which is then scaled by a constant. Comprehensive benchmarks across molecules, bulk solids, and surface systems demonstrate that optRPA26 consistently achieves high accuracy, with mean absolute errors of 0.05 eV for W4-11-RE reaction energies, 0.07 eV for cohesive energies, 0.09 eV for metal oxide formation energies, 0.11–0.12 eV for adsorption of small molecules on metals, and 0.06 eV for adsorption on oxides. In addition, optRPA26 correctly captures phase stability in metal oxides and magnetic metals. The optRPA26 approach can be run using standard RPA implementations, highlighting its potential as a general-purpose reference method that can accurately capture covalent, ionic, metallic, and van der Waals bonding in molecules, solids, and interfaces.
Characterizing the relationship between bulk physical properties and mixing in randomly heterogeneous media is a central challenge across many areas of science and engineering. A benchmark model for such studies is the Poisson model, a random tessellation of space by a Poisson process of hyperplanes. In radiation transport studies, the lack of exact expressions for the Poisson model’s spatial multipoint functions has led to approximate methods being used, introducing unquantified sources of error. Here, we recently introduced an exact solution for the Poisson model’s multipoint functions and closely related conditional probability functions (CPFs), providing a new opportunity to understand and reduce these sources of error. In this paper, we enable a more rigorous investigation of radiation transport in stochastic media by applying the recently introduced exact solution for the Poisson model’s CPFs. This paper consists of three main contributions. First, we introduce a unified framework for CPFs of the Poisson model, encompassing the recently introduced exact CPFs as well as the previously introduced atomic mix, nearest-neighbor, and combination CPFs. This framework also includes existing pruning techniques for the approximate CPFs, such as angular exclusion, as well as a novel form of angular exclusion suitable for the exact CPFs. Second, we use the exact CPFs to characterize the spatial regions where each approximate three-point CPF is most accurate, thereby explaining the observed hierarchy of accuracy among the approximate models. Finally, we evaluate material transmittance, reflectance, and flux in a three-dimensional test problem using conditional point sampling, demonstrating the relationship between CPF accuracy and transport simulation accuracy.
Here, we propose a marginal likelihood strategy within the Kennedy-O’Hagan (KOH) Bayesian framework, where a Gaussian process (GP) models the discrepancy between a physical system and its simulator. Our approach introduces a novel marginalized likelihood by integrating out the degenerate eigenspace of the covariance matrix, rather than approximating the original likelihood. Unlike approximation methods that compromise accuracy for computational efficiency, our method defines an exact likelihood—distinct from the original but preserving all relevant information. This formulation achieves computational efficiency and stability, even for large datasets where the covariance matrix nears degeneracy. Applied to the characterization of a superconducting quantum device at Lawrence Livermore National Laboratory, the approach enhances the predictive accuracy of the Lindblad master equations for modeling Ramsey measurement data by effectively quantifying uncertainties consistent with the quantum data.
The Fermi–Hubbard model is a fundamental model in condensed matter physics that describes strongly correlated electrons. On the other hand, quantum computers are emerging as powerful tools for exploring the complex dynamics of these quantum many-body systems. In this work, we demonstrate the quantum simulation of the one-dimensional Fermi–Hubbard model using IBM's superconducting quantum computers, employing over 100 qubits. We introduce a first-order Trotterization scheme and extend it to an optimized second-order Trotterization for the time evolution in the Fermi–Hubbard model, specifically tailored for the limited qubit connectivity of quantum architectures, such as IBM's platforms. Notably, both Trotterization approaches are scalable and maintain a constant circuit depth at each Trotter step, regardless of the qubit count, enabling us to precisely investigate the relaxation dynamics in the Fermi–Hubbard model by measuring the expectation value of the Néel observable (staggered magnetization) for time-evolved quantum states. Lastly, our successful measurement of expectation values in such large-scale quantum many-body systems, especially at longer time scales with larger entanglement, highlights the quantum utility of superconducting quantum platforms over conventional classical approximation methods.
A critical requirement of spectroscopic large scale structure analyses is correcting for selection of which galaxies to observe from an isotropic target list. This selection is often limited by the hardware used to perform the survey which will impose angular constraints of simultaneously observable targets, requiring multiple passes to observe all of them. In SDSS this manifested solely as the collision of physical fibers and plugs placed in plates. In DESI, there is the additional constraint of the robotic positioner which controls each fiber being limited to a finite patrol radius. A number of approximate methods have previously been proposed to correct the galaxy clustering statistics for these effects, but these generally fail on small scales. To accurately correct the clustering we need to upweight pairs of galaxies based on the inverse probability that those pairs would be observed (Bianchi & Percival 2017). This paper details an implementation of that method to correct the Dark Energy Spectroscopic Instrument (DESI) survey for incompleteness. To calculate the required probabilities, we need a set of alternate realizations of DESI where we vary the relative priority of otherwise identical targets. These realizations take the form of alternate Merged Target Ledgers (AMTL), the files that link DESI observations and targets. We present the method used to generate these alternate realizations and how they are tracked forward in time using the real observational record and hardware status, propagating the survey as though the alternate orderings had been adopted. We detail the first applications of this method to the DESI One-Percent Survey (SV3) and the DESI year 1 data. We include evaluations of the pipeline outputs, estimation of survey completeness from this and other methods, and validation of the method using mock galaxy catalogs.
The application of Glauber theory has been playing an increasingly important role with the study of unstable or exotic nuclei. Its adaptation to medium and high-energy nucleus-nucleus collisions is severely limited because one has to evaluate the matrix elements of multiple-scattering operators. The extraction of physical observables has been done using ‘approximate’ Glauber theory whose validity is hard to evaluate. Here, we perform a full calculation of the matrix elements using Monte Carlo integration and analyze the elastic differential cross sections and the total reaction cross sections for p+¹²C, ⁴,⁶He+¹²C, and ¹²C+¹²C collisions. We use the variational Monte Carlo wave functions for ⁴,⁶He and ¹²C obtained by using realistic two- and three-nucleon potentials. We demonstrate the performance of the Glauber-theory calculations by comparing with available experimental data. We further discuss the accuracy of the conventional approximate methods in the light of the cumulant expansion for Glauber’s phase-shift function.
Detecting anisotropic screening of the cosmic microwave background (CMB) holds the promise of revealing the distribution of gas in the Universe, characterizing the complex processes of galaxy formation and feedback, and studying the epoch of reionization. Estimators for inhomogeneous screening, including some recently proposed small-scale (stacked) estimators, are quadratic or higher order in the CMB temperature or polarization fields and are therefore subject to contamination from CMB lensing. We review the origin of this lensing bias and show that, when stacking on unWISE galaxies, the expected lensing bias dominates the signal if left unmitigated. Hardening techniques that null the lensing bias have been proposed for standard quadratic estimators, whereas only approximate methods have been proposed for stacked estimators. In conclusion, we review these techniques and apply the former to stacked estimators, presenting several strategies (including the optimal strategy) to null lensing contamination when stacking on any large-scale structure tracer.