Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “ADAPTATION”

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 919 records · Page 51
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Adapter Signaling Evaluations on EVs [Slides]

In case J3400 and J3400/1 define a basic analog signaling approach for DC charging adapters to communicate over-temperature events to both the EV and EVSE. They also require the EV to implement mitigation and corrective actions in cases where the EVSE does not respond to adapter thermal signals. In this study, multiple production vehicles were evaluated for responsiveness to assess field readiness and ensure consistent performance in accordance with the SAE J1772, J3400 and J3400/1 standards. A series of test cases were developed and executed across different vehicles, using an adapter thermal breakout fixture designed by NLR for evaluations. The results revealed notable variations in behavior: some vehicles expected to comply with J1772 were found to be non-responsive under certain conditions. Additionally, while some EV OEMs appear to align with the J3400 standard, discrepancies exist due to its evolving nature, resulting in inconsistent implementation of the latest requirements. These findings highlight the need for alignment within standards organizations to ensure consistent interpretation, encourage compliance, and reduce potential confusion across implementations.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2021

An adaptive granular representative volume element model with an evolutionary periodic boundary for hierarchical multiscale analysis

The hierarchical multiscale analysis normally utilizes a microscopic representative volume element (RVE) model to capture path/history-dependent macroscopic responses instead of using phenomenological constitutive models. However, for problems involving large deformation, the current RVE model used in geomechanics may lose representative properties due to the progressive distortion of the RVE box, unless a proper reinitialization is applied. This work develops an adaptive RVE model in conjunction with an evolutionary periodic boundary (EPB) algorithm for hierarchical multiscale analysis of granular materials undergoing large deformation based on a recent RVE model proposed for coupling molecular dynamics and the material point method. The proposed adaptive RVE model avoids the reinitialization of the RVE box that even undergoes extremely large shear deformation; meanwhile, it accounts for the deformation history of the RVE model and treats the interaction between boundary particles and other image particles in a more efficient way. Numerical examples with extremely large deformation are used to illustrate the adaptive granular RVE model enhanced by the proposed EPB algorithm. Furthermore, some key features of this new methodology are further discussed for clarification.

42 ENGINEERING↗
DOE OSTI2021

Automatically adaptive stabilized finite elements and continuation analysis for compaction banding in geomaterials

Under compressive creep, viscoplastic solids experiencing internal mass transfer processes can accommodate singular cnoidal wave solutions as material instabilities at the stationary wave limit. These instabilities appear when the loading rate is significantly faster than the material's capacity to diffusive internal perturbations, leading to localized failure features (e.g., cracks and compaction bands). These cnoidal waves, generally found in fluids, have strong nonlinearities that produce periodic patterns. Due to the singular nature of the solutions, the applicability of the theory is currently limited. Additionally, practical simulation tools require proper regularization to overcome the challenges that singularity induces. We focus on the numerical treatment of the governing equation using a nonlinear approach building on a recent adaptive stabilized finite element method. This automatic refinement method provides an error estimate that drives mesh adaptivity, a crucial feature for the problem at hand. We compare the performance of this adaptive strategy against analytical and standard finite element solutions. We then investigate the sensitivity of the diffusivity ratio, the parameter controlling the process, and identify multiple possible solutions with several stress peaks. We also show the evolution of the spacing between peaks for all solutions as a function of that parameter.

42 ENGINEERING↗
DOE OSTI2023

Adaptive basis sets for practical quantum computing

Electronic structure calculations on small systems such as H 2 , H 2 O, LiH, and BeH 2 with chemical accuracy are still a challenge for the current generation of noisy intermediate-scale quantum (NISQ) devices. One of the reasons is that due to the device limitations, only minimal basis sets are commonly applied in quantum chemical calculations, which allows one to keep the number of qubits employed in the calculations at a minimum. However, the use of minimal basis sets leads to very large errors in the computed molecular energies as well as potential energy surface shapes. One way to increase the accuracy of electronic structure calculations is through the development of small basis sets better suited for quantum computing. In this work, we show that the use of adaptive basis sets, in which exponents and contraction coefficients depend on molecular structure, provides an easy way to dramatically improve the accuracy of quantum chemical calculations without the need to increase the basis set size and thus the number of qubits utilized in quantum circuits. As a proof of principle, we optimize an adaptive minimal basis set for quantum computing calculations on an H 2 molecule, in which exponents and contraction coefficients depend on the H—H distance, and apply it to the generation of H 2 potential energy surface on IBM-Q quantum devices. The adaptive minimal basis set reaches the accuracy of the double-zeta basis sets, thus allowing one to perform double-zeta quality calculations on quantum devices without the need to utilize twice as many qubits in simulations. This approach can be extended to other molecular systems and larger basis sets in a straightforward manner.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Target Detection via Cognitive Radars Using Change-Point Detection, Learning, and Adaptation

