Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “stability and convergence”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Examination of Semi-Analytical Solution Methods in the Coarse Operator of Parareal Algorithm for Power System Simulation

With continuing advances in high-performance parallel computing platforms, parallel algorithms have become powerful tools for development of faster than real-time power system dynamic simulations. In particular, it has been demonstrated in recent years that parallel-in-time (Parareal) algorithms have the potential to achieve such an ambitious goal. Here, the selection of a fast and reasonably accurate coarse operator of the Parareal algorithm is crucial for its effective utilization and performance. This paper examines semi-analytical solution (SAS) methods as the coarse operators of the Parareal algorithm and explores performance of the SAS methods to the standard numerical time integration methods. Two promising time-power series-based SAS methods were considered; Adomian decomposition method and Homotopy analysis method with a windowing approach for improving the convergence. Numerical performance case studies on 10-generator 39-bus system and 327-generator 2383-bus system were performed for these coarse operators over different disturbances, evaluating the number of Parareal iterations, computational time, and stability of convergence. All the coarse operators tested with different scenarios have converged to the same corresponding true solution (if they are convergent) and the SAS methods provide comparable computational speed, while having more stable convergence to the true solution in many cases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

The second-generation Shifted Boundary Method and its numerical analysis

Recently, the Shifted Boundary Method (SBM) was proposed within the class of unfitted (or immersed, or embedded) finite element methods. By reformulating the original boundary value problem over a surrogate (approximate) computational domain, the SBM avoids integration over cut cells and the associated problematic issues regarding numerical stability and matrix conditioning. Accuracy is maintained by modifying the original boundary conditions using Taylor expansions. Hence the name of the method, that shifts the location and values of the boundary conditions. In this article, we present enhanced variational SBM formulations for the Poisson and Stokes problems with improved flexibility and robustness. These simplified variational forms allow to relax some of the assumptions required by the mathematical proofs of stability and convergence of earlier implementations. First, we show that these new SBM implementations can be proved asymptotically stable and convergent even without the rather restrictive assumption that the inner product between the normals to the true and surrogate boundaries is positive. Second, we show that it is not necessary to introduce a stabilization term involving the tangential derivatives of the solution at Dirichlet boundaries, therefore avoiding the calibration of an additional stabilization parameter. Finally, we prove enhanced L 2 -estimates without the cumbersome assumption – of earlier proofs – that the surrogate domain is convex. Instead we rely on a conventional assumption that the boundary of the true domain is smooth, which can also be replaced by requiring convexity of the true domain. The aforementioned improvements open the way to a more general and efficient implementation of the Shifted Boundary Method, particularly in complex three-dimensional geometries. We complement these theoretical developments with numerical experiments in two and three dimensions.

42 ENGINEERING↗
DOE OSTI2026

Performance measurement of emerging 3- and 4-terminal tandem solar cells

Tandem solar cells are not limited to the conventional two-terminal (2-T) configuration. Multi-terminal designs like three-terminal (3-T) and four-terminal (4-T) devices have gained increasing attention in the PV community due to their relaxed current-matching requirement between subcells and their potential for enhanced energy yield. However, reliable and standardized methods for evaluating the performance of multi-terminal tandems remain underdeveloped. This work addresses this gap by providing comprehensive measurement guidelines tailored to these advanced configurations. We examine key coupling mechanisms between subcells, including the shared electrical load in 3-T devices and optical luminescent coupling in both 3-T and 4-T devices, to enable accurate and consistent performance evaluation. Furthermore, we propose two stabilized measurement methods for emerging 3-T tandem cells incorporating perovskite subcells: (1) a two-dimensional maximum-power-point tracking (MPPT) approach that continuously tracks both subcells' maximum power points (P MAX ) until convergence to stabilized outputs, and (2) a hybrid approach that combines MPPT for one subcell with stabilized current recording under fixed voltage biases near the P MAX of the other, allowing robust extraction of the overall stabilized P MAX (termed “MPPT + asymptotic P MA X scan” method). These methods directly address the dynamic current responses inherent to perovskite-containing tandems, providing a foundation for meaningful and reproducible performance comparisons.

14 SOLAR ENERGY↗
DOE OSTI2023

Reinforcement Learning of Structured Stabilizing Control for Linear Systems With Unknown State Matrix

