Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “large systems”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Solar system storms in the lab: creating a scaled interplanetary coronal mass ejection

As an active star, the Sun frequently ejects large systems of magnetized plasma called Interplanetary Coronal Mass Ejections (ICMEs). When these ICMEs reach Earth, they cause geomagnetic storms, and, depending on their intensity, can wreak havoc on modern society [3]. In this project, we designed, executed, and diagnosed a proof-of-principle experiment aimed at studying ICMEs in a laboratory setting.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Impact of model predictive control-enabled home energy management on large-scale distribution systems with photovoltaics

Residential customers use more than one-quarter of the electricity in the world. Optimally managing home energy consumption is an effective way of easing the operational challenges facing the electric grid with increasing solar photovoltaics (PV). This paper studies the impact of the future proliferation of home energy management systems (HEMS) in the presence of PV on large-scale distribution systems. First, we present a stochastic HEMS model that minimizes residential customers' thermal discomfort and energy costs under uncertainty. The HEMS model schedules the optimal operations of residential appliances in the presence of PV within a mixed-integer linear programming-based model predictive control framework that links the proposed HEMS to a quasi-steady-state time-series simulation tool. Additionally, extensive simulations are conducted for a stand-alone residential home using two tariff structures and for 1977 homes on an 8,500-node distribution feeder. Simulation results quantify the impact of the future proliferation of HEMS on the large-scale distribution system with PV.

14 SOLAR ENERGY↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Dual low vacuum-ultrahigh vacuum system for large-scale production of micro-channel plate photomultipliers

Systems and methods for the batch production of large numbers of highly uniform multichannel-plate photomultiplier tubes (MCP-PMTs) for large-scale applications are provided. The systems and methods employ dual, nested low-vacuum (LV) and UHV processing in a rapid-cycling, small-footprint, scalable, batch-production facility that is capable of fabricating many MCP-PMTs simultaneously.

Frisch, Henry J.↗
DOE OSTI2023

Commercial Building Sensors and Controls Systems: Barriers and Drivers: Preprint

Building sensors and controls systems, including building automation systems, comprise the sensor-based devices installed in buildings as well as the control and automation of those devices. Optimized sensors and controls systems could lead to 29% annual energy savings in commercial buildings and are integral to the growth of grid-interactive efficient buildings. Only 13% of small commercial buildings, however, have installed sensors and controls systems, largely because of cost barriers. To accelerate adoption, this work seeks to increase the transparency of system costs and identify specific barriers and drivers. To gather industry insights, the team reached out to building owners, vendors, and contractors and conducted 21 interviews with the goal of collecting cost data and market characteristics regarding building sensors and controls. We collected the cost data in the form of invoices and used it to develop a percentage-based cost category breakdown. The interview data were analyzed using grounded theory to identify overarching concepts such as barriers, drivers, and future directions. From this analysis, we found the primary barriers to be complex and confusing systems, lack of user skills, and financial concerns, and the primary drivers to be operational benefits, insight into operations, and remote access to data. The future directions analysis highlighted the potential technological solutions to address gaps and barriers, as well as predicted drivers to increase adoption. This greater understanding of the costs, barriers, and drivers associated with commercial building sensors and controls systems lays the groundwork for increasing system adoption, reducing energy consumption, and transforming the market.

building automation system↗
DOE OSTI2023

Control of multi-agent systems: Results, open problems, and applications

The purpose of this review article is to present some recent results on the modeling and control of large systems of agents. We focus on particular applications where the agents are capable of independent actions instead of simply reacting to external forces. In the literature, such agents were referred to as autonomous, intelligent, self-propelled, greedy, and others. The main applications we have in mind are social systems (as opinion dynamics), pedestrians’ movements (also called crowd dynamics), animal groups, and vehicular traffic. We note that the last three examples include physical constraints; however, the agents are able to inject energy into the system, thus preventing the typical conservation of momentum and energy. In addition, the control problems posed by such systems are new and require innovative methods. We illustrate some ideas developed recently, including the use of sparse controls, limiting the total variation of controls, and defining new control problems for measures. After reviewing various approaches, we discuss some future research directions of potential interest. The latter encompasses both new types of equations and new types of limiting procedures to connect several scales at which a system can be represented. We conclude by illustrating a recent real-life experiment using autonomous vehicles on an open highway to smooth traffic waves. This opens the door to a new era of interventions to control real-time multi-agent systems and to increase the societal impact of such interventions guided by control research.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Dynamic Equivalence of Large-Scale Power Systems Based on Boundary Measurements