Many radar detection algorithms that assume a stationary environment (clutter) have been proposed and analyzed over the years. However, in practice, changes in the nonstationary environment can perturb the parameters of the clutter distribution, or even alter the clutter distribution family, which can greatly deteriorate the target detection capability. To avoid such potential performance degradation, cognitive radar systems are envisioned which are required to rapidly realize the nonstationarity, accurately learn the new characteristics of the environments, and adaptively update the detector. In this paper, aiming to develop a fully cognitive radar for target detection in nonstationary environments, we propose a unifying framework that integrates (i) change-point detection of clutter distributions by using a data-driven cumulative sum (CUSUM) algorithm and its extended version, (ii) learning/identification of clutter distribution by applying sparse theory and kernel density estimation methods, and (iii) adaptive target detection by automatically modifying the likelihood-ratio test and corresponding detection threshold. Further, with extensive numerical examples, we demonstrate the achieved improvements in detection performance due to the proposed framework in comparison to a nonadaptive case, an adaptive matched filter (AMF) method, and the clairvoyant case. Herein, we also use Wilcoxon rank-sum tests to evaluate the statistical significance of the performance improvements

42 ENGINEERING↗
DOE OSTI2020

An adaptive space-time phase field formulation for dynamic fracture of brittle shells based on LR NURBS

Here, we present an adaptive space-time phase field formulation for dynamic fracture of brittle shells. Their deformation is characterized by the Kirchhoff–Love thin shell theory using a curvilinear surface description. All kinematical objects are defined on the shell’s mid-plane. The evolution equation for the phase field is determined by the minimization of an energy functional based on Griffith’s theory of brittle fracture. Membrane and bending contributions to the fracture process are modeled separately and a thickness integration is established for the latter. The coupled system consists of two nonlinear fourth-order PDEs and all quantities are defined on an evolving two-dimensional manifold. Since the weak form requires C 1 -continuity, isogeometric shape functions are used. The mesh is adaptively refined based on the phase field using Locally Refinable (LR) NURBS. Time is discretized based on a generalized-α method using adaptive time-stepping, and the discretized coupled system is solved with a monolithic Newton–Raphson scheme. Finally, the interaction between surface deformation and crack evolution is demonstrated by several numerical examples showing dynamic crack propagation and branching.

42 ENGINEERING↗
DOE OSTI2020

A space-time parallel algorithm with adaptive mesh refinement for computational fluid dynamics

