SEARCH · Engineering Papers
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.
This contribution discusses some recent applications of time-series analysis in Random Matrix Theory (RMT), and applications of RMT in the statistial analysis of eigenspectra of correlation matrices of multivariate time series.
In stochastic systems, one is often interested in finding the optimal path that maximizes the probability of escape from a metastable state or of switching between metastable states. Even for simple systems, it may be impossible to find an analytic form of the optimal path, and in high-dimensional systems, this is almost always the case. In this article, we formulate a constructive methodology that is used to compute the optimal path numerically. The method utilizes finite-time Lyapunov exponents, statistical selection criteria, and a Newton-based iterative minimizing scheme. The method is applied to four examples. The first example is a two-dimensional system that describes a single population with internal noise. This model has an analytical solution for the optimal path. The numerical solution found using our computational method agrees well with the analytical result. The second example is a more complicated four-dimensional system where our numerical method must be used to find the optimal path. The third example, although a seemingly simple two-dimensional system, demonstrates the success of our method in finding the optimal path where other numerical methods are known to fail. In the fourth example, the optimal path lies in six-dimensional space and demonstrates the power of our method in computing paths in higher-dimensional spaces.
Liquid-fueled nuclear reactors, particularly molten salt reactors (MSRs), have recently gained significant interest in the advanced reactor community. As with all reactors, modeling and simulation are critical to advanced reactor design and licensing and will be required for MSR deployment. However, there are significant gaps in existing simulation capabilities for MSRs, particularly with the unique challenges of liquid-fueled systems (e.g., fission product transport). Furthermore, advanced reactor designers require near-term tools that are readily modifiable to perform design and analysis, including the ability to extend their analysis beyond the primary system to auxiliary systems. Transient Simulation Framework of Reconfigurable Models (TRANSFORM), a Modelica-based, system modeling library developed at Oak Ridge National Laboratory, is an advanced tool that can help meet some of the near-term needs of the advanced reactor community. Here, this paper describes advanced system modeling criteria and presents TRANSFORM to the advanced reactor community by demonstration of system modeling capabilities and support of advanced analysis workflows, i.e., the Risk Analysis Virtual Environment (RAVEN) framework from Idaho National Laboratory, using the liquid-fueled Molten Salt Demonstration Reactor (MSDR) as a reference design.
Through support of the US Department of Energy's Office of Basic Energy Sciences, Oak Ridge National Laboratory has begun applying machine learning methods to improve accelerator and target performance of the Spallation Neutron Source (SNS). These methods are being applied to the control optimization and power upgrade of the SNS Cryogenic Moderator System (CMS). A numerical model of the CMS has been developed to study these optimizations and system modifications using EcosimPro. This paper compares steady-state and transient numerical results with experimental data. Control optimization studies focused on dampening mass flow, temperature, and pressure fluctuations during sudden losses of accelerator beam power. This analysis was conducted by adjusting five proportional-integral-derivative controllers connected to four flow control valves and one heater. Future efforts include power uprate studies focused on increasing the CMS cooling capacity. The current accelerator power is 1.4 MW; the first target station is being upgraded to 2.0 MW as part of the Proton Power Upgrade effort. The CMS cooling capacity is sufficient for 2.0 MW operation.
Not Available
Abstract not provided.
The power grid evolves towards a new mix of generation and consumption that introduces new dynamic and stochastic behaviors. These emerging grid behaviors would invalidate the steady-state assumption in today’s state estimation – an essential function for real-time power grid operation. This paper examines this steady-state assumption and identifies the need for estimating dynamic states. Supporting technologies are presented as well as a proposed formulation for estimating dynamic states. Metrics for evaluating methods for solving the dynamic state estimation problem are proposed, with example results to illustrate the use of these metrics. The overall objective of this paper is to provide a basis that more research on this topic can follow.
Not provided.
Not provided.
The use of controllable motor-generator sets to emulate the dynamics of a hydrokinetic turbine is evaluated as an alternative to field testing a prototype. The emulator control dynamic equations are presented, methods for scaling turbine parameters are examined, and experimental results are presented from three electromechanical emulation machines (EEMs) programmed to emulate the same vertical-axis fixed-pitch turbine. Although hardware platforms and control implementations varied, results show that each EEM is successful in emulating the turbine model, thus demonstrating the general feasibility of the approach. However, performance of motor control under torque command, current command or speed command differed. In one of the EEMs evaluated, the power take off controller tracks the maximum power-point of the turbine in response to turbulence. Utilizing realistic inflow conditions and control laws, the emulator dynamic speed response is shown to agree well at low frequencies with numerical simulation but to deviate at high frequencies.
Not provided.
As CPU clock speeds have stagnated and high performance computers continue to have ever higher core counts, increased parallelism is needed to take advantage of these new architectures. Traditional serial time-marching schemes can be a significant bottleneck, as many types of simulations require large numbers of time-steps which must be computed sequentially. Parallel-in-time schemes, such as the Multigrid Reduction in Time (MGRIT) method, remedy this by parallelizing across time-steps and have shown promising results for parabolic problems. However, chaotic problems have proved more difficult, since chaotic initial value problems (IVPs) are inherently ill-conditioned. MGRIT relies on a hierarchy of successively coarser time-grids to iteratively correct the solution on the finest time-grid, but due to the nature of chaotic systems, small inaccuracies on the coarser levels can be greatly magnified and lead to poor coarse-grid corrections. Here we introduce a modified MGRIT algorithm based on an existing quadratically converging nonlinear extension to the multigrid Full Approximation Scheme (FAS), as well as a novel time-coarsening scheme. Together, these approaches better capture long-term chaotic behavior on coarse-grids and greatly improve convergence of MGRIT for chaotic IVPs. Further, we introduce a novel low-memory variant of the algorithm for solving chaotic PDEs with MGRIT which not only solves the IVP, but also provides estimates for the unstable Lyapunov vectors of the system. Finally, we provide supporting numerical results for the Lorenz system and demonstrate parallel speedup for the chaotic Kuramoto–Sivashinsky PDE over a significantly longer time-domain than in previous works.
Here, we present a pseudoreversible normalizing flow method for efficiently generating samples of the state of a stochastic differential equation (SDE) with various initial distributions. The primary objective is to construct an accurate and efficient sampler that can be used as a surrogate model for computationally expensive numerical integration of SDEs, such as those employed in particle simulation. After training, the normalizing flow model can directly generate samples of the SDE’s final state without simulating trajectories. The existing normalizing flow model for SDEs depends on the initial distribution, meaning the model needs to be retrained when the initial distribution changes. The main novelty of our normalizing flow model is that it can learn the conditional distribution of the state, i.e., the distribution of the final state conditional on any initial state, such that the model only needs to be trained once and the trained model can be used to handle various initial distributions. This feature can provide a significant computational saving in studies of how the final state varies with the initial distribution. Additionally, we propose to use a pseudoreversible network architecture to define the normalizing flow model, which has sufficient expressive power and training efficiency for a variety of SDEs in science and engineering, e.g., in particle physics. We provide a rigorous convergence analysis of the pseudoreversible normalizing flow model to the target probability density function in the Kullback–Leibler divergence metric. Numerical experiments are provided to demonstrate the effectiveness of the proposed normalizing flow model.
Relatively low energy neutrons (14 MeV) are excellent probes for thick systems, due to their penetrating capabilities. As fast pulses sources, such as the dense plasma focus (DPF) and laser driven sources, are developed the potential for using neutrons for flash radiography of thick systems is becoming feasible.