This paper delves into designing feedback control gains for a continuous-time linear quadratic regulator (LQR) problem that is constrained to certain predefined structure with unknown state matrix. We bring forth the ideas from reinforcement learning (RL) in conjunction with sufficient stability and performance guarantees in order to design these structured gains using the trajectory measurements of states and controls. Here we first formulate a model-based framework using dynamic programming (DP) to embed the structural constraint to the LQR gain computation in the continuous-time setting, and then subsequently, formulate a policy iteration RL algorithm that can alleviate the requirement of known state matrix in conjunction with maintaining the feedback gain structure. The design enables a distributed learning control design which is necessary for many large-scale cyber-physical systems. Theoretical guarantees are provided for stability and convergence of the structured reinforcement learning (SRL) algorithm. We validate our theoretical results with numerical simulations on a multi-agent networked linear time-invariant (LTI) dynamic system.

42 ENGINEERING↗
DOE OSTI2025

Stochastic Adaptive Droop Control in Frequency Regulation of Power Systems With Intermittent Generators

Modern power systems (MPSs), including microgrids (MGs), are increasingly incorporating multiple renewable energy sources (RESs) such as wind and solar power, as well as battery storage and controllable loads. While environmentally beneficial, these sources pose challenges for control and management due to their intermittent and stochastic nature, especially in maintaining frequency stability with multiple interconnected generators of varying capacities. Traditional droop control methods are effective in systems with generators that are dispatchable and have fixed generation capacities, but they fall short when applied to systems with RESs, where generation capacities are dynamic and affected by unpredictable environmental conditions. To address these challenges, this paper introduces a novel stochastic adaptive droop control (SADC) method for load frequency control (LFC). The proposed method adapts droop coefficients in real time, based on the measured stochastic data of power generation capacities, enabling more effective frequency regulation in systems with variable and intermittent power generation. Unlike traditional adaptive control methods, which assume constant or slowly-varying system parameters, this approach accounts for stochastic processes by modeling them as Markov chains, enabling robust performance under highly dynamic and unpredictable conditions. The key contributions of this work include the development of real-time droop coefficient adaptation algorithms, derivation of their stability and convergence properties, and the demonstration of the advantages of the method through simulations. Case studies highlight the improved performance of frequency regulation, particularly in addressing the impact of stochastic weather conditions and the benefits of reducing dependence on battery reserves in dealing with intermittency of RESs. Finally, this paper provides a comprehensive analysis of the theoretical foundations of the method, as well as practical implementation insights for future power systems with high penetration of RESs.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Sampling and resolution characteristics in reduced order models of shallow water equations: Intrusive vs nonintrusive

We investigate the sensitivity of reduced order models (ROMs) to training data spatial resolution as well as sampling rate. In particular, we consider proper orthogonal decomposition (POD), coupled with Galerkin projection (POD-GP), as an intrusive reduced order modeling technique. For non-intrusive ROMs, we consider two frameworks. The first is using dynamic mode decomposition (DMD), and the second is based on artificial neural networks (ANNs). For ANN, we utilized a residual deep neural network, and for DMD we have studied two versions of DMD approaches; one with hard thresholding and the other with sorted bases selection. Also, we highlight the differences between mean-subtracting the data (centering) and using the data without mean-subtraction. We tested these ROMs using a system of 2D shallow water equations for four different numerical experiments, adopting combinations of sampling rates and spatial resolutions. For these cases, we found that the DMD basis obtained with hard threshodling is sensitive to sampling rate. The sorted DMD algorithm helps to mitigate this problem and yields more stabilized and converging solution. Furthermore, we demonstrate that both DMD approaches without mean subtraction provide significantly more accurate results than DMD with mean-subtracting the data. On the other hand, POD is relatively insensitive to sampling rate and yields better representation of the flow field. Meanwhile, spatial resolution has little effect on both POD and DMD performances. Here, the numerical results reveal that an ANN on POD subspace (POD-ANN) performs remarkably better than POD-GP and DMD in capturing system dynamics, even with a small number of modes.

42 ENGINEERING↗
DOE OSTI2021

A scalable exponential-DG approach for nonlinear conservation laws: With application to Burger and Euler equations

In this work, we propose an Exponential DG framework for partial differential equations. We decompose 7 governing equations into linear and nonlinear parts to which we apply the discontinuous Galerkin 8 (DG) spatial discretization. In particular, we construct the linear part using Jacobian that effectively 9 capture stiff characteristics in the system. The former is integrated analytically, whereas the latter 10 is approximated. This approach i) is stable with a large Courant number (Cr > 1); ii) supports 11 high-order solutions both in time and space; iii) is computationally favorable compared to IMEX 12 DG methods with no preconditioner; iv) becomes comparable to explicit RKDG methods on uniform 13 mesh and beneficial on non-uniform grid for Euler equations; v) is scalable in a modern massively 14 parallel computing architecture due to its explicit nature of exponential time integrators and com15 pact communication stencil of DG method. Numerical results demonstrate the performance of our 16 proposed methods through various examples. We also discuss the stability and convergence analysis 17 for our exponential DG scheme in the context of Burgers equation.