This work describes a space-time parallel algorithm with space-time adaptive mesh refinement (AMR). AMR with subcycling is added to multigrid reduction-in-time (MGRIT) in order to provide solution efficient adaptive grids with a reduction in work performed on coarser grids. This algorithm is achieved by integrating two software libraries: XBraid (Parallel time integration with multigrid. https://computation.llnl.gov/projects/parallel-timeintegration-multigrid) and Chombo (Chombo software package for AMR applications—design document, 2014). The former is a parallel time integration library using multigrid and the latter is a massively parallel structured AMR library. Employing this adaptive space-time parallel algorithm is Chord (Comput Fluids 123:202–217, 2015), a computational fluid dynamics (CFD) application code for solving compressible fluid dynamics problems. For the same solution accuracy, speedups are demonstrated from the use of space-time parallelization over the time-sequential integration on Couette flow and Stokes’ second problem. On a transient Couette flow case, at least a 1.5× speedup is achieved, and with a time periodic problem, a speedup of up to 13.7× over the time-sequential case is obtained. In both cases, the speedup is achieved by adding processors and exploring additional parallelization in time. The numerical experiments show the algorithm is promising for CFD applications that can take advantage of the time parallelism. Future work will focus on improving the parallel performance and providing more tests with complex fluid dynamics to demonstrate the full potential of the algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Climate science to inform adaptation policy: Heat waves over India in the 1.5°C and 2°C warmer worlds

Developing a better scientific understanding of anthropogenic climate change and climate variability, especially the prediction/projection of climate futures with useful temporal and geographical resolution and quantified uncertainties, and using that knowledge to inform adaptation planning and action will become crucially important in the coming years. Generating such policy-relevant knowledge may be particularly important for developing countries such as India. It is with this backdrop that, in this paper, we analyze future heat waves in India by using observations and a large number of model simulations of historical, + 1.5 °C, and + 2.0 °C warmer worlds. In both the future scenarios, there is an increased probability of heat waves during June and July when the Indian monsoon is in full swing and humidity is high, which makes the heat events even more of a health risk. While the highest temperatures in heat waves may not increase much in future climates, the duration and areal extent of the heat waves will most likely increase, leading to the emergence of new heat wave-prone zones in India. The results indicate that the joint frequencies of the longest duration and large area events could be nearly threefold greater in the + 1.5 °C and fivefold greater in the + 2.0 °C future scenarios compared to historical simulations. Thus, overall, the study indicates a substantial increase in the risk of heat events that typically elicit warnings from forecasters. The likely widespread and persistent nature of heat wave events in the future, as revealed by this study, will require planning and adaptation measures beyond the short-term disaster planning frameworks currently in place. Exploring what these measures might look like is beyond the scope of this study, but it underlines the importance of developing climate knowledge with high temporal and geographical resolution capable of informing adaptation policy and planning.

+1.5 °C and +2.0 °C↗
DOE OSTI2019

An adaptive Kriging surrogate method for efficient uncertainty quantification with an application to geological carbon sequestration modeling

We present that in numerical modeling of geological carbon sequestration (GCS), uncertainty quantification (UQ) is usually needed to evaluate the impact of uncertain model parameters on model predictions caused by limited measurements and incomplete knowledge of the parameters. However, UQ for GCS is computationally expensive due to the large ensemble of complex and lengthy model simulations. In this study, we propose an adaptive Kriging method to build a fast-to-evaluate surrogate of the GCS model to alleviate the heavy computational burden. The surrogate model is efficiently generated using a Taylor expansion-based adaptive experimental design algorithm that combines a distance-based exploration criterion and an exploitation criterion to adaptively search for informative training samples. In addition, we analyze the uncertainty brought by substituting the surrogate for the actual simulation model and explore its influence on UQ results. Lastly, our method is demonstrated in a synthetic GCS model and its performance is evaluated in comparison with the conventional Monte Carlo sampling. Results indicate that our method can greatly improve the computational efficiency in UQ and provide an effective and reliable UQ solution with the consideration of surrogate uncertainty.

58 GEOSCIENCES↗
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

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 OSTI2026

Harnessing citizen science to contextualize adaptation mechanism discovery

Species occupying broad geographic regions have evolved multiple mechanisms to regulate phenological characteristics, enabling adaptations to diverse native habitats. By developing computer vision AI to process citizen science observations across native habitats over North America, we uncovered a consistent latitudinal trend of earlier flowering at higher latitudes in warm-season perennial grasses. To explore the underlying mechanisms of adaptation, we conducted common garden experiments with one species (switchgrass) and discovered the opposite latitudinal flowering-time trend. Integration of differential plasticity of GI-Hd1-FTL1 haplotypes of flowering time regulatory genes, haplotype range, and local environmental profiles found that observations from native habitats capture only part of the genotype-environment-phenotype spectrum established in common garden experiments, therefore reconciling the discrepancy. Two mechanisms emerged as key forces shaping current haplotype ranges and influencing future shifts. Our study highlights the power of combining citizen science observations with designed experiments to uncover mechanisms of adaptation across spatiotemporal scales.

FTL1↗
DOE OSTI2022

Learning high-dimensional parametric maps via reduced basis adaptive residual networks

We propose a scalable framework for the learning of high-dimensional parametric maps via adaptively constructed residual network (ResNet) maps between reduced bases of the inputs and outputs. When just few training data are available, it is beneficial to have a compact parametrization in order to ameliorate the ill-posedness of the neural network training problem. By linearly restricting high-dimensional maps to informed reduced bases of the inputs, one can compress high-dimensional maps in a constructive way that can be used to detect appropriate basis ranks, equipped with rigorous error estimates. A scalable neural network learning framework is thus to learn the nonlinear compressed reduced basis mapping. Unlike the reduced basis construction, however, neural network constructions are not guaranteed to reduce errors by adding representation power, making it difficult to achieve good practical performance. Inspired by recent approximation theory that connects ResNets to sequential minimizing flows, we present an adaptive ResNet construction algorithm. This algorithm allows for depth-wise enrichment of the neural network approximation, in a manner that can achieve good practical performance by first training a shallow network and then adapting. We prove universal approximation of the associated neural network class for $L^2_v$ functions on compact sets. Our overall framework allows for constructive means to detect appropriate breadth and depth, and related compact parametrizations of neural networks, significantly reducing the need for architectural hyperparameter tuning. Numerical experiments for parametric PDE problems and a 3D CFD wing design optimization parametric map demonstrate that the proposed methodology can achieve remarkably high accuracy for limited training data, and outperformed other neural network strategies we compared against.

42 ENGINEERING↗
DOE OSTI2025

An adaptive and stability-promoting layerwise training approach for sparse deep neural network architecture

This work presents a two-stage adaptive framework for progressively developing deep neural network (DNN) architectures that generalize well for a given training data set. In the first stage, a layerwise training approach is adopted where a new layer is added each time and trained independently by freezing parameters in the previous layers. We impose desirable structures on the DNN by employing manifold regularization, sparsity regularization, and physics-informed terms. We introduce a ε – δ – stability-promoting concept as a desirable property for a learning algorithm and show that employing manifold regularization yields a ε – δ stability-promoting algorithm. Further, we also derive the necessary conditions for the trainability of a newly added layer and investigate the training saturation problem. In the second stage of the algorithm (post-processing), a sequence of shallow networks is employed to extract information from the residual produced in the first stage, thereby improving the prediction accuracy. Numerical investigations on prototype regression and classification problems demonstrate that the proposed approach can outperform fully connected DNNs of the same size. Moreover, by equipping the physics-informed neural network (PINN) with the proposed adaptive architecture strategy to solve partial differential equations, we numerically show that adaptive PINNs not only are superior to standard PINNs but also produce interpretable hidden layers with provable stability. As a result, we also apply our architecture design strategy to solve inverse problems governed by elliptic partial differential equations.

42 ENGINEERING↗
DOE OSTI2015

Distributed database kriging for adaptive sampling (D²KAS)

We present an adaptive sampling method supplemented by a distributed database and a prediction method for multiscale simulations using the Heterogeneous Multiscale Method. A finite-volume scheme integrates the macro-scale conservation laws for elastodynamics, which are closed by momentum and energy fluxes evaluated at the micro-scale. In the original approach, molecular dynamics (MD) simulations are launched for every macro-scale volume element. Our adaptive sampling scheme replaces a large fraction of costly micro-scale MD simulations with fast table lookup and prediction. The cloud database Redis provides the plain table lookup, and with locality aware hashing we gather input data for our prediction scheme. For the latter we use kriging, which estimates an unknown value and its uncertainty (error) at a specific location in parameter space by using weighted averages of the neighboring points. We find that our adaptive scheme significantly improves simulation performance by a factor of 2.5 to 25, while retaining high accuracy for various choices of the algorithm parameters.

36 MATERIALS SCIENCE↗
DOE OSTI2019

Composite matrix construction for structured grid adaptive mesh refinement

Structured-grid adaptive mesh refinement (SAMR) is an approach to mesh generation that supports structured access to data and adaptive mesh refinement for discretized partial differential equations (PDEs). Solution algorithms often require that an inverse of an operator be applied, a system of algebraic equations must be solved, and this process is often the primary computational cost in an application. SAMR is well suited to geometric multigrid solvers, which can be effective, but often do not adapt well to complex geometry including material coefficients. Algebraic multigrid (AMG) is more robust in the face of complex geometry, in both boundary conditions and internal material interfaces. AMG requires a stored matrix linearization of the operator. We discuss an approach, and an implementation in the Chombo block-structured AMR framework, for constructing composite grid matrices from a SAMR hierarchy of grids for use in linear solvers in the PETSc numerical library. We consider a case study with the Chombo-based BISICLES ice sheet modeling application.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A hybrid adaptive multiresolution approach for the efficient simulation of reactive flows

Computational studies that use block-structured adaptive mesh refinement (AMR) approaches suffer from unnecessarily high mesh resolution in regions adjacent to important solution features. This deficiency limits the performance of AMR codes. In this work a novel hybrid adaptive multiresolution (HAMR) approach to AMR-based calculations is introduced to address this issue. The multiresolution (MR) smoothness indicators are used to identify regions of smoothness on the mesh where the computational cost of individual physics solvers may be decreased by replacing direct calculations with interpolation. We suggest an approach to balance the errors due to the adaptive discretization and the interpolation of physics quantities such that the overall accuracy of the HAMR solution is consistent with that of the MR-driven AMR solution. The performance of the HAMR scheme is evaluated for a range of test problems, from pure hydrodynamics to turbulent combustion.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

AGFormer: Adaptive Spatiotemporal graph informed transformer for multi-reservoir inflow forecasting

Accurate reservoir inflow forecasting is crucial for effective water resource management, yet most machine learning models focus on single-reservoir prediction and overlook spatial dependencies among hydrologically connected reservoirs. Here, we propose AGFormer (Adaptive Graph-Informed Transformer), an end-to-end framework that integrates adaptive graph learning with temporal sequence modeling for multi-reservoir inflow forecasting. A shared encoder and graph attention mechanism generate reservoir-specific embeddings, which are then processed by the Transformer-based encoder–decoder for multi-step inflow forecasting. We also introduce a pretraining paradigm to learn robust temporal embeddings from misaligned historical records. Evaluated on 30 reservoirs in the Upper Colorado River Basin, AGFormer achieves superior seven-day-ahead forecasts, with NSE > 0.75 for 20 reservoirs—outperforming Encoder–Decoder LSTM, GCN+LSTM, and Transformer baselines. Adaptive graph learning captures dynamic inter-reservoir dependencies, and feature attribution aligns with snowmelt-driven hydrology. Incorporating forecasted meteorological inputs further enhances accuracy, demonstrating AGFormer’s potential to support reservoir management under dynamic hydrological conditions.

Adaptive graph learning↗