Search NASA⌕ Search

SEARCH · Search NASA

Results for “Adaptive integration”

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 19 records

Integrating adaptive learning with post hoc model explanation and symbolic regression to build interpretable surrogate models

Abstract We develop a materials informatics workflow to build an interpretable surrogate model for micromagnetic simulations. Our goal is to predict the energy barrier of a moving isolated skyrmion in rare-earth-free $$\hbox {Mn}_4$$ Mn 4 N. Our approach integrates adaptive learning with post hoc model explanation and symbolic regression methods. We discuss an unexplored acquisition function (information condensing active learning) within the adaptive learning loop and compare it with the known standard deviation function for efficient navigation of the search space. Model-agnostic post hoc explanation techniques then uncover trends learned by the trained model, which we then leverage to constrain the expressions used for symbolic regression. Graphical abstract

Biswas, Ankita↗

Boosting efficiency and reducing graph reliance: Basis adaptation integration in Bayesian multi-fidelity networks

The computational cost of high-fidelity numerical models makes outer-loop analysis, which requires repeated interrogation of the model such as uncertainty quantification, computationally demanding. Multi-fidelity methods, which construct a surrogate model using data from an ensemble of models of varying cost and accuracy, can substantially reduce the cost of outer-loop analysis. However, these methods can be difficult to apply when the model ensemble does not admit a clear hierarchy a priori and the correlations between models are low. Consequently, in this paper, we present a multi-fidelity method that leverages dimension reduction to enhance the correlation between models, thereby reducing the amount of data needed to train a surrogate from an unordered ensemble of models. Our method utilizes basis adaptation to build low-dimensional polynomial chaos expansions of each model and employs Multi-fidelity Networks to encode the relationships among models. We show that the resulting method exhibit two notable advantages over its counterpart: (1) enhanced accuracy (both reduced bias and variance); and (2) reduced dependency on the graph structure encoding relationships among models. We demonstrate the approach on an analytical test problem and a challenging finite element model for a spent nuclear fuel. Our method produces a surrogate model that is significantly more accurate than either a single-fidelity surrogate or a multi-fidelity surrogate constructed without basis adaptation.

42 ENGINEERING↗

Moment-based adaptive time integration for thermal radiation transport

Here, in this paper we develop a framework for moment-based adaptive time integration of deterministic multifrequency thermal radiation transpot (TRT). We generalize our recent semi-implicit-explicit (IMEX) integration framework for gray TRT to multifrequency TRT, and also introduce a semi-implicit variation that facilitates higher-order integration of TRT, where each stage is implicit in all components except opacities. To appeal to the broad literature on adaptivity with Runge–Kutta methods, we derive new embedded methods for four asymptotic preserving IMEX Runge–Kutta schemes we have found to be robust in our previous work on TRT and radiation hydrodynamics. We then use a moment-based high-order-low-order representation of the transport equations. Due to the high dimensionality, memory is always a concern in simulating TRT. We form error estimates and adaptivity in time purely based on temperature and radiation energy, for a trivial overhead in computational cost and memory usage compared with the base second order integrators. We then test the adaptivity in time on the tophat and Larsen problem, demonstrating the ability of the adaptive algorithm to naturally vary the timestep across 4–5 orders of magnitude, ranging from the dynamical timescales of the streaming regime to the thick diffusion limit.

97 MATHEMATICS AND COMPUTING↗

A Multi-Model, Multi-Scale Research Program in Stressors, Responses, and Coupled Systems Dynamics at the Energy-Water-Land Nexus and for Concentrated, Interdependent Infrastructures: Toward Next Generation Capabilities in Integrated Impacts, Adaptation, and Vulnerability (I-IAV) Modeling and a Community of Practice

