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

Adaptive tau-leaping methods for microscopic-lattice kinetic Monte Carlo simulations

Traditional Kinetic Monte Carlo (KMC) approaches, rooted in Gillespie’s stochastic simulation algorithm, become computationally demanding in systems with a large range of timescales. The goal of this work is to propose and study new adaptive lattice-KMC time integration strategies for spatially non-uniform systems. To that end, two novel adaptive tau-leaping methods and their corresponding time integration strategies are developed based on the idea of the “n-fold” direct KMC method. These strategies allow for the simultaneous execution of multiple reactions, advancing time by adaptively selected coarse increments. We present numerical experiments comparing the proposed methods with existing approaches in a catalytic surface kinetics application involving ammonia decomposition.

Bimolecular reactions↗
DOE OSTI2025

Predicting interface structure using the minima hopping method

Here, we adapt the minima hopping method (MHM) to the problem of interfacial structure prediction and apply it to study a canonical problem, the tilt grain boundaries in SrTiO 3 . Our method employs a hybrid approach by first exploring the potential energy surface (PES) of different grain boundary samplings with an empirical force field, among which the fifteen candidates with lower energies are then refined using ab initio density functional theory (DFT) calculations. During the exploratory stage, we bias the search using a local order parameter to primarily sample various reconstructions in the vicinity of the interface, while preserving the crystallinity of the bulk regions. We further enhance the search by incorporating initial structures with rigid body displacements to account for translational variations between bulk phases, enabling the MHM to effectively generate both stoichiometric and nonstoichiometric SrTiO 3 Σ⁢3(111)[110] and Σ⁢3(112)[110] grain boundaries. From an algorithmic standpoint, MHM outperforms earlier studies based on genetic algorithms (GA) by identifying more stable interfacial structures of several SrTiO 3 grain boundaries. The performance of the present implementation of the MHM approach is primarily limited by exploring an approximate description of the PES with a rather simple Buckingham potential. This limitation leads to variations in performance when compared to approaches utilizing more advanced surrogate PES models, such as direct DFT-PES sampling or GA with the embedded atom method (EAM). Despite the present limitations, the MHM approach is able to yield interfacial structures with comparable or lower interfacial energies in specific cases, such as Σ⁢3(111)[110] Γ=1, ±0.5 and Σ⁢3(112)[110] Γ= ±1, −2, underscoring the robustness of the MHM approach even with a simple approximation of the DFT PES. The MHM interfacial structure prediction method thus offers an efficient approach to understanding the grain boundaries and heterointerfaces at the atomic scale, providing an important prerequisite for effective materials design.

density functional theory↗
DOE OSTI2025

Estimation of intensity, footprint, and capacity of surface urban heat islands using a direction-enhanced adaptive synchronous extraction (DEASE) method

Here, the surface urban heat island (SUHI) effect, assessed through remotely sensed land surface temperature (LST), remains a focal point in urban climate research. Conventional indicators like SUHI intensity (SUHII) and footprint (SUHIF) capture peak values and spatial extent but fail to account for the cumulative thermal load—a critical dimension reflecting the total heat exposure imposed by spatially continuous warming, which directly limits a holistic assessment of ecological and societal impacts of the SUHI effect. Therefore, this study introduces an indicator termed SUHI capacity (SUHIC), designed to quantify the aggregated SUHI effect by integrating the magnitude of the warming signal across all affected areas, thereby enabling a more comprehensive evaluation of urban thermal environments. Furthermore, a direction-enhanced adaptive synchronous extraction (DEASE) method is proposed for the quantification of SUHIC. This method can dynamically identify the optimal background reference area based on the urban-rural LST gradients in various directions within the city, without relying on predefined mathematical models as previously. The results from 102 European cities first confirm that the directional variations in urban-rural LST gradients, and the DEASE method can effectively capture these distinctions for the simultaneous estimation of SUHII, SUHIF, and SUHIC. Secondly, the spatial patterns of absolute SUHIC values show strong associations with those of SUHIF (R2>0.86), while its relative values (normalized by the area of urban) align more closely with SUHII (R2 > 0.64). More importantly, SUHIC can serve as a crucial reference for assessing the urban thermal signal when SUHII and SUHIF diverge. The proposed method and framework contribute to standardizing the quantification of the SUHI effect.

Indicator↗
DOE OSTI2026

Physicochemical and Performance Characterization of Six Commercial Organic Solvent Nanofiltration Membranes

This work introduces a novel, gradient-free metamaterial design method based on Gaussian process regression to represent the density field of a unit cell. The dimension of the design space is determined by the covariance matrix dimension in the Gaussian process regression. We propose compressing this matrix using an autoencoder, enabling the decoder to generate the density field and effectively reduce the originally large design space to a lower-dimensional subspace. In this compressed space, we employ an active learning method, Bayesian Adaptive Direct Search (BADS), for efficient exploration of the design space. We demonstrate that for simple 2D designs aimed at maximizing unit cell stiffness, our method yields results comparable to those of standard topology optimization. Furthermore, we extend our approach to various mechanical problems, from linear elasticity to hyperelastic large deformation and elasto-plasticity under finite deformation, to 3D metamaterial design. This illustrates the method’s versatility and effectiveness across a range of applications.

Wu, Haoran↗
DOE OSTI2023

An adaptive sampling augmented Lagrangian method for stochastic optimization with deterministic constraints

