Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “deterministic method”

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 235 records · Page 13

Learning in Modal Space: Solving Time-Dependent Stochastic PDEs Using Physics-Informed Neural Networks

One of the open problems in scientific computing is the long-time integration of nonlinear stochastic partial differential equations (SPDEs), especially with arbitrary initial data. We address this problem by taking advantage of recent advances in scientific machine learning and the spectral dynamically orthogonal (DO) and borthogonal (BO) methods for representing stochastic processes. The recently introduced DO/BO methods reduce the SPDE to solving a system of deterministic PDEs and a system of stochastic ordinary differential equations. Specifically, we propose two new physics-informed neural networks (PINNs) for solving time-dependent SPDEs, namely the neural network (NN)-DO/BO methods. The proposed methods incorporate the DO/BO constraints into the loss function (along with the modal decomposition of the SPDE) with an implicit form instead of generating explicit expressions for the temporal derivatives of the DO/BO modes. Hence, the NN-DO/BO methods can overcome some of the drawbacks of the original DO/BO methods. For example, we do not need the assumption that the covariance matrix of the random coefficients is invertible as in the original DO method, and we can remove the assumption of no eigenvalue crossing as in the original BO method. Moreover, the NN-DO/BO methods can be used to solve time-dependent stochastic inverse problems with the same formulation and same computational complexity as for forward problems. Furthermore, we demonstrate the capability of the proposed methods via several numerical examples, namely: (1) A linear stochastic advection equation with deterministic initial condition: we obtain good results with the proposed methods, while the original DO/BO methods cannot be applied directly in this case. (2) Long-time integration of the stochastic Burgers' equation: we show the good performance of NN-DO/BO methods, especially the effectiveness of the NN-BO approach for such problems with many eigenvalue crossings during the whole time evolution, while the original BO method fails. (3) Nonlinear reaction diffusion equation: we consider both the forward problem and the inverse problems, including very noisy initial point values, to investigate the flexibility of the NN-DO/BO methods in handling inverse and mixed type problems. Taken together, these simulation results demonstrate that the NN-DO/BO methods can be employed to effectively quantify uncertainty propagation in a wide range of physical problems, but future work should address the efficiency issue of PINNs for forward problems.

97 MATHEMATICS AND COMPUTING↗

Neutronics and thermal-hydraulics simulation of generic pebble-bed fluoride-salt-cooled high-temperature reactor (gFHR)

The fluoride-salt-cooled high-temperature reactor (FHR) is one type of the advanced reactors and has been attracting great interest from the research institutes and commercial companies in the recent years. However, currently the technology is relatively immature. To facilitate the design and safety analysis of FHRs, Kairos Power published the generic FHR (gFHR) benchmark. In this paper, a hybrid method combining the stochastic code and deterministic code is developed to simulate the gFHR benchmark. Serpent 2 is employed as a few-group cross section generator and the cross sections are applied to the finite difference neutron diffusion code AGREE. A good consistency with the gFHR benchmark is achieved. The agreement between the Serpent 2 results and the AGREE results shows that the hybrid method is applicable to FHRs. The thermal-hydraulics are coupled to neutronics for the steady-state calculations and good agreement between AGREE and SAM is achieved. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Calculation of multi-group migration areas in deterministic transport simulations

Recent work on the Cumulative Migration Method (CMM) has demonstrated that it is possible to define multi-group transport cross sections directly from Monte Carlo spectral calculations by utilizing edits of the energy-dependent neutron migration areas. However, it is difficult to demonstrate that downstream deterministic transport calculations actually preserve Monte Carlo migration areas. This paper addresses this issue by: 1) demonstrating the relationship of migration area with the concept of mean squared displacement, 2) deriving, and validating vs. Monte Carlo, an analytic expression for computing one-group migration areas for a homogeneous medium with energy-independent cross sections, 3) deriving, and validating vs. Monte Carlo, an analytic expression for computing multi-group migration areas for a homogenized medium with energy-dependent cross sections, and 4) rigorously proving that energy condensation of multi-group transport cross section must be inverse flux weighted in order to preserve Monte Carlo neutron migration areas.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Extended Summary: Performance Improvements to the 2D/1D Subplane Method in MPACT