42 ENGINEERING↗
DOE OSTI2020

Formulation and solution approach for calibrating activity-based travel demand model-system via microsimulation

This study addresses the problem of calibrating utility-maximizing nested logit activity-based travel demand model-systems. After estimation, it is common practice to use aggregate measurements to calibrate the estimated model-system’s parameters prior to their application in transportation planning, policy making, and operations. However, calibration of activity-based model-systems has received much less attention. Existing calibration approaches are myopic heuristics in the sense that they do not consider the fundamental inter-dependencies among choice-models and do not have a systematic way to adjust model parameters. Also, other purely simulation-based approaches do not perform well in large-scale applications. In this study, we focus on utility-maximizing nested logit activity-based model-systems and calibrating aggregate statistics such as activity shares, mode shares, time-dependent & mode-specific OD flows, and time-dependent & mode-specific sensor counts. We formulate the calibration problem as a simulation-based optimization problem and propose a stochastic gradient-based solution procedure to solve it. The solution procedure relies on microsimulation to calculate expectations of the aggregate statistics of interest to the calibration problem. Additionally, we derive approximate analytical expressions for the gradient of the objective function —that are evaluated through microsimulation on mini-batches of the population. The proposed solution procedure is sensitive to the fundamental structure of the activity-based model-system and is non-myopic in considering the dependencies across its model components. The formulated optimization problem is non-convex, highly nonlinear, and potentially has multiple-minima. Lastly, we show —through a real-world application— that the proposed solution procedure outperforms other state-of-the-art purely simulation-based optimization approaches in terms of computational efficiency, stability, and convergence. We also compare various gradient-based solution algorithms to determine the best algorithm to update the parameters. This work has the potential to facilitate wider and easier application of activity-based model-systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Extended Lagrangian Born–Oppenheimer molecular dynamics for orbital-free density-functional theory and polarizable charge equilibration models

We report extended Lagrangian Born–Oppenheimer molecular dynamics (XL-BOMD) is formulated for orbital-free Hohenberg–Kohn density-functional theory and for charge equilibration and polarizable force-field models that can be derived from the same orbital-free framework. The purpose is to introduce the most recent features of orbital-based XL-BOMD to molecular dynamics simulations based on charge equilibration and polarizable force-field models. These features include a metric tensor generalization of the extended harmonic potential, preconditioners, and the ability to use only a single Coulomb summation to determine the fully equilibrated charges and the interatomic forces in each time step for the shadow Born–Oppenheimer potential energy surface. The orbital-free formulation has a charge-dependent, short-range energy term that is separate from long-range Coulomb interactions. This enables local parameterizations of the short-range energy term, while the long-range electrostatic interactions can be treated separately. The theory is illustrated for molecular dynamics simulations of an atomistic system described by a charge equilibration model with periodic boundary conditions. The system of linear equations that determines the equilibrated charges and the forces is diagonal, and only a single Ewald summation is needed in each time step. The simulations exhibit the same features in accuracy, convergence, and stability as are expected from orbital-based XL-BOMD.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Self-consistent modeling of tokamak edge plasma transport with lithium sources

Magnetic confinement fusion devices require effective heat and particle exhaust solutions on the divertor plates to operate sustainably, especially under reactor-relevant conditions. Liquid lithium divertors have been proposed to address two major challenges: control of excessive heat flux to plasma-facing components through vapor shielding and minimization of core plasma contamination from impurities. The National Spherical Torus Experiment-Upgrade (NSTX-U) will explore lithium as a divertor material due to its potential to meet both objectives. We present a self-consistent coupling framework between the plasma boundary transport code UEDGE and the lithium wall transport code Wall–Li to evaluate the feasibility and operational limits of lithium-based divertors. The model aims to optimize lithium sourcing levels to prevent core plasma contamination via fuel dilution while ensuring divertor protection through vapor shielding. This integrated framework, applicable to any tokamak with lithium sources, dynamically adjusts lithium sourcing based on local plasma conditions and surface temperature. The coupled model is tested using NSTX-like geometry and plasma conditions to assess its performance and reliability. Wall–Li calculates lithium fluxes from plasma-facing components, incorporating physical sputtering, thermally enhanced sputtering, and evaporation driven by surface temperature and ion flux. These fluxes are reintroduced into UEDGE as neutral lithium atoms, enabling simulation of their transport and distribution within the plasma. UEDGE computes plasma and neutral transport, surface heat flux, and iteratively feeds this information back to Wall–Li. A small time step is employed to ensure numerical stability and convergence, enabling accurate simulations over typical tokamak discharge durations. This integrated modeling approach provides a robust tool for identifying operational regimes that balance effective lithium sourcing with minimal core plasma contamination, offering critical insights for optimizing lithium-based divertor systems in current and future fusion devices.

