Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Numerical algorithms”

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 541 records · Page 30
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 OSTI2024

NUMERICAL MODELING OF A SOLID OXIDE FUEL CELL FOR USE IN REAL-TIME SIMULATION AND CYBER-PHYSICAL SYSTEMS

Cyber-physical systems provide a mechanism with which to investigate the physical phenomena and behavior of traditionally cost-prohibitive or otherwise fragile equipment. For the National Energy Technology Laboratory (NETL), this approach resulted in the Hybrid Performance (Hyper) facility which features a gas turbine-SOFC hybrid cycle utilizing real turbomachinery and a simulated SOFC stack. This allows for the investigation of combined cycle performance and control strategies, in an exhaustive manner, both without fear of destroying delicate state-of-the-art fuel cells, and with the full accuracy of real-world turbomachinery. Issues arose between the transient response of the SOFC model being limited to a sample time of 80 milliseconds, due to the calculation time of the SOFC model taking on average 40 milliseconds to calculate for a given timestep with spikes in calculation time reaching the 80 millisecond threshold. In order to be able to match the speed of transients from the turbomachinery and likewise better discern transient behavior, it was determined that the SOFC model must be optimized to operate at a sample time of 5 milliseconds. Therefore, it is necessary to optimize the SOFC model in order to decrease the calculation time from around 40 milliseconds, down to at the most 5 milliseconds. To do this, both the electrochemical algorithm and the thermal algorithm used to simulate the physical behavior of the SOFC are investigated to determine where improvements can be made. To this end the rootfinding numerical recipes of the electrochemical algorithm are investigated as the complex electrochemistry requires a highly iterative nested dual convergence loop to resolve the voltage-current relationship, and likewise the temporal discretization of the thermal algorithm is modified for the sake of higher accuracy and stability. Ultimately the new electrochemical algorithm featuring higher order rootfinding schemes proves to be efficient enough to reach the sub 5 millisecond target, signifying an order of magnitude reduction in calculation time, and when coupled with the new temporal discretization similar calculation time characteristics show that a fully implicit, higher order temporal discretization can also successfully be used if desired. Ultimately this result means that the cyber-physical simulation system can operate at higher sample rates, and resolve transient events at significantly higher resolution and fidelity.

Arias, Jesus↗
DOE OSTI2026

Generalized Power Flow Model of an Extra High-Power Multi-Terminal HVdc Transmission Grid with Parallel-Connected and Voltage-Stacked Converters

To increase power transfer capacity of high-voltage direct current (HVdc) transmission, a new extra high-power HVdc architecture with multiple standard modular multilevel converters (MMCs) per substation has recently been introduced. This paper proposes a power flow model for a multi-terminal HVdc (MTdc) grid with this innovative substation architecture. The proposed MTdc model can be integrated seamlessly with existing ac-dc power flow algorithms with minimal modifications. The model is applicable to various MTdc grid types and topologies, different numbers of dc buses, dc lines, and MMCs per substation, along with diverse control parameters. In addition, it accurately captures both balanced and unbalanced operations of the MTdc grid. The proposed model is verified using a 5-terminal bipole MTdc grid that spans 4 areas in the Eastern Interconnection system of the USA. The numerical solutions obtained from unified and sequential ac-dc power flow algorithms under different operating conditions closely match the time-domain simulation results in PSCAD, validating the accuracy and versatility of the proposed MTdc power flow model.

Nguyen, Quan H.↗
DOE OSTI2024

An unstructured body-of-revolution electromagnetic particle-in-cell algorithm with radial perfectly matched layers and dual polarizations

