Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “adaptive methods”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

The Cosmic Evolution of C IV Absorbers at 1.4 < z < 4.5: Insights from 100,000 Systems in DESI Quasars

We present the largest catalog to date of triply ionized carbon (C IV ) absorbers detected in quasar spectra from the Dark Energy Spectroscopic Instrument. Using an automated matched-kernel convolution method with adaptive signal-to-noise thresholds, we identify 101,487 C IV systems in the redshift range 1.4 < z < 4.5 from 300,637 quasar spectra. Completeness is estimated via Monte Carlo simulations, and the catalog is 50% complete at EW C IV ≥ 0.4 Å. The differential equivalent width frequency distribution declines exponentially and shows weak redshift evolution. The absorber incidence per unit comoving path increases by a factor of 2–5 from z ≈ 4.5 to z ≈ 1.4, with stronger redshift evolution for strong systems. Using column densities derived from the apparent optical depth method, we constrain the cosmic mass density of C IV , Ω C IV , which increases by a factor of ∼3.8 from (0.82 ± 0.05) × 10 −8 at z ≈ 4.5 to (3.16 ± 0.2) × 10 −8 at z ≈ 1.4. From Ω C IV , we estimate a lower limit on intergalactic medium metallicity ${\mathrm{log}}({Z}_{{\rm{IGM}}}/{Z}_{\odot })\gtrsim -3.25$ at z ∼ 2.3, with a smooth decline at higher redshifts. These trends trace the cosmic star formation history and He II photoheating rate, suggesting a link between C IV enrichment, star formation, and UV background over ∼3 Gyr. The catalog also provides a critical resource for future studies connecting circumgalactic metals to galaxy evolution, especially near cosmic noon.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Distributed Solar Adoption in Orlando: A Household-Level Model for Distribution Resource Planning

Potential for rooftop solar in Florida is massive (47% of retail sales, 3rd overall nationally), yet adoption lags (12th nationally). A 2018 Florida Public Service Commission ruling authorizing solar third-party ownership (leasing) has substantially increased attention on distributed solar in the state. The city of Orlando has committed to a 100% clean-energy target by 2050 and deployment of solar and storage are expected to contribute significantly to reaching the goal. Deployment of customer-adopted solar, unlike utility-procured solar, is uncertain, but known to be spatially correlated with demographic factors and existing adoption. We develop a new method to adapt NREL's dGen model in order to represent building-level agents in adoption forecasts for the Orlando Utility Commission (OUC) service territory. Using the agent-based model we develop projections of solar adoption, subject to scenarios varying future solar costs and valuation, and aggregate adoption predictions by OUC distribution feeder. We find substantial spatial heterogeneity in the projected level of adoption by OUC distribution feeder. For instance, 25% of all projected adoption through 2050 would be concentrated on just 5% of feeders and 88% of projected adoption on 50% of feeders. Because of the uncertainty in adoption, bottoms-up solar adoption forecasting methods at the household-level are integral to long-term resource planning by anticipating system needs as customers increasingly adopt distributed solar, storage, electric vehicles, and other distributed energy resources.

14 SOLAR ENERGY↗
DOE OSTI2024

ASGarD: Adaptive Sparse Grid Discretization

Many areas of science exhibit physical processes that are described by high dimensional partial differential equations (PDEs), e.g., the 4D, 5D and 6D models describing magnetized fusion plasmas, models describing quantum chemistry, or derivatives pricing. Such problems are affected by the so-called “curse of dimensionality” where the number of degrees of freedom (or unknowns) required to be solved for scales as N D where N is the number of grid points in any given dimension D. A simple, albeit naive, 6D example is demonstrated in the left panel of Figure 1. With N = 1000 grid points in each dimension, the memory required just to store the solution vector, not to mention forming the matrix required to advance such a system in time, would exceed an exabyte - and also the available memory on the largest of supercomputers available today. The right panel of Figure 1 demonstrates potential savings for a range of problem dimensionalities and grid resolution. While there are methods to simulate such high-dimensional systems, they are mostly based on Monte-Carlo methods, which rely on a statistical sampling such that the resulting solutions include noise. Since the noise in such methods can only be reduced at a rate proportional to $\sqrt{N_p}$ where N p is the number of Monte-Carlo samples, there is a need for continuum, or grid/mesh-based methods for high-dimensional problems, which both do not suffer from noise and bypass the curse of dimensionality. We present a simulation framework that provides such a method using adaptive sparse grids.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