Recent work in MPACT, the primary deterministic neutron transport solver in CASL’s VERA, has focused on significantly improving the overall performance of the calculations and many components within the code have been improved. The paper focuses on the most recent development to improve the 2D/1D subplane method in preparation for a production-level capability. The key developments presented here focus on incorporating a multilevel-in-space CMFD solver that also collapses on the subplane bases, a dynamic subplane meshing capability that better preserves accuracy during control rod movements, and overall usability improvements to make using the subplane method seamless. Compared to the current default 2D/1D solver in MPACT, substantial improvements are demonstrated on two progression problems, including a standard quarter core model, where potential savings observed at ~2× in memory and ~5-6× in core-hour requirements.

Stimpson, Shane G.↗

Performance Improvements to the 2D/1D Subplane Method in MPACT

Recent work in MPACT, the primary deterministic neutron transport solver in CASL’s VERA, has focused on significantly improving the overall performance of the calculations and many components within the code have been improved. The paper focuses on the most recent development to improve the 2D/1D subplane method in preparation for a production-level capability. The key developments presented here focus on incorporating a multilevel-in-space CMFD solver that also collapses on the subplane bases, a dynamic subplane meshing capability that better preserves accuracy during control rod movements, and overall usability improvements to make using the subplane method seamless. Compared to the current default 2D/1D solver in MPACT, substantial improvements are demonstrated on two progression problems, including a standard quarter core model, where potential savings observed at ~2× in memory and ~5-6× in core-hour requirements.

Stimpson, Shane G.↗

Approximate Dynamic Programming With Enhanced Off-Policy Learning for Coordinating Distributed Energy Resources

Herein this paper proposes an innovative approximate dynamic programming (ADP) method for distributed energy resource coordination with the loss of life of battery energy storage system (BESS) explicitly modeled. The dispatch policy is designed to account for both calendrical and cyclical aging effects on BESS, explicitly modeling the impacts of ambient temperature on BESS lifespan. The proposed ADP employs an adaptive critic method and enhanced off-policy deterministic policy gradient (DPG) strategy, addressing the limitations of the on-policy gradient-based ADP approaches, including inadequate exploration, low data usage, and computational complexity. In particular, a customized policy is proposed to guide the algorithm to explore some promising decisions and thereby improve exploration capability and learning efficiency compared to conventional DPG-based learning approaches, which may struggle to find a global optimum due to random noisy action-based exploration or require expert demonstration with extra effort. The proposed method is illustrated using the IEEE 123-node system and compared with the existing ADP methods to prove solution accuracy and demonstrate the effects of incorporating degradation models into control design. Case studies showed that the proposed ADP effectively coordinates DERs with a 10 times smaller optimization gap compared to existing methods, and the incorporation of the BESS life loss model ensures the expected lifespan and results in significant cost savings.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Mapping methods for computationally efficient and accurate structural reliability

Mapping methods are developed to improve the accuracy and efficiency of probabilistic structural analyses with coarse finite element meshes. The mapping methods consist of the following: (1) deterministic structural analyses with fine (convergent) finite element meshes; (2) probabilistic structural analyses with coarse finite element meshes; (3) the relationship between the probabilistic structural responses from the coarse and fine finite element meshes; and (4) a probabilistic mapping. The results show that the scatter in the probabilistic structural responses and structural reliability can be efficiently predicted using a coarse finite element model and proper mapping methods with good accuracy. Therefore, large structures can be efficiently analyzed probabilistically using finite element methods.

Shiao, Michael C.↗

Multirobot Collaborative Pursuit Target Robot by Improved MADDPG