A novel electromagnetic particle-in-cell algorithm has been developed for fully kinetic plasma simulations on unstructured (irregular) meshes in complex body-of-revolution geometries. The algorithm, implemented in the BORPIC++ code, utilizes a set of field scalings and a coordinate mapping, reducing the Maxwell field problem in a cylindrical system to a Cartesian finite element Maxwell solver in the meridian plane. The latter obviates the cylindrical coordinate singularity in the symmetry axis. The choice of an unstructured finite element discretization enhances the geometrical flexibility of the BORPIC++ solver compared to the more traditional finite difference solvers. Symmetries in Maxwell’s equations are explored to decompose the problem into two dual polarization states with isomorphic representations that enable code reuse. The particle-in-cell scatter and gather steps preserve charge conservation at the discrete level. Our previous algorithm (BORPIC+) discretized the E and B field components of TE Φ and TM Φ polarizations on the finite element (primal) mesh. Here, we employ a new field-update scheme. Using the same finite element (primal) mesh, this scheme advances two sets of field components independently: (1) E and B of TE Φ polarized fields, (E z , E ρ , B Φ ) and (2) D and H of TM Φ polarized fields, (D Φ , H z , H ρ ). Since these field updates are not explicitly coupled, the new field solver obviates the coordinate singularity, which otherwise arises at the cylindrical symmetric axis, ρ = 0 when defining the discrete Hodge matrices (generalized finite element mass matrices). Here, a cylindrical perfectly matched layer is implemented as a boundary condition in the radial direction to simulate open space problems, with periodic boundary conditions in the axial direction. We investigate effects of charged particles moving next to the cylindrical perfectly matched layer. We model azimuthal currents arising from rotational motion of charged rings, which produce TMΦ polarized fields. Several numerical examples are provided to illustrate the first application of the algorithm.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Comparison of electro-thermal performance of advanced cooling techniques for electric vehicle motors

Permanent magnet synchronous motors are commonly used in the powertrain of electric vehicles because of their high power and torque densities. Attempts to increase power and torque densities beyond the state-of-the-art often suffer from thermal limitations of the adopted winding-wire insulation class. In this paper, overall effectiveness of four different cooling technologies, namely conventional stator jacket cooling, embedded circular and rectangular cooling channels within stator core, and direct winding heat exchangers have been studied numerically. Here, by realizing temperature dependent magnetic and material properties, winding and core losses, a two-way coupling algorithm has been utilized to study the detailed electro-magnetic and thermal performance of BMW i3 motor with aforementioned cooling techniques. The numerical results illustrated that the direct winding heat exchangers approach provides better electro-thermal performance in comparison to the other cooling techniques analyzed. On the contrary, embedded rectangular and circular channel in stator core adversely affect the electro-magnetic performance and overall efficiency of the motor, despite their superior thermal performance compared to the jacket cooling

42 ENGINEERING↗
DOE OSTI2022

Mitigating the Impacts of Uncertain Geomagnetic Disturbances on Electric Grids: A Distributionally Robust Optimization Approach

Severe geomagnetic disturbances (GMDs) increase the magnitude of the electric field on the Earth’s surface (E-field) and drive geomagnetically-induced currents (GICs) along the transmission lines in electric grids. These additional currents can pose severe risks, such as current distortions, transformer saturation and increased reactive power losses, each of which can lead to system unreliability. Today several mitigation actions (e.g., changing grid topology) exist that can reduce the harmful GIC effects on the grids. Making such decisions can be challenging, however, because the magnitude and direction of the E-field are uncertain and non-stationary. In this paper, we model uncertain E-fields using the distributionally robust optimization (DRO) approach that determines optimal transmission grid operations such that the worst-case expectation of the system cost is minimized. We also capture the effect of GICs on the nonlinear AC power flow equations. For solution approaches, we develop an accelerated column-and-constraint generation (CCG) algorithm by exploiting a special structure of the support set of uncertain parameters representing the E-field. Extensive numerical experiments based on “epri-21” and “uiuc-150” systems, designed for GMD studies, demonstrate (i) the computational performance of the accelerated CCG algorithm, (ii) the superior performance of distributionally robust grid operations that satisfy nonlinear, nonconvex AC power flow equations and GIC constraints, in comparison with standard stochastic programming-based methods during the out-of-sample testing.

42 ENGINEERING↗
DOE OSTI2021

Absolute contrast estimation for soft X-ray photon fluctuation spectroscopy using a variational droplet model

Abstract X-ray photon fluctuation spectroscopy using a two-pulse mode at the Linac Coherent Light Source has great potential for the study of quantum fluctuations in materials as it allows for exploration of low-energy physics. However, the complexity of the data analysis and interpretation still prevent recovering real-time results during an experiment, and can even complicate post-analysis processes. This is particularly true for high-spatial resolution applications using CCDs with small pixels, which can decrease the photon mapping accuracy resulting from the large electron cloud generation at the detector. Droplet algorithms endeavor to restore accurate photon maps, but the results can be altered by their hyper-parameters. We present numerical modeling tools through extensive simulations that mimic previous x-ray photon fluctuation spectroscopy experiments. By modification of a fast droplet algorithm, our results demonstrate how to optimize the precise parameters that lift the intrinsic counting degeneracy impeding accuracy in extracting the speckle contrast. These results allow for an absolute determination of the summed contrast from multi-pulse x-ray speckle diffraction, the modus operandi by which the correlation time for spontaneous fluctuations can be measured.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Extension of the high-resolution thermal-hydraulics code ESCOT to hexagonal core geometries for multi-physics calculations