Magnetic confinement fusion↗
DOE OSTI2024

Numerical methods for fractional Fokker–Planck equation with multiplicative Marcus Lévy noises

The Fokker–Planck equation (FPE) is an important deterministic tool for investigating stochastic dynamical systems. In this paper, we consider the space-time fractional FPE driven by multiplicative Marcus Lévy noises. Efficient numerical schemes are presented to solve the equations. Stability and convergence of the methods are also discussed. We give some numerical experiments to validate our schemes, and examine the effects of parameters on solutions. Additionally, we analyze the maximal likely trajectories and the critical time for the change of the most probability location.

Mathematics↗
DOE OSTI2020

State-Constrained Grid-Forming Inverter Control for Robust Operation of AC Microgrids

The control of grid-forming inverters has become an important problem to achieve high efficiency, reliability, and resilience of the future power grid. The distributed control that utilizes a sparse communication network has been proposed for AC microgrids, in which each DG only has access to the information of a small number of its neighboring DGs, reducing the computational complexity and improving the resiliency to faults and unknown parameters. However, these approaches have not provided a clear analysis of the coupling between active/reactive power injections and the voltage magnitude/frequency or a distributed updating law with a solid theoretical foundation. Additionally, in the existing approaches, tracking the references from the secondary control may violate operational constraints.

Xu, Ying↗
DOE OSTI2019

Highly-scalable, physics-informed GANs for learning solutions of stochastic PDEs

Uncertainty quantification for forward and inverse problems is a central challenge across physical and biomedical disciplines. We address this challenge for the problem of modeling subsurface flow at the Hanford Site by combining stochastic computational models with observational data using physics-informed GAN models. The geographic extent, spatial heterogeneity, and multiple correlation length scales of the Hanford Site require training a computationally intensive GAN model to thousands of dimensions. We develop a highly optimized implementation that scales to {\herogpucount} NVIDIA Volta GPUs. We develop a hierarchical scheme based on a multi-player game-theoretic approach for exploiting domain parallelism, map discriminators and generators to multiple GPUs, and employ efficient communication schemes to ensure training stability and convergence. Our implementation scales to {\heronodecount} nodes on the Summit supercomputer with a \weakscalingeff\% scaling efficiency, achieving peak and sustained half-precision rates of {\heropeakperf} PF/s and {\herosustainedperf} PF/s.

physics informed ML, machine learning, generative ↗
DOE OSTI2026

Renormalon subtracted nonrelativistic QCD for heavy hadron systems

We present a renormalon-subtracted formulation of potential nonrelativistic QCD (pNRQCD) for precision spectroscopy of heavy hadron systems, combining variational and Green's function Monte Carlo (VMC/GFMC) methods with NNLO static two- and three-body potentials. Minimal renormalon subtraction (MRS) systematically sums leading factorially growing terms, thereby stabilizing perturbative convergence and reducing renormalization-scale dependence. We tune charm and bottom quark masses to spin-averaged $1S$ quarkonium states and predict $Ω_{ccc}$, $Ω_{ccb}$, $Ω_{cbb}$, and $Ω_{bbb}$ baryon masses, as well as QCD-stable baryons containing top quarks. NNLO MRS results undershoot lattice QCD by 125--175~MeV, with fractional differences decreasing as $\sim 1/m_Q$, consistent with neglected $\mathcal{O}(1/m_Q)$ corrections. Applying these methods to unequal-mass fully-heavy tetraquarks, we determine the critical heavy-to-light mass ratio for binding and compute binding energies across the mass-ratio landscape.

Assi, Benoît [Cincinnati U.; Fermilab]↗
DOE OSTI2020

Stability boundary and optimal operating parameter identification in milling using Bayesian learning