Policy formulation is one of the main problems in multirobot systems, especially in multirobot pursuit-evasion scenarios, where both sparse rewards and random environment changes bring great difficulties to find better strategy. Existing multirobot decision-making methods mostly use environmental rewards to promote robots to complete the target task that cannot achieve good results. This paper proposes a multirobot pursuit method based on improved multiagent deep deterministic policy gradient (MADDPG), which solves the problem of sparse rewards in multirobot pursuit-evasion scenarios by combining the intrinsic reward and the external environment. The state similarity module based on the threshold constraint is as a part of the intrinsic reward signal output by the intrinsic curiosity module, which is used to balance overexploration and insufficient exploration, so that the agent can use the intrinsic reward more effectively to learn better strategies. The simulation experiment results show that the proposed method can improve the reward value of robots and the success rate of the pursuit task significantly. The intuitive change is obviously reflected in the real-time distance between the pursuer and the escapee, the pursuer using the improved algorithm for training can get closer to the escapee more quickly, and the average following distance also decreases.

Zhou, Xiao↗

Probabilistic structural analysis methods for improving Space Shuttle engine reliability

Probabilistic structural analysis methods are particularly useful in the design and analysis of critical structural components and systems that operate in very severe and uncertain environments. These methods have recently found application in space propulsion systems to improve the structural reliability of Space Shuttle Main Engine (SSME) components. A computer program, NESSUS, based on a deterministic finite-element program and a method of probabilistic analysis (fast probability integration) provides probabilistic structural analysis for selected SSME components. While computationally efficient, it considers both correlated and nonnormal random variables as well as an implicit functional relationship between independent and dependent variables. The program is used to determine the response of a nickel-based superalloy SSME turbopump blade. Results include blade tip displacement statistics due to the variability in blade thickness, modulus of elasticity, Poisson's ratio or density. Modulus of elasticity significantly contributed to blade tip variability while Poisson's ratio did not. Thus, a rational method for choosing parameters to be modeled as random is provided.

Boyce, L.↗

Probabilistic Forecast of Single–Phase Flow in Porous Media With Uncertain Properties

Uncertainty about geologic makeup and properties of the subsurface renders inadequate a unique quantitative prediction of flow and transport. Instead, multiple alternative scenarios have to be explored within the probabilistic framework, typically by means of Monte Carlo simulations (MCS). These can be computationally expensive, and often prohibitively so, especially when the goal is to compute the tails of a distribution, i.e., probabilities of rare events, which are necessary for risk assessment and decision making under uncertainty. We deploy the method of distributions to derive a deterministic equation for the cumulative distribution function (CDF) of hydraulic head in an aquifer with uncertain (random) hydraulic conductivity. The CDF equation relies on a self-consistent closure approximation, which ensures that the resulting CDF of hydraulic head has the same mean and variance as those computed with either statistical moment equation (the approach used herein) or MCS. We conduct a series of numerical experiments dealing with steady-state two-dimensional flow driven by either a natural hydraulic head gradient or a pumping well. Furthermore, these experiments reveal that the CDF method remains accurate and robust for highly heterogeneous formations with the variance of log conductivity as large as five. For the same accuracy, it is also up to four orders of magnitude faster than MCS in computing hydraulic head with a required degree of confidence (probability).

42 ENGINEERING↗

Harnessing structural stochasticity in the computational discovery and design of microstructures

This paper presents a deep generative model-based design methodology for tailoring the structural stochasticity of microstructures. Although numerous methods have been established for designing deterministic (periodic) or stochastic microstructures, a systematic design approach that allows the unified treatment of both deterministic and stochastic microstructure design domains has yet to be created. The proposed methodology resolves this issue by learning a unified feature space that embodies diverse structural patterns with continuously varying stochasticity levels. A highly diverse microstructure database is established to incorporate various types of deterministic and stochastic microstructure patterns. A property-aware deep generative model is proposed to learn a unified feature space of the structural characteristics, as well as the relationship between structure features and properties of interest. Autoencoder (AE), Variational Autoencoder (VAE), and Adversarial Autoencoder (AAE) are compared to understand their relative merits in the property-aware learning of the unified feature space. Microstructural designs with tailorable stochasticity and properties are obtained by searching the unified feature space. Multiple design cases are presented to demonstrate the capability of designing microstructures for structural stochasticity and properties. Furthermore, the proposed method is employed to create stochastically graded structures, which manipulate the mechanical behaviors by varying the local stochasticity of the structure.