The goal of this research program was to build a next generation integrated suite of science-driven modeling and analytic capabilities, and a more expanded and connected community of practice, for analyses of the stressors, impacts, adaptations and vulnerabilities of global and regional change. The emphasis was on understanding energy-water-land interactions and feedbacks and interdependent infrastructures at appropriate regional and temporal scales. Although the scope spans many complex facets of data, modeling, and analysis, as well as scales appropriate for integrated impacts and adaptation research, the focus of this effort was the development of multi-model, multi-scale capabilities spanning the domains of Multi-Sector Dynamics (MSD) models; Impact, Adaptation, and Vulnerability (IAV) models; and Earth System Models (ESMs).

54 ENVIRONMENTAL SCIENCES↗

Adaptable Technology Integration for Enhanced Worker Safety and Efficiency within the SPD Gloveboxes [Slides]

Surplus Plutonium Disposition (SPD) Overview: (1) Application Background – Location: Savannah River Site, Aiken, South Carolina – High backlog of plutonium material to process – Parallel lines of gloveboxes – Highly manual operations requiring full PPE and reader/worker steps; (2) Development Scope – Development of automated processes and opportunities to provide robust engineering design alternatives for baseline design that would meet process improvement goals.

61 RADIATION PROTECTION AND DOSIMETRY↗

Demographic Microsimulator for Integrated Urban Systems: Adapting Panel Survey of Income Dynamics to Capture the Continuum of Life

Agent-based models (ABMs) in transportation modeling simulate activity and travel decisions at the disaggregate level of households and individuals. To do this, ABMs require detailed and realistic information on agents’ socioeconomic and demographic characteristics. Various synthetic population generators have been proposed to address this need. However, most of those currently in practice are cross-sectional in nature and do not account for the dynamics within households and individuals as they progress through life events over time. This is a major shortcoming, as literature has shown that transportation decisions are affected by the transition between and co-occurrence of life cycle events. While some demographic evolution simulators have been proposed to address this issue, they are developed using cross-sectional data and capture only a small set of life cycle events and their interdependence. Addressing these drawbacks, we propose a demographic microsimulator (DEMOS) that captures the “continuum of life” by considering a range of household- and individual-level life cycle events. DEMOS is developed using the Panel Survey of Income Dynamics, one of the world’s longest-running longitudinal surveys. The DEMOS submodels consider key life cycle events that are influenced by agents’ demographic variables. DEMOS is applied to evolve the population of the San Francisco Bay Area over a 9-year horizon. Results demonstrate how DEMOS generates life trajectories and how DEMOS outputs match the observed demographic trends. DEMOS is expected to enable longitudinal analysis in the context of ABMs and expand ABMs analyses relating to dynamic processes such as household-level vehicle transactions.

Demographic evolution↗

Surf-Deformer: Mitigating Dynamic Defects on Surface Code via Adaptive Deformation

In this paper, we introduce Surf-Deformer, a code deformation framework that seamlessly integrates adaptive defect mitigation functionality into the current surface code workflow. It crafts several basic deformation instructions based on fundamental gauge transformations, which can be combined to explore a larger design space than previous methods. This enables more optimized deformation processes tailored to specific defect situations, restoring the QEC capability of deformed codes more efficiently with minimal qubit resources. Additionally, we design an adaptive code layout that accommodates our defect mitigation strategy while ensuring efficient execution of logical operations. Our evaluation shows that Surf-Deformer outperforms previous methods by significantly reducing the end-to-end failure rate of various quantum programs by 35× to 70×, while requiring only about 50% of the qubit resources compared to the previous method to achieve the same level of failure rate. Ablation studies show that Surf-Deformer surpasses previous defect removal methods in preserving QEC capability and facilitates surface code communication by achieving nearly optimal throughput.

Yin, Keyi↗

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↗

Derivative-free stochastic optimization via adaptive sampling strategies

