Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computation time”

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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Spectral Clustering-Based Partitioning of Large-Scale Power Electronics-Based Power Systems for Small-Signal Stability Analysis

The nodal admittance matrix (NAM)-based approach is well-suited for small-signal stability analysis of large-scale power electronics-based power systems (PEPSs), as it preserves the system structure through its admittance matrix. Previous studies have explored partitioning such systems into subareas and interconnections to reduce computational burden; however, they lacked a formal algorithmic procedure for determining feasible partitions. While several grid partitioning methods, such as those based on graph theory or machine learning, exist in the literature, they cannot be directly applied to NAM-based analysis due to differing objectives and constraints. Here, this paper addresses this gap by presenting a systematic, step-by-step procedure for applying a spectral partitioning algorithm that yields a division of the system into subareas suitable for NAM-based analysis. The computational complexity of the proposed method is also derived to demonstrate its efficiency and justify the practicality of the resulting subarea decomposition. The performance of the partitioning method is evaluated by applying the spectral clustering-derived subareas and interconnections to the NAM-based partitioning approach on a 140-bus system. Computational times for the full-system and partitioned NAM analyses are compared using MATLAB. Additionally, PSCAD simulations of the complete system and partitioned subareas are carried out to verify the effectiveness of the proposed method.

Nupur [Univ. of Tennessee, Knoxville, TN (United S↗
DOE OSTI2020

A Hybrid Framework Combining Model-Based and Data-Driven Methods for Hierarchical Decentralized Robust Dynamic State Estimation

This paper combines model-based and data-driven methods to develop a hierarchical, decentralized, robust dynamic state estimator (DSE). A two-level hierarchy is proposed, where the lower level consists of robust, model-based, decentralized DSEs. The state estimates sent from the lower level are received at the upper level, where they are filtered by a robust data-driven DSE after a principled sparse selection. This selection allows us to shrink the dimension of the problem at the upper level and hence significantly speed up the computational time. The proposed hybrid framework does not depend on the centralized infrastructure of the control centers; thus it can be completely embedded into the wide-area measurement systems. This feature will ultimately facilitate the placement of hierarchical decentralized control schemes at the phasor data concentrator locations. Also, the network model is not necessary; thus, a topology processor is not required. Finally, there is no assumption on the dynamics of the electric loads. The proposed framework is tested on the 2,000-bus synthetic Texas system, and shown to be capable of reconstructing the dynamic states of the generators with high accuracy, and of forecasting in the advent of missing data.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

A Hierarchical Volt-var Optimization with Discrete Variables in Unbalanced Distribution Systems

This paper proposes a framework to determine the optimal active and reactive power dispatch of distributed photovoltaic (PV) generation, switched capacitors, and voltage regulators in multi-phase unbalanced distribution systems. The objectives of the optimal dispatch are minimization of the energy loss, PV real power curtailment, and switching operations of capacitors and voltage regulators, in addition to elimination of voltage violation and reverse power flow. The optimization problem is formulated in rectangular coordinates as a nonlinear, nonconvex problem with discrete variables. A hierarchical twostage framework is proposed to effectively handle those discrete variables and reduce the computational time compared to the unified approach in which all variables are solved simultaneously. The efficacy of the proposed approach and the accuracy of the obtained numerical solution is validated using the unbalanced multi-phase IEEE 34-bus with 15-minute load and PV data.

Nguyen, Quan H.↗
DOE OSTI2022

Dynamic Parameter Estimation with Physics-based Neural Ordinary Differential Equations

Accurate estimation of dynamic parameters of gen-erators is crucial to building a reliable model for dynamical studies and reliable operation of the power system. This paper develops a physics-based neural ordinary differential equations (ODE) approach to learn the parameters of generator dynamic model using phasor measurement units (PMU) data. We design a physics-based neural network to represent the swing equations of the power system dynamics. A loss function is defined as the difference between dynamic simulation results from the physics-based neural networks and pseudo PMU measurements. The parameters of generator dynamic model are iteratively updated using the neural ODEs and the adjoint method. By exploiting the mini-batch scheme in neural ODE training, the parameter estimation performance is significantly improved. Numerical study results on a 3-machine 9-bus system show that the proposed algorithm outperforms state-of-the-art baseline method in both computation time and dynamic parameter estimation accuracy.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Assessing the Feasibility of Bordered Block Diagonal Reordering in Power System Matrices using Fully Convolutional Network

In electromagnetic transient (EMT) simulations for power systems and inverter-based resources (IBRs), the arrangement of states within the system's linear equations, represented by matrix A in Ax=b, is critical. The state ordering in matrix A can highlight distinct characteristics of the system's graph, and identifying an optimal state ordering is crucial for efficient computation. The choice of state ordering, however, is dependent on the solver used, as each solver may perform optimally with different matrix patterns. With a wide array of matrix reordering algorithms available, selecting the most suitable one becomes challenging without insights into the matrix's ideal configuration. To address this, the paper proposes a fully convolutional network (FCN) to evaluate the reordering potential of the A matrix into a bordered block diagonal (BBD) pattern, which is commonly observed in power system and IBR modeling. The FCN's assessment aims to streamline the solver's operation, which in turn could substantially reduce the computational time required to find a solution.

Xia, Qianxue↗
DOE OSTI2025

RE-INTEGRATE EMT Simulation Software: Graph Convolutional Network for Sparse Matrix Pattern Detection

The increasing complexity of power networks, driven by proliferation of inverters, presents analytical challenges that simplified models often fail to capture, necessitating Electromagnetic Transient (EMT) simulations. EMT models are represented as discretized differential-algebraic equations (DAEs), forming a linear system Ax = b that is computationally intensive to solve. Due to inherent sparsity of adjacency matrix A, distinct patterns emerge that, when accurately identified, enable efficient solver selection to minimize computation time. However, identifying ideal pattern is complicated by numerous reordering algorithms and limited structural insights. To address this, we introduce a Graph Convolutional Network (GCN) model for classifying sparse matrix patterns common in power system analysis. The model, achieving 96% test accuracy, is validated using PV plant models of 125 MW capacities connected to New England 39-bus transmission system (TS), and further scaled to a 4,992-bus network with 384 PV plants, yielding 191, 616 × 191, 616 sized A matrix. For all cases, the GCN model accurately identifies the matrix’s intrinsic sparse pattern, demonstrating its potential to enhance solver performance in EMT analysis.

Hossain, Md Rifat [Florida International Universit↗
DOE OSTI2021

Collaborative Decision Approach for Electricity Pricing-demand Response Stackelberg Game

Demand response programs are considered as a valuable resource in smart grids that provide several advantages of load shifting, peak load reduction, mediating intermittency of renewable energy integration, etc. Flexible price-based incentives have been recognized as a critical strategy in motivating and compensating consumers' load adjustment actions for successful implementation of demand response. Game theoretical approaches, especially Stackelberg games are popularly adopted to model the relationship between electricity price and customers' demand response and solved by the classical centralized backward induction (BI) method. However, the BI method generally requires convexity of the follower's model for necessary optimality conditions, and the computational time of any centralized approach increases sharply with larger problem instances. In this paper, the Stackelberg game of electricity pricing-demand response between a distribution system operator (DSO) and load aggregators (LAs) is decomposed based on a collaborative optimization (CO) framework, where each LA is treated as a discipline with its own domain constraints (e.g. building temperature control), while the DSO at the system level tries to reduce the solution discrepancy and guide the searching towards optimality. Several groups of comparison experiments have demonstrated the effectiveness of the proposed collaborative decision approach in solving the demand response game.

Chen, Yang↗
DOE OSTI2021

A Butterfly-Accelerated Volume Integral Equation Solver for Broad Permittivity and Large-Scale Electromagnetic Analysis

In this work, a butterfly-accelerated volume integral equation (VIE) solver is proposed for fast and accurate electromagnetic (EM) analysis of scattering from heterogeneous objects. The proposed solver leverages the hierarchical off-diagonal butterfly (HOD-BF) scheme to construct the system matrix and obtain its approximate inverse, used as a preconditioner. Complexity analysis and numerical experiments validate the O(N log 2 N) construction cost of the HOD-BF-compressed system matrix and O(N log 1.5 N) inversion cost for the preconditioner, where N is the number of unknowns in the high-frequency EM scattering problem. For many practical scenarios, the proposed VIE solver requires less memory and computational time to construct the system matrix and obtain its approximate inverse compared to a H matrix-accelerated VIE solver. The accuracy and efficiency of the proposed solver have been demonstrated via its application to the EM analysis of large-scale canonical and real-world structures comprising of broad permittivity values and involving millions of unknowns.

42 ENGINEERING↗
DOE OSTI2025

Physics-Informed Graph Neural Networks for Collaborative Dynamic Reconfiguration and Voltage Regulation in Unbalanced Distribution Systems

Network reconfiguration has long been employed as a strategic approach to minimize power distribution system losses and effectively regulate voltage levels. Tap-changing voltage regulators are also critical for controlling bus voltages, especially in accommodating the increasing integration of distributed energy resources (DERs) with intermittent outputs. This paper introduces novel methodologies to address the challenges of dynamic reconfiguration and optimal tap setting in unbalanced three-phase distribution systems. We propose an approximated mixed-integer quadratically constrained program (MIQCP) to model dynamic reconfiguration, along with a pioneering formulation for voltage regulator (VR) tap-setting based on Special Ordered Set type 1 (SOS1). To mitigate computational complexity, we propose a physics-informed spatial-temporal graph convolutional network (STGCN) with an integrated link classifier. The proposed approach enables efficient solution generation by fixing specific variables in the MIQCP instance and solving the simplified sub-MIP using an MIP solver. Numerical studies demonstrate the superior prediction accuracy of our STGCN model compared to baseline neural network models, resulting in reduced DER curtailment and voltage deviation with shorter computation time.

dynamic reconfiguration↗
DOE OSTI2026

Data-Driven Performance Optimization of Gamma Spectrometers With Many Channels

In gamma spectrometers with variable spectroscopic performance across many channels (e.g., many pixels or voxels), a tradeoff exists between including data from successively worse-performing readout channels and increasing efficiency. Brute-force calculation of the optimal set of included channels is exponentially infeasible as the number of channels grows, and approximate methods are required. In this work, we present a data-driven framework for attempting to find near-optimal sets of included detector channels. The framework leverages non-negative matrix factorization (NMF) to learn the behavior of gamma spectra across the detector and clusters similarly-performing detector channels together. Performance comparisons are then made between spectra with channel clusters removed, which is more feasible than brute force. The framework is general and can be applied to arbitrary, user-defined performance metrics depending on the application. We apply this framework to optimizing gamma spectra measured by H3D M400 CdZnTe (CZT) spectrometers, which exhibit variable performance across their crystal volumes. In particular, we show several examples optimizing various performance metrics for uranium and plutonium gamma spectra in non-destructive assay (NDA) for nuclear safeguards, and explore trends in performance versus parameters such as clustering algorithm type. We also compare the NMF + clustering pipeline to several non-machine-learning (ML) algorithms, including several greedy algorithms. Although, we find that the NMF + clustering pipeline tends to find the best-performing set of detector voxels, significantly improving over the unoptimized spectra, but that a greedy accumulation of spectra segmented by detector depth can, in some cases, give similar performance improvements in much less computation time.

Energy resolution↗
DOE OSTI2021

Network-Level Optimization for Unbalanced Power Distribution System: Approximation and Relaxation

The nonlinear programming (NLP) problem to solve distribution-level optimal power flow (D-OPF) poses convergence issues and does not scale well for unbalanced distribution systems. The existing scalable D-OPF algorithms either use approximations that are not valid for an unbalanced power distribution system, or apply relaxation techniques to the nonlinear power flow equations that do not guarantee a feasible power flow solution. In this paper, we propose scalable D-OPF algorithms that simultaneously achieve optimal and feasible solutions by solving multiple iterations of approximate, or relaxed, D-OPF subproblems of low complexity. The first algorithm is based on a successive linear approximation of the nonlinear power flow equations around the current operating point, where the D-OPF solution is obtained by solving multiple iterations of a linear programming (LP) problem. The second algorithm is based on the relaxation of the nonlinear power flow equations as conic constraints together with directional constraints, which achieves optimal and feasible solutions over multiple iterations of a second-order cone programming (SOCP) problem. Finally, it is demonstrated that the proposed algorithms are able to reach an optimal and feasible solution while significantly reducing the computation time as compared to an equivalent NLPD-OPF model for the same distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Make the Fastest Faster: Importance Mask Synthesis for Interactive Volume Visualization using Reconstruction Neural Networks

Visualizing a large-scale volumetric dataset with high resolution is challenging due to the substantial computational time and space complexity. Recent deep learning-based image inpainting methods significantly improve rendering latency by reconstructing a high-resolution image for visualization in constant time on GPU from a partially rendered image where only a portion of pixels go through the expensive rendering pipeline. However, existing solutions need to render every pixel of either a predefined regular sampling pattern or an irregular sample pattern predicted from a low-resolution image rendering. Both methods require a significant amount of expensive pixel-level rendering. In this work, we provide Importance Mask Learning (IML) and Synthesis (IMS) networks, which are the first attempts to directly synthesize important regions of the regular sampling pattern from the user’s view parameters, to further minimize the number of pixels to render by jointly considering the dataset, user behavior, and the downstream reconstruction neural network. Our solution is a unified framework to handle various types of inpainting methods through the proposed differentiable compaction/decompaction layers. Experiments show our method can further improve the overall rendering latency of state-of-the-art volume visualization methods using reconstruction neural network for free when rendering scientific volumetric datasets. Our method can also directly optimize the off-the-shelf pre-trained reconstruction neural networks without elongated retraining.

Large-scale data↗
DOE OSTI2022

Deep learning multiphysics network for imaging CO 2 saturation and estimating uncertainty in geological carbon storage

Multiphysics inversion exploits different types of geophysical data that often complement each other and aims to improve overall imaging resolution and reduce uncertainties in geophysical interpretation. Despite the advantages, traditional multiphysics inversion is challenging because it requires a large amount of computational time and intensive human interactions for preprocessing data and finding trade-off parameters. These issues make it nearly impossible for traditional multiphysics inversion to be applied as a real-time monitoring tool for geological carbon storage. In this paper, we present a deep learning (DL) multiphysics network for imaging CO 2 saturation in real time. The multiphysics network consists of three encoders for analysing seismic, electromagnetic and gravity data and shares one decoder for combining imaging capabilities of the different geophysical data for better predicting CO 2 saturation. The network is trained on pairs of CO 2 label models and multiphysics data so that it can directly image CO 2 saturation. Here we use the bootstrap aggregating method to enhance the imaging accuracy and estimate uncertainties associated with CO 2 saturation images. Using realistic CO 2 label models and multiphysics data derived from the Kimberlina CO 2 storage model, we evaluate the performance of the deep learning multiphysics network and compare its imaging results to those from the deep learning single-physics networks. Our modelling experiments show that the deep learning multiphysics network for seismic, electromagnetic, and gravity data not only improves the imaging accuracy but also reduces uncertainties associated with CO 2 saturation images. Our results also suggest that the deep learning multiphysics network for the non-seismic data (i.e., electromagnetic and gravity) can be used as an effective low-cost monitoring tool in between regular seismic monitoring.

58 GEOSCIENCES↗
DOE OSTI2022

Effect of the J-Shaped Wind Turbine Airfoil Opening Ratio and Thickness on the Performance of Symmetrical Airfoils

Abstract In this work, the effect of the inner opening ratio on the J-shaped airfoils aerodynamic performance was studied and documented for symmetrical airfoils. Three different airfoil thicknesses were investigated: small (NACA0008), medium (NACA0015), and large (NACA0024). For each airfoil thickness, effects of three inner opening ratios were analyzed: one-third, one-half, and two-thirds. The performance of each opening ratio was compared with the performance of the solid airfoil “zero opening ratio” for different angles of attack between 5 deg and 20 deg. All designs were simulated using the computational fluid dynamics (CFD) technology against experimental results for solid NACA4412 airfoil in the University of Wisconsin-Milwaukee (UWM) wind tunnel facility and other published experimental data. It was found that large eddy simulation yields accurate solutions with a smaller number of mesh cells compared to the k–ω turbulence model but with much longer computational time. The lift-to-drag ratio for all studied airfoils has a maximum value for solid airfoils compared to those equipped with openings. For airfoils equipped with 00.00% opening ratio “solid,” NACA0015 airfoil has the maximum lift-to-drag ratio. Furthermore, it was found that NACA0008 equipped with a 33.33% opening ratio has the best performance of all studied J-shaped airfoils.

Energy & Fuels↗
DOE OSTI2021

An Investigation of the Effects of Volume Fraction on Drag Coefficient of Non-Spherical Particles Using PR-DNS

Prediction of the drag coefficient is required in gas-particle multiphase flow modeling and simulation. Experimental data and correlations on the fixed-bed system of spherical particles with high volume fractions for various possible arrangements are available in the literature. However, the effect of volume fraction on the drag coefficient of non-spherical particles is not well studied. In solving the momentum equation, the volume fraction plays a vital role in determining the flow resistances. In this paper, we study the impact of volume fraction in the range of 0.069 to 0.65 on the drag coefficient using the computational fluid dynamics (CFD) simulation of air for Reynold number in the range of 10 to 10000 using particle resolved direct numerical solution (PR-DNS). Regular non-spherical particles such as a cube, tetrahedron, and spheroids are used in this study since their single particle’s drag coefficient data are available in the literature for comparison. For this work, the simulations are carried out in the Ansys Fluent using polyhedral mesh, which consumes significantly less computational time and power. The study showed the sphericity and volume fraction have significant impact on the bed pressure drop and average drag coefficient of the particles in the bed especially in high Reynolds number regime. The bed of the spheroid experiences the lowest drag being the most streamlined particle, and the particles with the edges result in a large drag coefficient due to flow separation at the discontinuity. The vector plots verify this behavior where large wake regions are observed behind the tetrahedron particle.

Mahyawansi, Pratik↗
DOE OSTI2024

Efficient Modeling of Floating Wind Arrays Including Current Loads and Seabed Bathymetry

Capabilities for modeling the effects of seabed bathymetry and current drag loads on a floating wind farm are now available in an open-source model for quasi-static analysis. In this model, mooring lines and dynamic cables are represented by a quasi-static solver that can quickly represent complex mooring/cabling arrangements and arrays of floating bodies. To account for seabed bathymetry, we expand the model to include a surface mesh that captures changes in water depth over a rectangular grid. We formulate modifications to the catenary equations that capture a mooring line's profile and tensions when contacting a slope seabed. To account for current drag loads on mooring lines and dynamic cables, we formulate a novel technique that rotates the reference frame so that the vector sum of the the weight and the current force are used in the catenary equations, while accounting for the seabed orientation. To complete the system, current drag loads on floating substructures are handled by inclusion of strip-theory drag calculations. These new capabilities are verified by comparing with results from the established offshore dynamics models MoorDyn and OrcaFlex in equivalent steady-state scenarios. The results show very good agreement for both sloped seabeds and current loads. With computation times of the quasi-static model typically under one second, the model additions are a useful capability toward rapidly evaluating a floating wind array's response to environmental loads under realistic site conditions.

bathymetry↗