36 MATERIALS SCIENCE↗

High-fidelity Pebble Bed Reactor Depletion Based on Pebble Tracking Transport in Griffin

The pebble tracking transport (PTT) method is a high-fidelity, heterogeneous deterministic transport technique for pebble bed reactor analysis. It discretizes the broad-group neutron transport equation in space and angle with the discontinuous finite element and the discrete ordinates method, and utilizes various solving techniques, including mesh sweeping and diffusion acceleration, to provide pebble- wise reaction rates. This work presents the extension of the PTT method to enable fuel depletion capability in the Griffin code. We discuss the implementation details of the PTT-based high-fidelity depletion where isotope inventory of all individual pebbles is tracked through pre-determined pebble flow paths in the core. The implementation is verified with a generic pebble bed reactor model. Some preliminary equilibrium core results are included. Future works are also discussed.

97 - MATHEMATICS AND COMPUTING↗

Method of Green’s Potentials for Elliptic PDEs in Domains with Random Apertures

Problems with topological uncertainties appear in many fields ranging from nano-device engineering to the design of bridges. In many of such problems, a part of the domains boundaries is subjected to random perturbations making inefficient conventional schemes that rely on discretization of the whole domain. Here, we study elliptic PDEs in domains with boundaries comprised of a deterministic part and random apertures, and apply the method of modified potentials with Green’s kernels defined on the deterministic part of the domain. This approach allows to reduce the dimension of the original differential problem by reformulating it as a boundary integral equation posed on the random apertures only. The multilevel Monte Carlo method is then applied to this modified integral equation and its optimal ϵ -2 asymptotical complexity is shown. Finally, we provide the qualitative analysis of the proposed technique and support it with numerical results.

97 MATHEMATICS AND COMPUTING↗

Probabilistic Risk Assessment Procedures Guide for NASA Managers and Practitioners (Second Edition)

Probabilistic Risk Assessment (PRA) is a comprehensive, structured, and logical analysis method aimed at identifying and assessing risks in complex technological systems for the purpose of cost-effectively improving their safety and performance. NASA's objective is to better understand and effectively manage risk, and thus more effectively ensure mission and programmatic success, and to achieve and maintain high safety standards at NASA. NASA intends to use risk assessment in its programs and projects to support optimal management decision making for the improvement of safety and program performance. In addition to using quantitative/probabilistic risk assessment to improve safety and enhance the safety decision process, NASA has incorporated quantitative risk assessment into its system safety assessment process, which until now has relied primarily on a qualitative representation of risk. Also, NASA has recently adopted the Risk-Informed Decision Making (RIDM) process [1-1] as a valuable addition to supplement existing deterministic and experience-based engineering methods and tools. Over the years, NASA has been a leader in most of the technologies it has employed in its programs. One would think that PRA should be no exception. In fact, it would be natural for NASA to be a leader in PRA because, as a technology pioneer, NASA uses risk assessment and management implicitly or explicitly on a daily basis. NASA has probabilistic safety requirements (thresholds and goals) for crew transportation system missions to the International Space Station (ISS) [1-2]. NASA intends to have probabilistic requirements for any new human spaceflight transportation system acquisition. Methods to perform risk and reliability assessment in the early 1960s originated in U.S. aerospace and missile programs. Fault tree analysis (FTA) is an example. It would have been a reasonable extrapolation to expect that NASA would also become the world leader in the application of PRA. That was, however, not to happen. Early in the Apollo program, estimates of the probability for a successful roundtrip human mission to the moon yielded disappointingly low (and suspect) values and NASA became discouraged from further performing quantitative risk analyses until some two decades later when the methods were more refined, rigorous, and repeatable. Instead, NASA decided to rely primarily on the Hazard Analysis (HA) and Failure Modes and Effects Analysis (FMEA) methods for system safety assessment.

Stamatelatos,Michael↗

Rapid Commissioning of Large Machine Tools Using Finite Element-Based Correction of Geometric Errors