In this paper, we present a novel derivative-free framework for solving unconstrained stochastic optimization problems. Many problems in fields ranging from simulation optimization to reinforcement learning to quantum computing involve settings where only stochastic function values are obtained via a zeroth-order oracle, which has no available gradient information and necessitates the usage of derivative-free optimization methodologies. Our approach includes estimating gradients using stochastic function evaluations and integrating adaptive sampling techniques to control the accuracy in these stochastic approximations. Our framework encapsulates several gradient estimation techniques, including standard finite-difference, Gaussian smoothing, sphere smoothing, randomized coordinate finite-difference, and randomized subspace finite-difference methods. We provide theoretical convergence guarantees for our framework and analyze the worst-case iteration and sample complexities associated with each gradient estimation method. Finally, we demonstrate the empirical performance of the methods on logistic regression and nonlinear least squares problems.

Adaptive sampling↗

NanoPSD: A software for automatic detection of Nano-Particle Shape Distribution in electron microscopy images

Accurate quantification of the size and morphology of nanoparticles from electron microscopy (EM) images is essential to understand growth mechanisms, surface reactivity, and functional behavior in nanoscale materials. Manual analysis remains slow, subjective, and difficult to reproduce in large datasets. We introduce NanoPSD (Nano-Particle Shape Distribution), an open-source and fully automated framework for quantitative particle detection and morphology analysis from EM images. NanoPSD integrates adaptive contrast enhancement, polarity-agnostic scale-bar detection, Optical Character Recognition (OCR)-based calibration, and classical segmentation via Otsu thresholding with morphological refinement. Particle contours are used to extract geometric descriptors, including equivalent circular diameter, aspect ratio, circularity, and solidity, enabling automated classification into spherical, rod-like, and aggregate morphologies. The framework supports both single-image and batch processing, generating publication-quality visualizations, LaTeX-ready tables, and structured comma-separated values (CSV) datasets. As a demonstration, we applied NanoPSD to plasma-synthesized nanoparticle samples diagnosed via transmission electron microscopy (TEM). The code produced statistically robust size and morphology distributions spanning a few to tens of nanometers with minimal user supervision. The pipeline demonstrates high reproducibility and scalability, processing large image collections with consistent calibration and output formatting. Its modular design enables seamless integration of future deep-learning-based segmentation models, providing a pathway toward intelligent, data-driven electron microscopy analysis.

36 MATERIALS SCIENCE↗

PhILMs: Collaboratory on Mathematics and Physics-Informed Learning Machines for Multiscale and Multiphysics Problems

The landscape of computational science and engineering is continually evolving, with the challenge of high-dimensional regression problems standing as a significant hurdle in numerous scientific endeavors. Addressing this challenge, our research, funded by this award, has led to the development of an innovative computational framework known as Probabilistic Partition of Unity Networks (PPOU-Nets). This initiative represents a collaborative effort to harness the potential of mathematics and physics-informed machine learning in tackling multiscale and multiphysics problems prevalent in high-dimensional spaces. Through this work, we have proposed a novel methodology that seamlessly integrates adaptive dimensionality reduction and a mixture of experts model, thereby facilitating a more efficient and accurate approximation of complex functions. This research effort has not only advanced the state of computational science but also opened new avenues for exploration in quantum computing and beyond. This report outlines the motivation, methodology, key findings, and implications of our work, underscoring our contributions to the broader scientific community and the potential pathways for future research.

97 MATHEMATICS AND COMPUTING↗

Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients

Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗

Methods integrating innate and adaptive immune responses in human in vitro immunization assays