Parallel computing helped speed up many tasks that can be done independently. The advance in gaming industry did not produce a technology that helps the power industry to reduce the computation time for dynamic simulation in individual cases. To perform faster than real-time simulation for the purpose of predicting power system dynamic trajectory, power industry continues to struggle to reduce the system size and simulation time of large-scale power systems while keeping its dynamic behavior under various disturbances. There is also an acute need for real-time dynamic model reduction as more renewables enter the generation mix with dramatic changes in the generation outputs. All existing model reduction solutions are based on having access to a detailed dynamic model of the system. The system changes by the minutes, dynamic models are only updated annually. To solve this problem, wide-area measurements obtained by the phasor measurement unit (PMU) at the boundaries between the reduced system and the study system is used to represent the external area. An artificial neuro-fuzzy inference system (ANFIS) is established to perform the mapping of the measurement to the external equivalent model. Here the external area is regarded as a black-box. Model reduction studies are conducted on the Northeast Power Coordinating Council (NPCC) under various types of contingencies, by using a co-simulation approach between PSS/E and MATLAB. The results look very promising and will be discussed in this paper.

Tong, Ning↗
DOE OSTI2024

Towards intelligent emergency control for large-scale power systems: Convergence of learning, physics, computing and control

Here, this paper has delved into the pressing need for intelligent emergency control in large-scale power systems, which are experiencing significant transformations and are operating closer to their limits with more uncertainties. Learning-based control methods are promising and have shown effectiveness for intelligent power system control. However, when they are applied to large-scale power systems, there are multifaceted challenges such as scalability, adaptiveness, and security posed by the complex power system landscape, which demand comprehensive solutions. The paper first proposes and instantiates a convergence framework for integrating power systems physics, machine learning, advanced computing, and grid control to realize intelligent grid control at a large scale. Our developed methods and platform based on the convergence framework have been applied to a large (more than 3000 buses) Texas power system, and tested with 56 000 scenarios. Our work achieved a 26% reduction in load shedding on average and outperformed existing rule-based control in 99.7% of the test scenarios. The results demonstrated the potential of the proposed convergence framework and DRL-based intelligent control for the future grid.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Scrambling Dynamics with Imperfections in a Solvable Model

We study how probes of quantum scrambling dynamics respond to two kinds of imperfections -- unequal forward and backward evolutions and decoherence -- in a solvable Brownian circuit model. We calculate a ``renormalized'' out-of-time-order correlator (ROTOC) in the model with $N$ qubits, and we show that the circuit-averaged ROTOC is controlled by an effective probability distribution in operator weight space which obeys a system of $N$ non-linear equations of motion. These equations can be easily solved numerically for large system sizes which are beyond the reach of exact methods. Moreover, for an operator initially concentrated on weight one $w_0=1$, we provide an exact solution to the equations in the thermodynamic limit of many qubits that is valid for all times, all non-vanishing perturbation strengths $p\gtrsim 1/\sqrt{N}$, and all decoherence strengths. We also show that a generic initial condition $w_0 >1$ leads to a metastable state that eventually collapses to the $w_0=1$ case after a lifetime $\sim \log(N/w_0)$. Our results highlight situations where it is still possible to extract the unperturbed chaos exponent even in the presence of imperfections, and we comment on the applications of our results to existing experiments with nuclear spins and to future scrambling experiments.

FOS: Physical sciences↗
DOE OSTI2020

NWPEsSe: an Adaptive-Learning Global Optimization Algorithm for Nanosized Cluster Systems

