Search NASA⌕ Search

SEARCH · Search NASA

Results for “Fixed step size”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Accelerated Sparse Recovery via Gradient Descent with Nonlinear Conjugate Gradient Momentum

This paper applies an idea of adaptive momentum for the nonlinear conjugate gradient to accelerate optimization problems in sparse recovery. Specifically, we consider two types of minimization problems: a (single) differentiable function and the sum of a non-smooth function and a differentiable function. In the first case, we adopt a fixed step size to avoid the traditional line search and establish the convergence analysis of the proposed algorithm for a quadratic problem. This acceleration is further incorporated with an operator splitting technique to deal with the non-smooth function in the second case. As a result, we use the convex ι 1 and the nonconvex ι 1 – ι 2 functionals as two case studies to demonstrate the efficiency of the proposed approaches over traditional methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

An iterative dynamic chemical stiffness removal method for reacting flow simulations

Abstract An iterative dynamic chemical stiffness removal method (IDCSR) based on quasi-steady-state approximation (QSSA) is proposed. The IDCSR method is built on a previously developed non-iterative method which has proved to work well for small timestep sizes. A novel iterative procedure is designed in IDCSR to enable explicit time integration of stiff chemistry at relatively large timestep sizes relevant to practical reacting flow simulations. The effectiveness of the iterative procedure is first demonstrated with a toy problem and homogeneous auto-ignition with fixed integration step sizes, showing that larger timestep sizes can be allowed for explicit time integration using IDCSR compared with the previous non-iterative method. IDCSR is then compared with existing explicit chemistry solvers for simulations of homogeneous auto-ignition and shows similar or lower computational cost but significantly higher accuracy across a wide range of timestep sizes. IDCSR is further combined with an automatic adaptive time-stepping scheme for simulations of 0-D homogeneous auto-ignition and a 2-D laminar lifted n -dodecane jet flame. For the 0-D auto-ignition simulations, IDCSR is shown to reduce both the error (by 43%–90%) and computational cost (by 6–15 times) compared with existing explicit solvers, while achieving speed-up factors of up to 400 compared with VODE for a wide range of timestep sizes and reaction mechanisms. For the 2-D jet flame simulations, speed-up factors of 15 and 31 for chemistry integration, and 5 and 9 for overall simulation, are achieved by IDCSR compared with CVODE with and without analytic Jacobian, respectively.

Xu, Chao (ORCID:0000000153074159)↗
DOE OSTI2026

TANTE: Time-adaptive operator learning via neural Taylor expansion

Operator learning for time-dependent partial differential equations (PDEs) has seen rapid progress in recent years, enabling efficient approximation of complex spatiotemporal dynamics. However, most existing methods rely on fixed time step sizes during rollout, which limits their ability to adapt to varying temporal complexity and often leads to error accumulation. In this work, we propose the Time-Adaptive Transformer with Neural Taylor Expansion (TANTE), a novel operator-learning framework that produces continuous-time predictions with adaptive step sizes. TANTE predicts future states by performing a Taylor expansion at the current state, where neural networks learn both the higher-order temporal derivatives and the local radius of convergence. This allows the model to dynamically adjust its rollout based on the local behavior of the solution, thereby reducing cumulative error and improving computational efficiency. We demonstrate the effectiveness of TANTE across a wide range of PDE benchmarks, achieving superior accuracy and adaptability compared to fixed-step baselines, delivering accuracy gains of 60-80 % and speed-ups of 30-40 % at inference time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Necessary and sufficient conditions for quadratic stabilizability of switched systems on non-uniform time domains