The extension of the capabilities of the pin-level nuclear reactor core thermal-hydraulics (T/H) code ESCOT to analyze hexagonal fueled cores and its performance are presented. ESCOT is an accurate yet fast core thermal-hydraulics solution aiming at high-fidelity and high-resolution multi-physics core analysis in the framework of massively parallel computing platforms. Its algorithm solution is based on the four-equation drift-flux model for two-phase calculations, these are numerically solved by applying the Finite Volume Method (FVM) and the Semi-Implicit Method for Pressure-Linked Equation (SIMPLE)-like algorithm in a staggered grid system. Constitutive models such as turbulent mixing, pressure drop, and vapor generation are employed to simulate key phenomena in subchannel-scale analysis. ESCOT is parallelized by a double (radial and axial) domain decomposition that enables its highly parallelized execution. The coupling of the code with the neutronics whole core solver for hexagonal geometries nTRACER is described. The newly implemented ESCOT features are validated by comparing single assembly and full core steady state nTRACER-ESCOT solutions with nTRACER standalone internal one-dimensional T/H solver results. The validation problems are based on the VVER 440 and VVER 1000 cores. ESCOT results show differences within an acceptable range with respect to the simple 1D nTRACER built-in solver. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2023

Automated Symbolic Upscaling: 2. Model Generation for Extended Applicability Regimes

Abstract In this second part of the two paper series, we detail an algorithmic procedure for systematically implementing the generalized closure form strategy presented in Part 1. This strategy extends the applicability of homogenized models with respect to classical homogenization theory, as demonstrated in Part 1 where upscaled models are rigorously derived in moderately reactive physical regimes. After encoding the algorithm into Symbolica, an automated upscaling framework, we upscale two reactive mass transport problems and numerically validate the resulting nonlinear homogenized models by showing the absolute error estimates predicted by homogenization theory are satisfied. In both problems, nontrivial closure forms and closure problems are automatically formulated using the encoded strategy with no human interaction, nor prior knowledge regarding the closure required for the systems. We hope these demonstrations spark further interest in automated analytical frameworks for multiscale modeling, as such capabilities are invaluable for generating rigorous multiscale models of complex phenomena in porous media.

Pietrzyk, Kyle↗
DOE OSTI2020

Local Phasor-Based Control of DER Inverters for Voltage Regulation on Distribution Feeders

We introduce a new control paradigm termed Phasor-Based Control (PBC) to coordinate Distributed Energy Resources (DER) for improved voltage regulation and other objectives. PBC is a multi-layer control framework where the state of the distribution grid is represented by voltage phasors, and Phasor Measurement Units (PMUs) measure the state at critical points in the distribution grid. In the PBC paradigm, a supervisory controller (S-PBC) sets phasor targets which local controllers track. In this paper, we propose a Proportional Integral (PI) implementation for the local control layer (LPBC), to regulate real and reactive power output of distributed inverters to track a voltage phasor target computed by the supervisory layer. We tune the PI controller gains offline with a genetic algorithm that yields better performance than the Ziegler-Nichols method. We benchmark the proposed L-PBC controller against droop volt-var control (DVVC) and observe improved voltage regulation in simulation on the IEEE 13 node unbalanced test feeder (IEEE 13NF). Furthermore, by means of numerical simulation we observe the response of the L-PBC controllers to small and large grid disturbances. Simulations on larger feeders, IEEE 123-node and 647-node, demonstrate challenges with tuning controllers in setups with different amounts of power-voltage coupling.

42 ENGINEERING↗
DOE OSTI2020

Spectral Mesh-Free Quadrature for Planar Regions Bounded by Rational Parametric Curves