The primary goal of this paper is to provide an efficient solution algorithm based on the augmented Lagrangian framework for optimization problems with a stochastic objective function and deterministic constraints. Our main contribution is combining the augmented Lagrangian framework with adaptive sampling, resulting in an efficient optimization methodology validated with practical examples. To achieve the presented efficiency, here we consider inexact solutions for the augmented Lagrangian subproblems, and through an adaptive sampling mechanism, we control the variance in the gradient estimates. Furthermore, we analyze the theoretical performance of the proposed scheme by showing equivalence to a gradient descent algorithm on a Moreau envelope function, and we prove sublinear convergence for convex objectives and linear convergence for strongly convex objectives with affine equality constraints. The worst-case sample complexity of the resulting algorithm, for an arbitrary choice of penalty parameter in the augmented Lagrangian function, is $\mathscr{O}$(ϵ -3-δ ) , where ϵ > 0 is the expected error of the solution and δ > 0 is a user-defined parameter. If the penalty parameter is chosen to be $\mathscr{O}$(ϵ -1 ), we demonstrate that the result can be improved to $\mathscr{O}$(ϵ -2 ) , which is competitive with the other methods employed in the literature. Moreover, if the objective function is strongly convex with affine equality constraints, we obtain $\mathscr{O}$(ϵ -1 log(1/ϵ)) complexity. Finally, we empirically verify the performance of our adaptive sampling augmented Lagrangian framework in machine learning optimization and engineering design problems, including topology optimization of a heat sink with environmental uncertainty.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

An adaptive discontinuous Petrov-Galerkin method for the Grad-Shafranov equation

In this work, we propose and develop an arbitrary-order adaptive discontinuous Petrov--Galerkin (DPG) method for the nonlinear Grad--Shafranov equation. An ultraweak formulation of the DPG scheme for the equation is given based on a minimal residual method. The DPG scheme has the advantage of providing more accurate gradients compared to conventional finite element methods, which is desired for numerical solutions to the Grad--Shafranov equation. The numerical scheme is augmented with an adaptive mesh refinement approach, and a criterion based on the residual norm in the minimal residual method is developed to achieve dynamic refinement. Nonlinear solvers for the resulting system are explored and a Picard iteration with Anderson acceleration is found to be efficient to solve the system. Finally, the proposed algorithm is implemented in parallel on MFEM using a domain-decomposition approach, and our implementation is general, supporting arbitrary order of accuracy and general meshes. Furthermore, numerical results are presented to demonstrate the efficiency and accuracy of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Efficient and flexible multirate temporal adaptivity

In this work we present two new families of multirate time step adaptivity controllers, that are designed to work with embedded multirate infinitesimal (MRI) time integration methods for adapting time steps when solving problems with multiple time scales. We compare these controllers against competing approaches on two benchmark problems, showing that the proposed methods offer dramatically improved performance and flexibility. The combination of embedded MRI methods and the proposed controllers enable adaptive simulations of problems with a potentially arbitrary number of time scales, achieving high accuracy while maintaining low computational cost. Additionally, we introduce a new set of embeddings for the family of explicit multirate exponential Runge–Kutta (MERK) methods of orders 2 through 5, resulting in the first-ever fifth-order embedded MRI method. Finally, we compare the performance of a wide range of embedded MRI methods on our benchmark problems to provide guidance on how to select an appropriate MRI method and multirate controller.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization

Here, we consider unconstrained stochastic optimization problems with no available gradient information. Such problems arise in settings from derivative-free simulation optimization to reinforcement learning. We propose an adaptive sampling quasi-Newton method where we estimate the gradients using finite differences of stochastic function evaluations within a common random number framework. We develop modified versions of a norm test and an inner product quasi-Newton test to control the sample sizes used in the stochastic approximations and provide global convergence results to the neighborhood of a locally optimal solution. We present numerical experiments on simulation optimization problems to illustrate the performance of the proposed algorithm. When compared with classical zeroth-order stochastic gradient methods, we observe that our strategies of adapting the sample sizes significantly improve performance in terms of the number of stochastic function evaluations required.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Unpaired image translation to mitigate domain shift in liquid argon time projection chamber detector responses

Deep learning algorithms often are developed and trained on a training dataset and deployed on test datasets. Any systematic difference between the training and a test dataset may severely degrade the final algorithm performance on the test dataset—what is known as the domain shift problem . This issue is prevalent in many scientific domains where algorithms are trained on simulated data but applied to real-world datasets. Typically, the domain shift problem is solved through various domain adaptation (DA) methods. However, these methods are often tailored for a specific downstream task, such as classification or semantic segmentation, and may not easily generalize to different tasks. This work explores the feasibility of using an alternative way to solve the domain shift problem that is not specific to any downstream algorithm. The proposed approach relies on modern Unpaired Image-to-Image (UI2I) translation techniques, designed to find translations between different image domains in a fully unsupervised fashion. In this study, the approach is applied to a domain shift problem commonly encountered in Liquid Argon Time Projection Chamber (LArTPC) detector research when seeking a way to translate samples between two differently distributed LArTPC detector datasets deterministically. This translation allows for mapping real-world data into the simulated data domain where the downstream algorithms can be run with much less domain-shift-related performance degradation. Conversely, using the translation from the simulated data to a real-world domain can increase the realism of the simulated dataset and reduce the magnitude of any systematic uncertainties. To evaluate the quality of the translations, we use both pixel-wise metrics and a downstream task to measure the effectiveness of UI2I methods for mitigating the domain shift problem. We adapted several popular UI2I translation algorithms to work on scientific data and demonstrated the viability of these techniques for solving the domain shift problem with LArTPC detector data. To facilitate further development of DA techniques for scientific datasets, the ‘Simple Liquid-Argon Track Samples’ dataset used in this study is also published.

97 MATHEMATICS AND COMPUTING↗