In this paper, we consider the quadratic stabilizability via state feedback for a particular class of switched systems that evolve on a non-uniform time domain by introducing time scales theory. The system considered switches between a continuous-time subsystem with variable lengths and a discrete-time subsystem with variable discrete step sizes. Necessary and sufficient conditions are derived to guarantee the quadratic stability of this class of switched systems via a switching state feedback law based on the existence of a common positive definite matrix satisfying the quadratic stabilizability condition by considering that the two subsystems are unstable. By state feedback, we mean that the switching among subsystems depends on the system states. Current results for this kind of state switching feedback control are derived only for switched systems evolving on a continuous time domain or a discrete time domain with fixed step’s size. These results are not applicable for the particular class of switched systems where there is a mixing between the continuous and discrete dynamics. This motivates the derivation of a new and more general state feedback control law for switched systems in this work. Here, a numerical example illustrating the results is presented.

42 ENGINEERING↗
DOE OSTI2024

AIRES-NODE

This software package performs time series forecasting for engineering systems using neural controlled differential equations. Neural controlled differential equations are continuous time analogues to recurrent neural networks. AIRES-NODE is particularly well suited for dynamic systems which are subject to external forcing terms and time-dependent boundary conditions. AIRES-NODE provides an encoder-decoder architecture which allows for variable-length forecasts to be made and is not limited to a fixed time step size when forecasting. Additionally, by utilizing a novel combination of a variational autoencoder and neural controlled differential equations, the AIRES-NODE package is capable of producing probabilistic future forecasts.