PRISMS-PF: A general framework for phase-field modeling with a matrix-free finite element method

Abstract A new phase-field modeling framework with an emphasis on performance, flexibility, and ease of use is presented. Foremost among the strategies employed to fulfill these objectives are the use of a matrix-free finite element method and a modular, application-centric code structure. This approach is implemented in the new open-source PRISMS-PF framework. Its performance is enabled by the combination of a matrix-free variant of the finite element method with adaptive mesh refinement, explicit time integration, and multilevel parallelism. Benchmark testing with a particle growth problem shows PRISMS-PF with adaptive mesh refinement and higher-order elements to be up to 12 times faster than a finite difference code employing a second-order-accurate spatial discretization and first-order-accurate explicit time integration. Furthermore, for a two-dimensional solidification benchmark problem, the performance of PRISMS-PF meets or exceeds that of phase-field frameworks that focus on implicit/semi-implicit time stepping, even though the benchmark problem’s small computational size reduces the scalability advantage of explicit time-integration schemes. PRISMS-PF supports an arbitrary number of coupled governing equations. The code structure simplifies the modification of these governing equations by separating their definition from the implementation of the numerical methods used to solve them. As part of its modular design, the framework includes functionality for nucleation and polycrystalline systems available in any application to further broaden the phenomena that can be used to study. The versatility of this approach is demonstrated with examples from several common types of phase-field simulations, including coarsening subsequent to spinodal decomposition, solidification, precipitation, grain growth, and corrosion.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Grid-tied Multilevel Inverter with Phase-locked Loop Algorithm

A multilevel inverter is an electronic device capable of changing direct current energy to alternant current energy with a voltage and frequency established by the user. They are ideal for connecting renewable energy sources to the AC grid, energy plants, and smart grids. The voltage must be balanced and synchronized with the electrical network for adequate performance. This paper shows the voltage synchronization between an inverter output voltage and the AC grid using a phase-locked loop based on an adaptive observer. The proposed algorithm can perform under grid uncertainties such as noise and generates a reference signal for the modulation used in the inverter. The algorithm is robust and computationally efficient and can be implemented through basic elements such as operational amplifiers, resistors, and capacitors, reducing its difficulty in executing it in a system.

42 ENGINEERING↗
DOE OSTI2026

A Semi-Supervised Learning Method for the Identification of Bad Exposures in Large Imaging Surveys

As the data volume of astronomical imaging surveys rapidly increases, traditional methods for image anomaly detection, such as visual inspection by human experts, are becoming impractical. We introduce a machine-learning-based approach to detect poor-quality exposures in large imaging surveys, with a focus on the DECam Legacy Survey (DECaLS) in regions of low extinction (i.e., E ( B − V ) < 0.04 ). Our semi-supervised pipeline integrates a vision transformer (ViT), trained via self-supervised learning (SSL), with a k-Nearest Neighbor (kNN) classifier. We train and validate our pipeline using a small set of labeled exposures observed by surveys with the Dark Energy Camera (DECam). A clustering-space analysis of where our pipeline places images labeled in good and bad categories suggests that our approach can efficiently and accurately determine the quality of exposures. Applied to new imaging being reduced for DECaLS Data Release 11, our pipeline identifies 780 problematic exposures, which we subsequently verify through visual inspection. Being highly efficient and adaptable, our method offers a scalable solution for quality control in other large imaging surveys.

Luo, Yufeng (ORCID:0000000246230683)↗
DOE OSTI2022

A general framework for quantifying uncertainty at scale

Abstract In many fields of science, comprehensive and realistic computational models are available nowadays. Often, the respective numerical calculations call for the use of powerful supercomputers, and therefore only a limited number of cases can be investigated explicitly. This prevents straightforward approaches to important tasks like uncertainty quantification and sensitivity analysis. This challenge can be overcome via our recently developed sensitivity-driven dimension-adaptive sparse grid interpolation strategy. The method exploits, via adaptivity, the structure of the underlying model (such as lower intrinsic dimensionality and anisotropic coupling of the uncertain inputs) to enable efficient and accurate uncertainty quantification and sensitivity analysis at scale. Here, we demonstrate the efficiency of this adaptive approach in the context of fusion research, in a realistic, computationally expensive scenario of turbulent transport in a magnetic confinement tokamak device with eight uncertain parameters, reducing the effort by at least two orders of magnitude. In addition, we show that this refinement method intrinsically provides an accurate surrogate model that is nine orders of magnitude cheaper than the high-fidelity model.