Global optimization constitutes an important and fundamental problem in theoretical studies in many chemical fields, such as catalysis, materials or separations problems. In this paper, a novel algorithm has been developed for the global optimization of large systems including neat and ligated clusters in gas phase, and supported clusters in periodic boundary conditions. The method is based on an updated artificial bee colony (ABC) algorithm method, that allows for adaptive-learning during the search process. The new algorithm is tested against four classes of systems of diverse chemical nature: gas phase Au_55, ligated Au_8^(2+), Au_8 supported on graphene oxide and defected rutile, and a large cluster assembly ?[Co?_6 Te_8 (PEt_3 )_6][C_60 ]_n, with sizes ranging between 1 to 3 nm and containing up to 1300 atoms. Reliable global minima (GMs) are obtained for all cases, either confirming published data or reporting new lower energy structures. The algorithm and interface to other codes in the form of an independent program, Northwest Potential Energy Search Engine (NWPEsSe), is freely available and it provides a powerful and efficient approach for global optimization of nanosized cluster systems. The work described in this publication was performed at Pacific Northwest National Laboratory (PNNL), which is operated by Battelle for the United States Department of Energy (DOE) under Contract DE-AC05-76RL0180. J. Z. and V.-A. G. acknowledge support from DOE, Office of Science, Office of Basic Energy Sci-ences, Chemical, Geological and Biological Sciences Division and computing resources from PNNL’s Research Computing Facility and the National Energy Research Scientific Computing Center.

Zhang, Jun↗
DOE OSTI2023

Many-Body Majorana Braiding without an Exponential Hilbert Space

Qubits built out of Majorana zero modes constitute the primary path toward topologically protected quantum computing. Simulating the braiding process of multiple Majorana zero modes corresponds to the quantum dynamics of a superconducting many-body system. It is crucial to study the Majorana dynamics both in the presence of all other quasiparticles and for reasonably large system sizes. We present a method to calculate arbitrary many-body wave functions as well as their expectation values, correlators, and overlaps from time evolved single-particle states of a superconductor, allowing for significantly larger system sizes. We calculate the fidelity, transition probabilities, and joint parities of Majorana pairs to track the quality of the braiding process. Here, we show how the braiding success depends on the speed of the braid. Moreover, we demonstrate the topological CNOT two-qubit gate as an example of two-qubit entanglement. Our Letter opens the path to test and analyze the many theoretical implementations of Majorana qubits. Moreover, this method can be used to study the dynamics of any noninteracting superconductor.

Majorana bound states↗
DOE OSTI2023

Search for the chiral magnetic wave using anisotropic flow of identified particles at energies available at the BNL Relativistic Heavy Ion Collider

The chiral magnetic wave (CMW) has been theorized to propagate in the deconfined nuclear medium formed in high-energy heavy-ion collisions, and to cause a difference in elliptic flow (v 2 ) between negatively and positively charged hadrons. Experimental data consistent with the CMW have been reported by the STAR Collaboration at the Relativistic Heavy Ion Collider (RHIC), based on the charge asymmetry dependence of the pion v 2 from Au+Au collisions at $\sqrt{s_{NN}}$ = 27 to 200 GeV. In this comprehensive study, we present the STAR measurements of elliptic flow and triangular flow of charged pions, along with the v 2 of charged kaons and protons, as a function of charge asymmetry in Au+Au collisions at $\sqrt{s_{NN}}$ = 27, 39, 62.4 and 200 GeV. The slope parameters extracted from the linear dependence of the v2 difference on charge asymmetry for different particle species are reported and compared in different centrality intervals. In addition, the slopes of v 2 for charged pions in small systems, i.e., p+Au and d+Au at $\sqrt{s_{NN}}$ = 200 GeV, are also presented and compared with those in large systems, i.e., Au+Au at $\sqrt{s_{NN}}$ = 200 GeV and U+U at 193 GeV. Our results provide new insights for the possible existence of the CMW, and further constrain the background contributions in heavy-ion collisions at RHIC energies.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Novel Fault Location Method for Power Systems Based on Attention Mechanism and Double Structure GRU Neural Network