Here, this paper describes a novel Bayesian learning approach for stability boundary and optimal parameter identification in milling without the knowledge of the underlying tool dynamics or material cutting force coefficients. The paper is divided into two parts. First, a Bayesian learning method for stability lobe identification using test results is described. Each axial depth and spindle speed combination is characterized by a probability of stability which is updated using Bayes’ rule when a test result (stable or unstable) is made available. A novel likelihood function is defined which incorporates knowledge of the stability behavior. Numerical results show convergence to the analytical stability lobe diagram. Second, an adaptive experimental strategy to identify optimal operating parameters that maximize material removal rate is described. Numerical evaluation shows convergence to the optimal operating point with error less than 15 % within ten tests on average. The approach is validated using experimental results. Results show that the proposed method is an efficient and robust learning method to identify the stability lobe diagram and optimal operating parameters with a limited number of tests/data points.

Bayesian machine learning↗
DOE OSTI2021

Stabilization of the 81-channel coherent beam combination using machine learning

We develop a rapidly converging algorithm for stabilizing a large channel-count diffractive optical coherent beam combination. An 81-beam combiner is controlled by a novel, machine-learning based, iterative method to correct the optical phases, operating on an experimentally calibrated numerical model. A neural-network is trained to detect phase errors based on interference pattern recognition of uncombined beams adjacent to the combined one. Due to the non-uniqueness of solutions in the full space of possible phases, the network is trained within a limited phase perturbation/error range. This also reduces the number of samples needed for training. Simulations have proven that the network can converge in one step for small phase perturbations. When the trained neural-network is applied to a realistic case of 360 degree full range, an iterative scheme exploits random walking at the beginning, with the accuracy of prediction on phase feedback direction, to allow the neural-network to step into the training range for fast convergence. This neural-network-based iterative method of phase detection works tens of times faster than the commonly used stochastic parallel gradient descent approach (SPGD) using a single-detector and random dither when both are tested with random phase perturbations.

Wang, Dan↗
DOE OSTI2023

Adaptive Path-Following Control for Ground Vehicles Using a Switching Non-Quadratic Lyapunov Function

The application of adaptive control techniques in the development of control systems for intelligent vehicles, especially for ground vehicle path-following controllers, has gained popularity due to their ability to handle large-scale parametric uncertainties. However, the use of a standard quadratic Lyapunov function in existing adaptive control-based path-following controllers can lead to poor transient performance, such as slow convergence and/or large overshoot. To address this limitation, this study proposes the use of a switching non-quadratic Lyapunov function to design a model reference adaptive path-following controller that aims to provide superior transient performance. The stability and signal convergence of the closed-loop system are demonstrated through a Lyapunov-like analysis. Through dSPACE ASM simulation, the effectiveness of the proposed controller is illustrated, which confirms improved tracking performance over a baseline solution.

Zhou, Xingyu↗
DOE OSTI2023

Lack of robustness and accuracy of many numerical schemes for phase-field simulations

In this paper, we study the stability, accuracy and convergence behavior of various numerical schemes for phase-field modeling through a simple ODE model. Both theoretical analysis and numerical experiments are carried out on this ODE model to demonstrate the limitation of most numerical schemes that have been used in practice. One main conclusion is that the first-order fully implicit scheme is the only robust algorithm for phase-field simulations while all other schemes (that have been analyzed) may have convergence issue if the time step size is not exceedingly small. More specifically, by rigorous analysis in most cases, we have the following conclusions: (i) The first-order fully implicit scheme converges to the correct steady state solution for all time step sizes. In the case of multiple solutions, one of the solution branches always converges to the correct steady state solution. (ii) The first-order convex splitting scheme, which is equivalent to the first-order fully implicit scheme with a different time scaling, always converges to the correct steady state solution but may seriously lack numerical accuracy for transient solutions. (iii) For the second-order fully implicit and convex splitting schemes, for any time step size $δt > 0$, there exists an initial condition $u_0$ , with $|u_0| > 1$, such that the numerical solution converges to the wrong steady state solution. (iv) For $|u_0|$ ≤ 1, all second-order schemes studied in this paper converge to the correct steady state solution although severe numerical oscillations occur for most of them if the time step size is not sufficiently small. (v) An unconditionally energy-stable scheme (such as the modified Crank–Nicolson scheme) is not necessarily better than a conditionally energy-stable scheme (such as the Crank–Nicolson scheme). Finally, most, if not all, of the above conclusions are expected to be true for more general Allen–Cahn and other phase-field models.

97 MATHEMATICS AND COMPUTING↗