Farcaş, Ionuţ-Gabriel (ORCID:0000000238841580)↗
DOE OSTI2023

Conditional Karhunen–Loève regression model with Basis Adaptation for high-dimensional problems: Uncertainty quantification and inverse modeling

Here, we propose a methodology for improving the accuracy of surrogate models of the observable response of physical systems as a function of the systems’ spatially heterogeneous parameter fields, with applications to uncertainty quantification and parameter estimation in high-dimensional problems. Practitioners often formulate finite-dimensional representations of spatially heterogeneous parameter fields using truncated unconditional Karhunen–Loève expansions (KLEs) for a certain choice of unconditional covariance kernel and construct surrogate models of the observable response with respect to the KLE coefficients. When direct measurements of the parameter fields are available, we propose improving the accuracy of these surrogate models by representing the parameter fields via conditional Karhunen-Loève expansions (CKLEs). CKLEs are constructed by conditioning the covariance kernel of the unconditional expansion on the direct measurements of the parameter field via Gaussian process regression, and then truncating the corresponding KLE. We apply the proposed methodology to constructing surrogate models via the Basis Adaptation (BA) method of the stationary hydraulic head response, measured at spatially discrete observation locations, of a groundwater flow model of the Hanford Site, as a function of the 1000-dimensional representation of the model’s log-transmissivity field. We find that BA surrogate models of the hydraulic head based on CKLEs are more accurate than BA surrogate models based on unconditional expansions for forward uncertainty quantification tasks. Furthermore, we find that inverse estimates of the hydraulic transmissivity field computed using CKLE-based BA surrogate models are more accurate than those computed using unconditional BA surrogate models.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Adaptive, Active Learning, and Multifidelity Monte Carlo Methods in the MOOSE Stochastic Tools Module

MOOSE is an open-source computational platform for constructing multi-physics models and executing them in a massively parallel fashion. It has a stochastic tools module (STM) for forward/inverse uncertainty quantification (UQ) and surrogate modeling. This presentation details some recent developments to the STM with respect to the implementation of adaptive, active learning, and multifidelity Monte Carlo methods for forward UQ of computational models. Specifically, the adaptive Monte Carlo methods include Markov Chain Monte Carlo (MCMC)-driven algorithms like adaptive importance sampling and parallelized subset simulation for statistical QoI estimation, rare events analysis, and stochastic gradient-free optimization. The active learning methods include Gaussian Process (GP) surrogates and their training via Adam optimization, design of acquisition functions, and integration with samplers like Monte Carlo, adaptive importance, and parallelized subset simulation. These active learning methods are also designed to work in a batch mode, wherein, the required calls to the full computational model are executed in parallel whenever a user-specified batch size is met. The multifidelity methods in STM are broadly divided into two categories: hierarchical, where a defined hierarchy exists among the low-fidelity models, and peer, where all the low-fidelity models are treated equally. A GP surrogate is used to learn the differences between the low- and high-fidelity models in both multifidelity categories, and acquisition functions from the active learning classes are used to decide whether to rely on a low-fidelity model or call the expensive high-fidelity model. Alongside the software description and usage, applications are also presented to nuclear engineering computational models including a TRISO nuclear fuel particle, a reactor pressure vessel, and a heat-pipe microreactor.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Revisiting the multi-monopole point of SU( N ) $\mathcal{N}$ = 2 gauge theory in four dimensions

Motivated by applications to soft supersymmetry breaking, we revisit the expansion of the Seiberg-Witten solution around the multi-monopole point on the Coulomb branch of pure SU(N) $\mathcal{N}$ = 2 gauge theory in four dimensions. At this point N - 1 mutually local magnetic monopoles become massless simultaneously, and in a suitable duality frame the gauge couplings logarithmically run to zero. We explicitly calculate the leading threshold corrections to this logarithmic running from the Seiberg-Witten solution by adapting a method previously introduced by D’Hoker and Phong. We compare our computation to existing results in the literature; this includes results specific to SU(2) and SU(3) gauge theories, the large-N results of Douglas and Shenker, as well as results obtained by appealing to integrable systems or topological strings. We find broad agreement, while also clarifying some lingering inconsistencies. Finally, we explicitly extend the results of Douglas and Shenker to finite N, finding exact agreement with our first calculation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Bayesian projection pursuit regression