Large computer numerical control (CNC) machine tools derive their stiffness from monolithic cast iron bases or weldments that are sometimes integral to machine motion systems like box ways or guideways. However, the sheer size of castings and even floor flatness deviations result in dimensional errors in these systems, which manifest as machine motion errors. Typical geometric alignment processes rely on an iterative approach, where measurements are taken to assess alignment (straightness, squareness, and parallelism), followed by adjustment of the machine supports (fixators or leveling pads), which can take weeks even for an experienced operator. Conversely, a novel method is proposed to shorten the correction time by eliminating the trial-and-error process in favor of a more deterministic approach guided by a finite element (FE) method. A feasibility study is conducted on a CNC polymer hybrid machine, with a steel weldment frame, supported by six leveling pads. An FE model of the frame is utilized to obtain recommended leveling pad adjustments, based on measurement of machine errors taken using a laser tracker. After a single adjustment cycle, measurements reveal that geometric errors of the machine tool are reduced from 2.22 mm of flatness deviation to 0.32 mm, achieving an 85.6% reduction. Furthermore, the entire process including measurement, adjustment, and assessment is completed in just 6 h by two operators who are not professional service engineers. In conclusion, this methodology demonstrates feasibility for scaling up, especially to large, high-precision CNC machine tools with bases mounted by fixators, offering the capability for bidirectional adjustment.

42 ENGINEERING↗

Deep Reinforcement Learning From Demonstrations to Assist Service Restoration in Islanded Microgrids

Microgrids can be operated in island mode during utility grid outages to support service restoration and improve system resilience. To schedule and dispatch distributed energy resources (DERs) in an islanded microgrid, conventional model-based methods rely on accurate distribution network models and lack generalization and adaptability. Data-driven methods are promising for DER coordination but face practical challenges such as potential hazards to microgrids during online training and insufficient online training opportunities due to low outage rates. This paper presents a novel two-stage learning framework that builds on the deep deterministic policy gradient from demonstrations to identify an optimal restoration strategy. At the pre-training stage, imitation learning is applied to equip the control agent with expert experiences to guarantee acceptable initial performance. At the online training stage, action clipping, reward shaping, and expert demonstrations are leveraged to ensure safe exploration while accelerating the training process. In conclusion, the proposed method is illustrated using the IEEE 123-node system and compared with a representative model-based method and the standard deep deterministic policy gradient method to prove solution accuracy and demonstrate increased computational efficiency.

Du, Yan↗

On the Lebesgue constant of weighted Leja points for Lagrange interpolation on unbounded domains

Here, this work focuses on weighted Lagrange interpolation on an unbounded domain and analyzes the Lebesgue constant for a sequence of weighted Leja points. The standard Leja points are a nested sequence of points defined on a compact subset of the real line and can be extended to unbounded domains with the introduction of a weight function w:R → [0,1]. Due to a simple recursive formulation in one dimension, such abscissas provide a foundation for high-dimensional approximation methods such as sparse grid collocation, deterministic least squares and compressed sensing. Just as in the unweighted case of interpolation on a compact domain, we use results from potential theory to prove that the Lebesgue constant for the Leja points grows subexponentially with the number of interpolation nodes.

97 MATHEMATICS AND COMPUTING↗

Fermionic Partial Tomography via Classical Shadows

Here we propose a tomographic protocol for estimating any k-body reduced density matrix (k-RDM) of an n-mode fermionic state, a ubiquitous step in near-term quantum algorithms for simulating many-body physics, chemistry, and materials. Our approach extends the framework of classical shadows, a randomized approach to learning a collection of quantum-state properties, to the fermionic setting. Our sampling protocol uses randomized measurement settings generated by a discrete group of fermionic Gaussian unitaries, implementable with linear-depth circuits. We prove that estimating all k-RDM elements to additive precision ϵ requires on the order of ($^{n}_{k}$)k 3/2 log(n)/ϵ 2 repeated state preparations, which is optimal up to the logarithmic factor. Furthermore, numerical calculations show that our protocol offers a substantial improvement in constant overheads for k ≥ 2, as compared to prior deterministic strategies. We also adapt our method to particle-number symmetry, wherein the additional circuit depth may be halved at the cost of roughly 2–5 times more repetitions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