Rapid vaccine development and innovative immunotherapeutics are critical in the fight against emerging outbreaks and global pandemic threats, yet the high costs and prolonged timelines for developing new vaccines underscore the urgent need for robust, predictive pre-clinical testing platforms. The rapid down-selection of vaccine candidates and identification of optimal vaccine formulations can be performed using human in vitro immunization (IVI) assays that recapitulate the complex interactions of the innate and adaptive human immune response. In this review, we present a comprehensive evaluation of three key IVI platforms: the whole blood assay (WBA), monocyte-derived dendritic cell (MoDC) assay with dendritic cell-T cell interface assay (DTI), and the microphysiological human tissue construct assay (HTC). The WBA offers a cost-effective and straightforward approach, while the MoDC + DTI system represents the current gold standard for balancing experimental efficiency with immunological complexity. The HTC assay, by mimicking both spatial and temporal aspects of immune interactions, provides enhanced physiological relevance. We discuss the methodological advantages and limitations of each platform, explore their roles in rapid vaccine candidate screening, and propose strategies for integrating these assays with complementary in vivo models. These insights pave the way for refining IVI assays and accelerating the translational pipeline for next-generation vaccines and immunotherapies.

59 BASIC BIOLOGICAL SCIENCES↗

Demographic Microsimulator for Integrated Urban Systems: Adapting Panel Survey of Income Dynamics to Capture the Continuum of Life

Agent-based models (ABMs) simulate activity and travel decisions at the disaggregate level of households, and individuals. To do this, ABMs require detailed information pertaining to socioeconomic and demographic characteristics of individuals. Various synthetic population generators (SPGs) have been proposed to address this need. However, most of the SPGs currently in practice are cross-sectional in nature, and do not account for the interrelationships among household's or individual's life progression. This is a major shortcoming of SPGs as literature has shown that transportation decisions are impacted by lifecycle events that unfold over a span of time. While some demographic evolution simulators have been proposed to address this shortcoming, they: i) are developed using cross-sectional data, ii) do not capture the full spectrum of lifecycle events and their interdependency. Overcoming these drawbacks, this paper proposes a Demographic Microsimulator (DEMOS) which captures the 'continuum of life' by accounting for a range of household-, and individual-level lifecycle events. DEMOS is developed using the Panel Survey of Income Dynamics, which is one of the world's longest running longitudinal surveys. DEMOS sub-models consider key lifecycle events which are influenced by a host of demographic variables. The whole framework is applied to evolve the population of San Francisco Bay Area over a 9-year horizon. Results indicate that the household and individual evolution are tightly connected, and that the structural framework (i.e., model sequencing) is a key element in capturing the population trend accurately.

ADVANCED PROPULSION SYSTEMS,ENERGY PLANNING, POLIC↗

Advancing simulations of coupled electron and phonon nonequilibrium dynamics using adaptive and multirate time integration

Electronic structure calculations in the time domain provide a deeper understanding of nonequilibrium dynamics in materials. The real-time Boltzmann equation (rt-BTE), used in conjunction with accurate interactions computed from first principles, has enabled reliable predictions of coupled electron and lattice dynamics. However, the timescales and system sizes accessible with this approach are still limited, with two main challenges being the different timescales of electron and phonon interactions and the cost of computing collision integrals. As a result, only a few examples of these calculations exist, mainly for two-dimensional (2D) materials. Here we leverage adaptive and multirate time integration methods to achieve a major step forward in solving the coupled rt-BTEs for electrons and phonons. Relative to conventional (non-adaptive) time-stepping, our approach achieves a 10x speedup for a target accuracy, or greater accuracy by 3–6 orders of magnitude for the same computational cost, enabling efficient calculations in both 2D and bulk materials. This efficiency is showcased by computing the coupled electron and lattice dynamics in graphene up to ~100 ps, as well as modeling ultrafast lattice dynamics and thermal diffuse scattering maps in bulk materials (silicon and gallium arsenide). In addition to improved efficiency, our adaptive method can resolve the characteristic rates of different physical processes, thus naturally bridging different timescales. This enables simulations of longer timescales and provides a framework for modeling multiscale dynamics of coupled degrees of freedom in matter. Our work opens new opportunities for quantitative studies of nonequilibrium physics in materials, including driven lattice dynamics with phonons coupled to electrons, spin, and other degrees of freedom.

Yao, Jia [California Institute of Technology (CalT↗