This article presents spectral, mesh-free, Green’s theorem-based numerical quadrature schemes for integrating functions over planar regions bounded by rational parametric curves. Our algorithm proceeds in two steps: (1) We first find intermediate quadrature rules for line integrals along the region’s boundary curves corresponding to Green’s theorem. (2) We then use a high-order quadrature rule to compute the numerical antiderivative of the integrand along a coordinate axis, which is used to evaluate the Green’s theorem line integral. We present two methods to compute the intermediate quadrature rule. The first is spectrally accurate (it converges faster than any algebraic order with respect to number of quadrature points) and is relatively easy to implement, but has no guarantee of polynomial exactness. The second guarantees exactness for polynomial integrands up to a pre-specified degree with an a priori-known number of quadrature points and retains the convergence properties of the first, but is slightly more complicated. The quadrature schemes have applications to computation of geometric moments, immersogeometric analysis, conservative field transfer between high-order meshes, and initialization of multi-material simulations with rational geometry. We compare the quadrature schemes produced using our method to other methods in the literature and show that they are much more efficient both in terms of number of quadrature points and computational time. We provide an open-source implementation of the algorithm in MATLAB.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Automated Operational Forecasting of Monsoon Low Pressure Systems

Monsoon low pressure systems (LPSs) are the dominant rain-bearing weather system of South Asia, often producing extreme precipitation and hydrological disasters in a region inhabited by nearly two billion people. Despite the importance of these storms, no operational system has automatically identified and tracked LPS in real time in numerical weather prediction model output; many commonly used vortex-tracking algorithms are ill suited for monsoon LPS because of the weak winds and cold cores of these systems. Here, we describe a new system that uses optimized algorithms to identify monsoon LPS in short- to medium-range forecasts from the U.S. Global Ensemble Forecast System (GEFS) and a version of the deterministic Global Forecast System (GFS) adapted and used operationally by the Indian Institute of Tropical Meteorology (IITM). We also assess the historical performance of these models in forecasting South Asian monsoon LPS, comparing this with the performance of the Integrated Forecasting System of the ECMWF. We assess the accuracy of model predictions of LPS genesis, position, intensity, and precipitation rates for forecast lead times of 1–5 days, yielding quantitative information on model biases to guide operational forecasters and disaster managers. The system we introduce here could be extended to other low-latitude regions affected by dynamically weak, heavily precipitating atmospheric vortices that are often not included in tropical cyclone inventories.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Initial position optimization in molecular dynamics simulations for a Coulomb system

A new algorithm for molecular dynamics (MD) simulations is developed to optimize plasma particle distributions at given initial temperatures. By combining velocity scaling and reassignment, the method effectively eliminates the initial rise and oscillation in temperatures observed with randomly distributed positions. These rises and oscillations are undesired numerical artifacts observed in conventional plasma MD simulations, arising from unoptimized particle positions. The algorithm demonstrates temperature relaxation without initial rises or oscillations, as well as precise flow velocity relaxation, enabling accurate measurement of relaxation times. The code is accelerated using graphics processing units for parallel processing, enhancing the study of plasma dynamics. The proposed method for distributing physically valid particles in MD simulations enables accurate studies of intrinsic collision processes in plasmas, including the dynamics of strongly coupled plasmas, plasma–wave interactions, and transport phenomena in magnetized plasmas. The paper concludes with a discussion of potential applications and future enhancements to the algorithm.

Jo, Jawon (ORCID:0009000924193285)↗
DOE OSTI2020

Large Scale Tensor Factorization via Parallel Sketches

Tensor factorization methods have recently gained increased popularity. A key feature that renders tensors attractive is the ability to directly model multi-relational data. In this work, we propose ParaSketch, a parallel tensor factorization algorithm that enables massive parallelism, to deal with large tensors. The idea is to compress the large tensor into multiple small tensors, decompose each small tensor in parallel, and combine the results to reconstruct the desired latent factors. Prior art in this direction entails potentially very high complexity in the (Gaussian) compression and final combining stages. Adopting sketching matrices for compression, the proposed method enjoys a dramatic reduction in compression complexity, and features a much lighter combining step. Moreover, theoretical analysis shows that the compressed tensors inherit latent identifiability under mild conditions, hence establishing correctness of the overall approach. Numerical experiments corroborate the theory and demonstrate the effectiveness of the proposed algorithm.

block term decomposition↗
DOE OSTI2026