Gurecky, William [Oak Ridge National Laboratory (O↗
DOE OSTI2025

Stability analysis of the Eulerian–Lagrangian finite volume methods for nonlinear hyperbolic equations in one space dimension

In this paper, we construct a novel Eulerian–Lagrangian finite volume (ELFV) method for nonlinear scalar hyperbolic equations in one space dimension. It is well known that the exact solutions to such problems may contain shocks though the initial conditions are smooth, and direct numerical methods may suffer from restricted time step sizes. To relieve the restriction, we propose an ELFV method, where the space-time domain was separated by the partition lines originated from the cell interfaces whose slopes are obtained following the Rakine–Hugoniot junmp condition. Unfortunately, to avoid the intersection of the partition lines, the time step sizes are still limited. To fix this gap, we detect effective troubled cells (ETCs) and carefully design the influence region of each ETC, within which the partitioned space-time regions are merged together to form a new one. Then with the new partition of the space-time domain, we theoretically prove that the proposed first-order scheme with Euler forward time discretization is total-variation-diminishing and maximum-principle-preserving with at least twice larger time step constraints than the classical first order Eulerian method for Burgers’ equation. Numerical experiments verify the optimality of the designed time step sizes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Deep Symbolic Optimization for Electric Component Sizing in Fixed Topology Power Converters

Power converters (PC) are a major component in any current electronic hardware device. The development and design is usually guided by expert knowledge and heavily relies on human intuition and experience. The process is a very time consuming and costly activity and it is generally hard to improve upon current designs. As a first step towards autonomous PC design, we are here proposing a new framework for the sizing of components for fixed topology PCs based on given design requirements. To this end, we developed surrogate models for rapid evaluation of new topologies and adapt the deep symbolic optimization (DSO) framework to generate new topologies guided by a reinforcement learning training signal. In an empirical evaluation, we show that our DSO based approach is able to find the optimal configuration for all investigated topologies, while reducing the learning time by at least a factor of 100 compared to popular RL algorithms.

Xue, Lincoln↗
DOE OSTI2025

Feature engineering descriptors, transforms, and machine learning for grain boundaries and variable-sized atom clusters

Abstract Obtaining microscopic structure-property relationships for grain boundaries is challenging due to their complex atomic structures. Recent efforts use machine learning to derive these relationships, but the way the atomic grain boundary structure is represented can have a significant impact on the predictions. Key steps for property prediction common to grain boundaries and other variable-sized atom clustered structures include: (1) describing the atomic structure as a feature matrix, (2) transforming the variable-sized feature matrix to a fixed length common to all structures, and (3) applying a machine learning algorithm to predict properties from the transformed matrices. We examine how these steps and different combinations of engineered features impact the accuracy of grain boundary energy predictions using a database of over 7000 grain boundaries. Additionally, we assess how different engineered features support interpretability, offering insights into the physics of the structure-property relationships.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Global error analysis of the Chebyshev rational approximation method

The Chebyshev rational approximation method (CRAM) has become a widely adopted method for solving nuclear depletion problems. Therefore, understanding CRAM’s accuracy is important for the safe operation of nuclear power plants. This article performs a global error analysis of CRAM and finds that, as the length of the time step approaches zero, the relative error measured between the exact and CRAM solutions at a fixed end time approaches one and infinity for even and odd orders, respectively; for intermediate time step sizes, a minimum in relative error is observed. Finally, we show that the reason for CRAM’s behavior is that the method is inconsistent. Two best practices for using CRAM, derived from these results, are: (1) use CRAM order 16 or higher, (2) if necessary, increase the CRAM order when multiphysics coupling requires smaller time steps.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Adaptive time stepping for the two-time integro-differential Kadanoff-Baym equations

The nonequilibrium Green's function gives access to one-body observables for quantum systems. Of particular interest are quantities such as density, currents, and absorption spectra which are important for interpreting experimental results in quantum transport and spectroscopy. We present an integration scheme for the Green's function's equations of motion, the Kadanoff-Baym equations (KBE), which is both adaptive in the time integrator step size and method order as well as the history integration order. We analyze the importance of solving the KBE self-consistently and show that adapting the order of history integral evaluation is important for obtaining accurate results. To examine the efficiency of our method, we compare runtimes to a state-of-the-art fixed time step integrator for several test systems and show an order of magnitude speedup at similar levels of accuracy. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

WavPool: A New Block for Deep Neural Networks

Modern deep neural networks comprise many operational layers, such as dense or convolutional layers, which are often collected into blocks. In this work, we introduce a new, wavelet-transform-based network architecture that we call the multi-resolution perceptron: by adding a pooling layer, we create a new network block, the WavPool. The first step of the multi-resolution perceptron is transforming the data into its multi-resolution decomposition form by convolving the input data with filters of fixed coefficients but increasing size. Following image processing techniques, we are able to make scale and spatial information simultaneously accessible to the network without increasing the size of the data vector. WavPool outperforms a similar multilayer perceptron while using fewer parameters, and outperforms a comparable convolutional neural network by ~ 10% on relative accuracy on CIFAR-10.

McDermott, Samuel D.↗
DOE OSTI2021

Calculation of permanent magnet arrangements for stellarators: a linear least-squares method

A problem arising in several engineering areas is to design magnets outside a volume that produce a desired magnetic field inside it. One instance of this problem is stellarator design, where it has recently been shown that permanent magnets can provide the required shaping of the magnetic field. Here we demonstrate a robust and efficient algorithm REGCOIL_PM to calculate the spatial distribution of these permanent magnets. The procedure involves a small number of fixed-point iterations, with a linear least-squares problem solved at each step. Furthermore, the method exploits the Biot–Savart Law's exact linearity in magnetization density and approximate linearity in magnet size, for magnets far from the target region. No constraint is placed on the direction of magnetization, so Halbach solutions are found naturally, and the magnitude of the magnetization can be made uniformly equal to a target value.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

On the numerical sensitivity of cellular automata grain structure predictions to large thermal gradients and cooling rates

Cellular automata (CA) models of as-solidified grain structure, originally developed and applied to casting, have become a common means of predicting grain structure resulting from Additive Manufacturing (AM) processes. The majority of these models are based on the decentered octahedron approach, which attempts to correct for the effect of grid anisotropy on the prediction of competitive solidification of dendritic grains. However, AM solidification occurs under cooling rates ($\dot{T}$) and thermal gradients (G) that are orders of magnitude larger than those encountered in casting, and no systematic investigation on the effect of the CA model cell size (Δx) and time step (Δt) on AM microstructure predictions has been performed. Here, in this study, such an investigation is first performed via simulation of individual grains of various crystallographic orientations with a fixed, unidirectional G, showing that CA prediction of the steady-state undercooling matched the expected values based on the interfacial response function at small G and deviated from the expected values at large G. Simulation of competitive growth of multiple grains showed a weakening of the predicted texture as G and Δx became large. Simulation of solidification under AM conditions, where G and $\dot{T}$ vary spatially across the melt pools, showed that not only does grain selection weaken and deviate from expectations at large Δx, but grains with crystallographic $\langle$100$\rangle$ aligned with the grid directions are more adversely affected by the temperature field discontinuities than grains with other crystallographic orientations. Despite the fact that the exact grain competition results depended on Δt, the overall texture development was notably less sensitive to Δt than Δx, provided that a reasonable value of Δt is selected based on the ratio of Δx to the maximum local solidification velocity in the simulation domain. Finally, from the directional solidification and AM simulation results, an analysis of computational cost compared to simulation resolution is performed based on an equation derived to quantify the relatively inaccuracy in grain selection based on the model and temperature field inputs. From this analysis, it is concluded that there is a need for algorithmic improvements to improve CA grain competition accuracy for large G processing conditions as sufficiently small Δx to resolve the necessary competition is intractable for many AM processing conditions.

36 MATERIALS SCIENCE↗
DOE OSTI2020

SubTSBR to tackle high noise and outliers for data-driven discovery of differential equations

Data-driven discovery of differential equations has been an emerging research topic. We propose a novel algorithm subsampling-based threshold sparse Bayesian regression (SubTSBR) to tackle high noise and outliers. The subsampling technique is used for improving the accuracy of the Bayesian learning algorithm. It has two parameters: subsampling size and the number of subsamples. When the subsampling size increases with fixed total sample size, the accuracy of our algorithm goes up and then down. When the number of subsamples increases, the accuracy of our algorithm keeps going up. We demonstrate how to use our algorithm step by step and compare our algorithm with threshold sparse Bayesian regression (TSBR) for the discovery of differential equations. We show that our algorithm produces better results. We also discuss the merits of discovering differential equations from data and demonstrate how to discover models with random initial and boundary condition as well as models with bifurcations. The numerical examples are: (1) predator-prey model with noise, (2) shallow water equations with outliers, (3) heat diffusion with random initial and boundary condition, and (4) fish-harvesting problem with bifurcations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Feature-Based PMU Event Classification under Variable PMU Participation and Overlapping Events

Danovo Energy Solution's presented its paper named: Feature-Based PMU Event Classification under Variable PMU Participation and Overlapping Events at the 2026 Georgia Tech Fault & Disturbance Analysis Conference. The full paper can be found at OSTI ID# 3169150 Paper Abstract—Phasor Measurement Units (PMUs) stream time synchronized, high-resolution measurements from the grid, enabling data-driven techniques for event detection and classification. Accurate event classification improves grid reliability and stability. Events can be detected by varying numbers of PMUs and exhibit different durations depending on the event type. This variability challenges standard classifiers that require uniform input sizes. Moreover, multiple events may coincide, which increases classification complexity. Standard classifiers assign each instance to the class with the highest predicted probability, whereas overlapping events may exhibit comparable probabilities across multiple classes. In this study, to handle data size variability, we extract a wide range of time–frequency domain features from all available PMUs for each event into a fixed-length vector, facilitating the application of standard machine learning classifiers, including Random Forest, XGBoost, LightGBM, Support Vector Machine, and Multilayer Perceptron. To account for overlapping events, a probabilistic post-processing step is applied. For a given data instance, if multiple predicted class probabilities exceed 30% and the differences between them are less than 10%, the event is assigned to multiple classes. Experiments using real-world PMU data demonstrate that the Random Forest and XGBoost models achieve the highest accuracy, while the proposed post-processing method yields perfect classification performance on external unseen test sets.

Nematirad, Reza [Danova Energy Solutions]↗
DOE OSTI2026

Feature-Based PMU Event Classification under Variable PMU Participation and Overlapping Events

This paper is the basis for a presentation help at the 2026 Georgia Tech Fault & Disturbance Analysis Conference, which can be found at OSTI # 3168287 Paper Abstract—Phasor Measurement Units (PMUs) stream time synchronized, high-resolution measurements from the grid, enabling data-driven techniques for event detection and classification. Accurate event classification improves grid reliability and stability. Events can be detected by varying numbers of PMUs and exhibit different durations depending on the event type. This variability challenges standard classifiers that require uniform input sizes. Moreover, multiple events may coincide, which increases classification complexity. Standard classifiers assign each instance to the class with the highest predicted probability, whereas overlapping events may exhibit comparable probabilities across multiple classes. In this study, to handle data size variability, we extract a wide range of time–frequency domain features from all available PMUs for each event into a fixed-length vector, facilitating the application of standard machine learning classifiers, including Random Forest, XGBoost, LightGBM, Support Vector Machine, and Multilayer Perceptron. To account for overlapping events, a probabilistic post-processing step is applied. For a given data instance, if multiple predicted class probabilities exceed 30% and the differences between them are less than 10%, the event is assigned to multiple classes. Experiments using real-world PMU data demonstrate that the Random Forest and XGBoost models achieve the highest accuracy, while the proposed post-processing method yields perfect classification performance on external unseen test sets.

Nematirad, Reza [Danovo Energy Solutions]↗
DOE OSTI2020

Skyrmion dynamics and topological sorting on periodic obstacle arrays

Abstract We examine skyrmions under a dc drive interacting with a square array of obstacles for varied obstacle size and damping. When the drive is applied in a fixed direction, we find that the skyrmions are initially guided in the drive direction but also move transverse to the drive due to the Magnus force. The skyrmion Hall angle, which indicates the difference between the skyrmion direction of motion and the drive direction, increases with drive in a series of quantized steps as a result of the locking of the skyrmion motion to specific symmetry directions of the obstacle array. On these steps, the skyrmions collide with an integer number of obstacles to create a periodic motion. The transitions between the different locking steps are associated with jumps or dips in the velocity–force curves. In some regimes, the skyrmion Hall angle is actually higher than the intrinsic skyrmion Hall angle that would appear in the absence of obstacles. In the limit of zero damping, the skyrmion Hall angle is 90°, and we find that it decreases as the damping increases. For multiple interacting skyrmion species in the collective regime, we find jammed behavior at low drives where the different skyrmion species are strongly coupled and move in the same direction. As the drive increases, the species decouple and each can lock to a different symmetry direction of the obstacle lattice, making it possible to perform topological sorting in analogy to the particle sorting methods used to fractionate different species of colloidal particles moving over two-dimensional obstacle arrays.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Full time-dependent SOLPS-ITER simulation of the SPARC tokamak: actuator design for particle and divertor condition control *

Abstract This paper presents the application of full time-dependent SOLPS-ITER simulations for actuator design in the SPARC tokamak. This study employs both the EIRENE module, a neutral solver, and the B2.5 plasma module in a time-dependent mode. This is in contrast to most SOLPS simulations, which focus on steady-state solutions, where the neutral distribution is evolved without any time limit or for a time step of 1 ⋅ 10 − 3 second, which is several orders of magnitude larger than the fluid plasma time step. The time-dependent EIRENE was tested with a fixed B2.5 background and compared with a simple conductance based model in a simplified pump chamber geometry. This comparison aimed to verify the reliability of the neutral relaxation timescale derived from the time-dependent EIRENE. Subsequently, a full time-dependent simulation was performed in a realistic geometry, with the Monte-Carlo neutral time step synchronized with the plasma fluid time step. The numerical setup of the code, including relative time steps and the size of the census data used to store Monte-Carlo particle information is considered. The full-time dependent simulations are then applied to inform the design of the SPARC louver structure, which affects divertor plasma parameters by regulating the neutral conductance from the divertor to the pump. The response of the plasma and neutral parameters was captured on a timescale that enables the design of the actuator to consider time-dependent control capability. It was found that changing the louver opacity has an equivalent effect as varying the gas throughput via puff actuation. Therefore, equivalent divertor plasma conditions can be obtained from both actuators, while the neutral pressure distribution in the pump and divertor differs for each actuator.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