In projection pursuit regression (PPR), a univariate response variable is approximated by the sum of $M$ “ridge functions,” which are flexible functions of one-dimensional projections of a multivariate input variable. Traditionally, optimization routines are used to choose the projection directions and ridge functions via a sequential algorithm, and $M$ is typically chosen via cross-validation. Here, we introduce a novel Bayesian version of PPR, which has the benefit of accurate uncertainty quantification. To infer appropriate projection directions and ridge functions, we apply novel adaptations of methods used for the single ridge function case ($M$=1), called the Bayesian Single Index Model; and use a Reversible Jump Markov chain Monte Carlo algorithm to infer the number of ridge functions $M$. We evaluate the predictive ability of our model in 20 simulated scenarios and for 23 real datasets, in a bake-off against an array of state-of-the-art regression methods. Finally, we generalize this methodology and demonstrate the ability to accurately model multivariate response variables. Its effective performance indicates that Bayesian Projection Pursuit Regression is a valuable addition to the existing regression toolbox.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Multi-objective sizing and dispatch for building thermal and battery storage towards economic and environmental synergy

The role of building thermal and battery storage is pivotal in advancing smart cities and achieving sustainability goals through effective energy management. Despite their significance, there are several limitations in the sizing approach and value stream analysis with various objectives for their widespread adoption in buildings. This work proposes a flexible and scalable multi-objective optimization framework for optimal sizing and dispatch of building thermal and battery storage, addressing conflicting objectives simultaneously using mixed-integer linear programming. The weighted-sum method is adapted, combining multiple objectives into a single function. The two-stage procedure iterates over different weights, generating optimal solutions and forming the Pareto front. Case studies are performed to assess the energy, economic, and environmental benefits of building energy storage systems for a large office building in three climate locations. The results demonstrate that the proposed framework efficiently determines optimal sizing and dispatch strategies, addressing the balance between economic viability and emission reduction. The dynamic relationship between time-of-use energy charges and emission factors leads to significantly different strategies based on whether economic or environmental concerns are prioritized. This research enhances our understanding of the benefits of TES and BES systems in buildings, providing valuable guidance to stakeholders.

25 ENERGY STORAGE↗
DOE OSTI2025

A neural-network-enhanced parameter-varying framework for multi-objective model predictive control applied to buildings

Management of the electrical grid is becoming more complex due to the increased penetration of alternative energy generation technologies and a broadening diversity of electric loads. This complexity creates challenges in balancing demand and generation that can increase the potential for grid instabilities. One effective way to address this issue is to leverage previously unexploited demand flexibility through advanced control strategies. In this work, we propose an advanced control method, called adaptive neural parameter-varying model predictive control (ANPV-MPC), to control the temperature and energy consumption of a building via its Heating, Ventilation, and Air Conditioning system. ANPV-MPC combines key ideas in parameter-varying control, adaptive control, and online learning strategies to bridge the gap between computationally efficient linear model predictive control and more accurate nonlinear model predictive control. The novelty in ANPV-MPC is the use of a physics-inspired Bayesian neural network to estimate the coefficients of the parameter-varying linear control model. The Bayesian neural network additionally provides uncertainty estimates, triggering online training to capture evolving building system conditions. We show that ANPV-MPC can approximate the building system dynamics with a 28.39% higher accuracy than traditional linear model predictive control, resulting in 36.23% better control performance without increasing complexity of the optimal control problem. ANPV-MPC also adapts in real time to previously unseen conditions using online learning, further improving its performance.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Development of multi-scale computational frameworks to solve fusion materials science challenges

Over the past two decades, the US-DOE has funded multiple projects that rely on high-performance computing and exascale computing platforms to accelerate scientific discoveries and address grand scientific challenges, such as harnessing fusion energy. In this article, we review in detail one of these efforts aimed at enhancing our capability to model plasma-facing materials subject to plasma and high-energy ion/neutron irradiation. The plasma surface interactions project has built a multi-scale modeling framework where many of the plasma- and high-energy ion/neutron irradiation-induced effects occurring in tungsten are explored. Here, this knowledge is used to develop atomistically-informed, high-fidelity continuum and meso-scale models that can be validated against experiments. We review the developments within this project, with attention to experimental validation efforts, and specifically highlight activities associated with: helium bubble bursting and equation of state, and hydrogen-helium interactions in tungsten; atomistically-informed model development for beryllium-tungsten material mixing; coupling of scrape-of-layer plasma, sheath and material models; and coupling of stochastic cluster-dynamics and crystal plasticity models to address radiation effects in tungsten under stress. Finally, we present how the project is preparing for future computational architectures, for instance through efforts to adapt atomistic methods to exascale computing.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Lie–Poisson Neural Networks (LPNets): Data-based computing of Hamiltonian systems with symmetries