Fault location is one of the most essential techniques to maintain the stable operation of power systems. A fast and accurate fault location allows operators to restore power grids faster and avoid economic losses. Conventional methods rely on expert knowledge to extract the necessary features (e.g. DWT, DFT). For large systems, more coupling effects of transmission lines require more complex feature engineering, and incomplete features can easily introduce large errors. To overcome this, a deep learning approach without manual feature extraction is introduced to the fault location model under big data application. Towards this end, in the proposed method, the attention mechanism, the Bi-GRU and a dual structure network are applied to analyze the current data from different perspectives. Complete information for the fault features is extracted for the fault location. Based on a time series model and benefit from the ability to internally acquire the information architecture of faulty line, the established model is adaptive to the power grids with very complex topologies. Simulation results indicate that the proposed double-structure model reduces the maximum error and is less affected by noise. In comparison with different structures and different models, the proposed method shows better performance in IEEE 39-bus system.

42 ENGINEERING↗
DOE OSTI2021

Actinide Molten Salts: A Machine-Learning Potential Molecular Dynamics Study

We know that actinide molten salts represent a class of important materials in nuclear energy. Understanding them at a molecular level is critical to proper and optimal design of relevant technological applications. Yet, owing to the complexity of electronic structure due to the 5f orbitals, computational studies of heavy elements in condensed phases using ab initio potentials to study the structure and dynamics of these elements embedded in molten salts are difficult. This lack of efficient computational protocols makes it difficult to obtain information on properties that require extensive statistical sampling like transport. To tackle this problem, we adopted a machine-learning approach to study ThCl 4 -NaCl and UCl 3 -NaCl binary systems. The machine-learning potential, with the density functional theory accuracy, allows us to obtain long molecular dynamics trajectories (ns) for large systems (10 3 atoms) at a considerably low computing cost, thereby efficiently gaining information about their bonding structures, thermodynamics, and dynamics at a range of temperature. We observed a considerable change in the coordination environments of actinide elements and their characteristic coordination-sphere lifetime. Our study also suggests that actinides in molten salts may not follow well known entropy-scaling laws.

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

The FMO-DFTB Method

Although the fragment molecular orbital (FMO) method enables electronic structure calculations with near-linear scaling behavior with respect to system size, the computational cost of ab initio methods typically employed in conjunction with FMO is still prohibitive for routine calculations of very large systems or long timescale molecular dynamics simulations. We, therefore, combined the FMO and density-functional tight-binding (DFTB) method, which is one of the emerging semi-empirical quantum chemical methods, and have demonstrated that FMO-DFTB is capable of performing geometry optimizations for systems containing up to one million atoms using limited computational resources. In this chapter, we will review the basics of the DFTB method first before introducing FMO-DFTB, focusing on the relationship with density functional theory and other FMO methodologies. We also demonstrate the latest scalings of FMO-DFTB2 and DFTB3 using three-dimensional water clusters, showing that the most favorable scaling is O(N1.16). Applications of FMO-DFTB to various systems are briefly summarized, and an outlook to future applications is provided.

Nishimoto, Yoshio↗
DOE OSTI2024

Reduced-dimension Bayesian optimization for model calibration of transient vapor compression cycles

Development and calibration of first-principles dynamic models of vapor compression cycles (VCCs) is of critical importance for applications that include control design and fault detection and diagnostics. Nevertheless, the inherent complexity of models that are represented by large systems of differential–algebraic equations leads to significant challenges for model calibration processes that utilize classical gradient-based methods. Bayesian optimization (BO) is a sample-efficient and gradient-free approach using a probabilistic surrogate model and optimal search over a feasible parameter space. Despite the benefits of BO in reducing computational costs, challenges remain in dealing with a high-dimensional calibration task resulting from a large set of parameters that have significant impacts on system behavior and need to be calibrated simultaneously. This paper presents a reduced-dimension BO framework for calibrating transient VCCs models where the calibration space is projected to a low-dimensional subspace for accelerating convergence of the solution algorithm and consequently reducing the number of transient simulations. The proposed approach was demonstrated via two case studies associated with different VCC applications where 10 parameters were calibrated in each case using laboratory measurements. The reduced-dimension BO framework only required 1 / 8 th of the iterations associated with a standard BO method that deals with high-dimensional calibration parameters for converged solutions and yielded comparable accuracy. Furthermore, both calibrated models revealed significant accuracy improvements compared to uncalibrated models.

Ma, Jiacheng↗