A cell-centered AMR-ALE framework for 3D multi-material hydrodynamics. Part II: linesweep ALE rezoning for nonconformal block-structured AMR meshes

The simulation of flows presenting contact discontinuities, vorticity, and large variations in spatial scales can be performed in a framework coupling Arbitrary Lagrangian Eulerian (ALE) algorithms and Adaptive Mesh Refinement (AMR). This coupling requires adaptation of ALE rezoning techniques to meshes containing nonconformal nodes arising from both the AMR topology and the junction of mesh blocks. Here, in this paper, we present an ALE rezoning strategy that is compatible with such meshes, and that can also act as a disentangling algorithm. Emphasis is put on an algorithm that respects intrinsic Lagrangian mesh properties in order to preserve accuracy around discontinuities. To that end, we adapt the weighted linesweep algorithm to nonconformal block-structured AMR meshes. Then, we present control parameters introduced in the method for it to be applicable in practical situations. Notably, the method is coupled to a specific metric optimization in order to palliate some shortcomings of the linesweep method. Finally, numerical test cases are presented that feature the capabilities of the ALE-AMR algorithm for flows that present discontinuities, vorticity, and a variety of scales. Notably, we show that our ALE-AMR algorithm gives results at least similar to Euler-AMR, but provides better accuracy in cases where discontinuities are involved, thanks to a method that respects the Lagrangian features of the mesh. Additionally, it enables Euler-AMR-like computations on domains with temporally varying domain boundaries.

Adaptive mesh refinement↗
DOE OSTI2021

Risk-Averse Bi-Level Stochastic Network Interdiction Model for Cyber-Security Risk Management

Security of cyber networks is crucial; recent severe cyber-attacks have had a devastating effect on many large organizations. The attack graph, which maps the potential attack paths of a cyber network, is a popular tool for analyzing cyber system vulnerability. In this study, we propose a bi-level stochastic network interdiction model on an attack graph to enable a risk-averse, resource constrained cyber network defender to optimally deploy security countermeasures that protect against attackers with an uncertain budget. This risk- averse conditional-value-at-risk (CVaR) model minimizes a weighted sum of the expected maximum loss over all scenarios and the expected maximum loss from the most damaging attack scenarios. We develop a customized constraint and column generation algorithm to solve our model as well as several acceleration techniques to improve the computational efficiency. Numerical experiments demonstrate that the acceleration techniques enable the solution of relatively large problems within a reasonable amount of time: applying all the acceleration techniques also reduces the average computation time of the basic algorithm by 71% for 100-node graphs. Using metrics called mean-risk value of stochastic solution and value of risk-aversion, computational results suggest that our stochastic risk-averse model significantly outperforms deterministic and risk-neutral models when 1) the distribution of attacker budget is heavy-right-tailed and 2) the defender is highly risk-averse.

Bhuiyan, Tanveer H.↗
DOE OSTI2026

Structure-aware Initialization via Numerical Continuation and Informed Priors

Scientific machine learning (SciML) often operates in ill-conditioned, weakly identifiable regimes due to limited data or indirect observations. In such settings, optimization and inference are highly sensitive to the starting point, making initialization--often under-reported--a consequential degree of freedom. Random initialization is not a neutral default as it induces an implicit prior over candidate solutions and can systematically bias the result, producing large run-to-run variability. Here, we formalize this view by treating initialization as a hidden confounder in SciML and develop a unifying theory for structure-aware initialization via numerical continuation, constructing warm starts from related problem instances. Across representative tasks, including physics-informed neural networks, maximum likelihood estimation, and variational inference, warm starts have been shown to consistently reduce optimization effort and improve reliability.

Data integrity↗
DOE OSTI2020

An augmented Lagrangian filter method

Here, we introduce a filter mechanism to enforce convergence for augmented Lagrangian methods for nonlinear programming. In contrast to traditional augmented Lagrangian methods, our approach does not require the use of forcing sequences that drive the first-order error to zero. Instead, we employ a filter to drive the optimality measures to zero. Our algorithm is flexible in the sense that it allows for equality-constrained quadratic programming steps to accelerate local convergence. We also include a feasibility restoration phase that allows fast detection of infeasible problems. We provide a convergence proof that shows that our algorithm converges to first-order stationary points. We provide preliminary numerical results that demonstrate the effectiveness of our proposed method.

97 MATHEMATICS AND COMPUTING↗