An accurate data-based prediction of the long-term evolution of Hamiltonian systems requires a network that preserves the appropriate structure under each time step. Every Hamiltonian system contains two essential ingredients: the Poisson bracket and the Hamiltonian. Hamiltonian systems with symmetries, whose paradigm examples are the Lie–Poisson systems, have been shown to describe a broad category of physical phenomena, from satellite motion to underwater vehicles, fluids, geophysical applications, complex fluids, and plasma physics. The Poisson bracket in these systems comes from the symmetries, while the Hamiltonian comes from the underlying physics. We view the symmetry of the system as primary, hence the Lie–Poisson bracket is known exactly, whereas the Hamiltonian is regarded as coming from physics and is considered not known, or known approximately. Using this approach, we develop a network based on transformations that exactly preserve the Poisson bracket and the special functions of the Lie–Poisson systems (Casimirs) to machine precision. We present two flavors of such systems: one, where the parameters of transformations are computed from data using a dense neural network (LPNets), and another, where the composition of transformations is used as building blocks (G-LPNets). We also show how to adapt these methods to a larger class of Poisson brackets. We apply the resulting methods to several examples, such as rigid body (satellite) motion, underwater vehicles, a particle in a magnetic field, and others. The methods developed in this paper are important for the construction of accurate data-based methods for simulating the long-term dynamics of physical systems.

Data-based modeling↗
DOE OSTI2023

Principal Component Analysis of azimuthal flow in intermediate-energy heavy-ion reactions

Principal Component Analysis (PCA) via Singular Value Decomposition (SVD) of large datasets is an adaptive exploratory method to uncover natural patterns underlying the data. Several recent applications of the PCA-SVD to event-by-event single-particle azimuthal angle distribution matrices in ultra-relativistic heavy-ion collisions at RHIC-LHC energies indicate that the sine and cosine functions chosen a priori in the traditional Fourier analysis are naturally the most optimal basis for azimuthal flow studies according to the data itself. We perform PCA-SVD analyses of mid-central Au+Au collisions at $E$ $beam$ / $A$ =1.23 GeV simulated using an isospin-dependent Boltzmann-Uehling-Uhlenbeck (IBUU) transport model to address the following two questions: (1) if the principal components of the covariance matrix of nucleon azimuthal angle distributions in heavy-ion reactions around 1 GeV/nucleon are naturally sine and/or cosine functions and (2) what if any advantages the PCA-SVD may have over the traditional flow analysis using the Fourier expansion for studying the EOS of dense nuclear matter. In conclusion, we find that (1) in none of our analyses the principal components come out naturally as sine and/or cosine functions, (2) while both the eigenvectors and eigenvalues of the covariance matrix are appreciably EOS dependent, the PCA-SVD has no apparent advantage over the traditional Fourier analysis for studying the EOS of dense nuclear matter using the azimuthal collective flow in heavy-ion collisions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Immortal rays: Rethinking random ray neutron transport on GPU architectures

The Random Ray Method (TRRM) is a recently developed adaptation of the Method of Characteristics for neutral particle transport simulations. TRRM has demonstrated excellent performance on 3D nuclear reactor benchmark problems using CPU-based compute systems. When porting to GPU-based systems, however, new performance challenges arise that are unique to processors targeting massive fine-grained parallelism. For smaller problems, or for large problems that are domain decomposed across many computational nodes, the problem size per node has insufficient parallelism to saturate GPU node resources, thus greatly limiting speedup. In this study, we report on a newly developed “immortal ray” variant of TRRM. Here, the immortal ray technique exposes significantly more fine-grained parallelism by fundamentally reformulating the numerical details of ray discretization, resulting in performance tradeoffs with significant overall benefit on GPUs. For very small 2D simulation problems we found the new immortal ray variant allowed for up to a 4.4x speedup when run on a single GPU. For larger 3D simulation problems we found the new variant improved strong scaling by 3x when run on the Summit supercomputer.

97 MATHEMATICS AND COMPUTING↗