Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “time discretization”

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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Rapid Simulation of Unconventional Reservoirs by Multidomain Multiresolution Modeling Based on the Diffusive Time of Flight

Summary The fast marching method (FMM)-based rapid flow simulation has been shown to accelerate simulation efficiency by orders of magnitude by transforming 3D simulation to equivalent 1D simulation using the concept of the “diffusive time of flight” (DTOF). However, the 1D transformation does not directly apply to multiwell problems. In this paper, we propose a novel DTOF-based multidomain multiresolution discretization scheme to accelerate multiwell simulation of unconventional reservoirs. Our method formulates multiwell simulation problems based on the DTOF which displays the pressure front propagation in unconventional reservoirs. The DTOF contours are used to partition the reservoir into local and shared domains. A local domain is where the flow is dominated by a single well, and the shared domain is where the fluid flow is influenced by multiple wells. The DTOF contours expand independently in local domains and interfere in the shared domain. After the partitioning, each domain is discretized using a multiresolution scheme whereby the original 3D fine mesh is preserved near the wells to account for detailed physics including gravity, and the rest of the domain is discretized into 1D mesh based on the DTOF contours to alleviate the simulation workload. The power and efficacy of our approach are demonstrated using synthetic and field-scale simulation models with different degrees of geologic and well-completion complexity. The simulation results, number of active cells, and computation time for the proposed discretization scheme are compared with the original high-fidelity 3D model for each case. The results show that the proposed method is suitable for multiwell simulation problems in unconventional reservoirs and can accelerate flow simulations by orders of magnitude with minimal loss of accuracy. The novelty of this work is the creation of DTOF-derived multiresolution discretization with local and shared domains to simplify and accelerate the calculation of subsurface flow problems, especially in unconventional reservoirs. Our workflow can be easily interfaced with commercial simulators, making it suitable for large-scale field applications.

Engineering↗
DOE OSTI2026

Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation

Motivated by various applications, unbounded Hamiltonian simulation has recently garnered great attention. Quantum Magnus algorithms, designed to achieve commutator scaling for time-dependent Hamiltonian simulation, have been found to be particularly efficient for such applications. When applied to unbounded Hamiltonian simulation in the interaction picture, they exhibit an unexpected superconvergence phenomenon. However, existing proofs are limited to the spatially continuous setting and do not extend to discrete spatial discretizations. Here, in this work, we provide the first superconvergence estimate in the fully discrete setting with a finite number of spatial discretization points N, and show that it holds with an error constant uniform in N. The proof is based on the two-parameter symbol class, which, to our knowledge, is applied for the first time in algorithm analysis. The key idea is to establish a semiclassical framework by identifying two parameters through the discretization number and the time step size rescaled by the operator norm, such that the semiclassical uniformity guarantees the uniformity of both. This approach may have broader applications in numerical analysis beyond the specific context of this work.

Borns-Weil, Yonah [University of California, Berke↗
DOE OSTI2021

Mixing Cell Model: A One-Dimensional Numerical Model for Assessment of Water Flow and Contaminant Transport in the Unsaturated Zone

This report describes the Mixing Cell Model code, a one dimensional model for water flow and solute transport in the unsaturated zone under steady state or transient flow conditions. The model is based on the principles and assumptions underlying mixing-cell model formulations. The unsaturated zone is discretized into a series of independent mixing cells. Each cell may have unique hydrologic, lithologic, and sorptive properties. Ordinary differential equations describe the material (water and solute) balance within each cell. Water-flow equations are derived from the continuity equation, assuming that unit gradient conditions exist at all times in each cell. Pressure gradients are considered implicitly through model discretization. Unsaturated hydraulic conductivity and moisture contents are determined by the material specific moisture-characteristic curves. Solute-transport processes include explicit treatment of advective processes, first order chain decay, and linear sorption reactions. Dispersion is addressed through implicit and explicit dispersion. Implicit dispersion is an inherent feature of all mixing-cell models and originates from the formulation of the problem in terms of mass balance around fully mixed volume elements. Expressions are provided that relate implicit dispersion to the physical dispersion of the system. Two FORTRAN codes were developed to solve the water flow and solute-transport equations: (1) the Mixing Cell Model for Flow (MCMF) solves transient water-flow problems and (2) the Mixing Cell Model for Transport (MCMT) solves the solute-transport problem. The transient water-flow problem is typically solved first by estimating the water flux through each cell in the model domain as a function of time using the MCMF code. These data are stored in either ASCII or binary files that are later read by the solute transport code (MCMT). Code output includes solute pore water concentrations, water and solute inventories in each cell and at each specified output time, and water and solute fluxes through each cell and specified output time. Computer run times for coupled transient water flow and solute transport were typically several seconds on a 2 GHz Intel Pentium IV desktop computer. The model was benchmarked against analytical solutions and finite element approximations to the partial differential equations (PDE) describing unsaturated flow and transport. Differences between the maximum solute flux estimated by the mixing cell model and the PDE models were typically less than two percent. This revision includes an option for a fixed concentration lower boundary condition for diffusive fluxes for versions 020321 and later.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Semi-implicit method to solve compressible multiphase fluid flows without acoustic time step restrictions

A new 3D multiphase numerical capability is presented here for simulating multiphase flow regimes at all Mach numbers (M). The new method is a semi-implicit extension of the finite volume discrete equation method (DEM) of Chinnaya et al. (2004), which originally used explicit time-stepping. The capability is also developed to work with another extension of the DEM to moving grids for arbitrary Lagrangian-Eularian (ALE) methods detailed in Dunn (2011). Rather than solving all phase equations simultaneously, the DEM reduces the equations to a system of single-phase Riemann solves, where each phase has its own velocity and thermodynamic state. Exchanges between the phases are modeled through source terms accounting for the phase interactions. Furthermore, since the original multiphase scheme uses an explicit time-advancement scheme, it has time step restrictions dictated by the speed of sound, which limits the model's ability to simulate weakly compressible flows which typically need to be integrated for longer time periods. Here, we extend the current multiphase formulation by implementing a pressure-correcting step to enable implicit calculations and remove acoustic time step limitations. The new semi-implicit algorithm allows use of relatively large time steps compared to an explicit method. Validation and benefits of the new implicit time-step method are illustrated using several examples including weakly compressible flows and strong shock waves. The scheme presented here is general and may be used for a variety of applications which require capabilities for handling multiphase flow at a wide range of Mach numbers. However, the goal of this research is to simulate all stages of high energy explosions, including the shock formation (high Mach numbers) and evolution of the buoyant cloud (low Mach numbers).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Eigenmode Analysis of Pulsed Neutron Transport Simulations

We discuss the time dependent behavior of some simple pulsed neutron simulations of subcritical problems in slab geometry. Our intent is to investigate the eigenvalue structure of the discretized neutron transport equation and to show under some reasonable assumptions that a dominant time eigenvalue exists that has a nonnegative eigenvector that determines the long time dependent behavior of the solution.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Scalable Deep Learning-Based Microarchitecture Simulation on GPUs

Cycle-accurate microarchitecture simulators are essential tools for designers to architect, estimate, optimize, and manufacture new processors that meet specific design expectations. However, conventional simulators based on discrete-event methods often require an exceedingly long time-to-solution for the simulation of applications and architectures at full complexity and scale. Given the excitement around wielding the machine learning (ML) hammer to tackle various architecture problems, there have been attempts to employ ML to perform architecture simulations, such as Ithemal and SimNet. However, the direct application of existing ML approaches to architecture simulation may be even slower due to overwhelming memory traffic and stringent sequential computation logic. This work proposes the first graphics processing unit (GPU)-based microarchitecture simulator that fully unleashes the potential of GPUs to accelerate state-of-the-art ML-based simulators. First, considering the application traces are loaded from central processing unit (CPU) to GPU for simulation, we introduce various designs to reduce the data movement cost between CPUs and GPUs. Second, we propose a parallel simulation paradigm that partitions the application trace into sub-traces to simulate them in parallel with rigorous error analysis and effective error correction mechanisms. Combined, this scalable GPU-based simulator outperforms by orders of magnitude the traditional CPU-based simulators and the state-of-the-art ML-based simulators, i.e., SimNet and Ithemal.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Layer-Parallel Training of Deep Residual Neural Networks

Residual neural networks (ResNets) are a promising class of deep neural networks that have shown excellent performance for a number of learning tasks, e.g., image classification and recognition. Mathematically, ResNet architectures can be interpreted as forward Euler discretizations of a nonlinear initial value problem whose time-dependent control variables represent the weights of the neural network. Hence, training a ResNet can be cast as an optimal control problem of the associated dynamical system. For similar time-dependent optimal control problems arising in engineering applications, parallel-in-time methods have shown notable improvements in scalability. This paper demonstrates the use of those techniques for efficient and effective training of ResNets. The proposed algorithms replace the classical (sequential) forward and backward propagation through the network layers with a parallel nonlinear multigrid iteration applied to the layer domain. This adds a new dimension of parallelism across layers that is attractive when training very deep networks. From this basic idea, we derive multiple layer-parallel methods. The most efficient version employs a simultaneous optimization approach where updates to the network parameters are based on inexact gradient information in order to speed up the training process. Finally, using numerical examples from supervised classification, we demonstrate that the new approach achieves a training performance similar to that of traditional methods, but enables layer-parallelism and thus provides speedup over layer-serial methods through greater concurrency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

New Design Yields Robust Large-Area Framing Camera

Manuscript to be submitted to Review of Scientific Instruments to determine interest in possible publication. Website: https://aip.scitation.org/rsi/authors/manuscript High-speed imaging is a core diagnostic capability for the Nevada National Security Site (NNSS). Data from experiments that measure the behavior of materials under extreme conditions are essential for the stockpile mission. For example, during subcritical experiments, materials that are shocked and compressed under high-explosive drive change behavior rapidly over timescales measured in millionths or even billionths of a second. Characterizing and understanding this behavior requires radiographic and/or optical imaging to track motion on these timescales. Framing cameras provide a discrete series of images over a short period of time in a manner that mimics a high-speed movie camera, but with individual shutter times that must be extremely short in order to capture freeze-frame images of rapidly evolving phenomena such as high-explosive shock-driven ejecta, dynamic compression of metals, and high-velocity fluid flow.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

New Design Yields Robust Large-Area Framing Camera

Framing cameras provide a discrete series of images over a short period of time in a manner that mimics a high-speed movie camera, but with individual shutter times that must be extremely short in order to capture freeze-frame images of rapidly evolving phenomena such as high-explosive shock-driven ejecta, dynamic compression of metals, and high-velocity fluid flow. The NNSS has designed and fielded a new, large-area, gated framing camera called Kraken. The camera design emphasized manufacturability and flexibility by improving imager yield and creating a camera architecture to shorten design cycles. Design strategies and field data are presented.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Asynchronous GPU-based DEM solver embedded in commercial CFD software with polyhedral mesh support

A novel graphical processing unit-based discrete element method solver is introduced to improve stability, performance, and provide seamless integration into commercial or open-source computational fluid dynamics software. A key innovation is eliminating a need for network communication between solvers, which was previously required for cross-platform coupling. This is accomplished by a direct coupling method that employs dynamic-linked libraries. Furthermore, the solver optimizes memory usage by streamlining the particle-cell search algorithm by eliminating the cells' searching grid. This ensures the solver is compatible with a wide range of mesh types, providing high geometric flexibility. The approach simplifies the simulation process by directly incorporating computational fluid dynamics mesh information into the discrete element method solver. The performance analysis indicates about sixteen times boost in computational speed compared to benchmark central processing unit-based solvers. Finally, the solver's compatibility with polyhedral meshes, a vital advantage for complex geometries, is tested against a referenced study regarding the simulation of an immersed-tube fluidized bed.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2022

Efficient Multi-Scale, Thermo-Hydro-Mechanical Numerical Model for Simulation of Long-Term Stability of Rooms for Nuclear Waste Disposal

This project demonstrated the feasibility of developing a numerical modeling tool that provides an efficient and unique approach to analyze the geomechanical performance of a deep geological repository (DGR) for high-level nuclear waste. The numerical modeling tool is physics-based and models the thermo-hydro-mechanical (THM) processes during the required time (up to one million years) for a DGR. The unique capability of the developed code is explicit representation of fracturing and a discrete fracture network (DFN) in the model that includes the entire repository layout for simulated time of one million years. Therefore, it can potentially address one of the challenges of analysis of a DGR, which is efficient numerical simulation of a multi-scale, physics-based models.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2024

IoT-Enabled Traveling Wave Microgrid Protection

Traveling Wave Protection based on the Internet of Things (TWP-IoT) is developed to enable ultra-resilient microgrids. TWP-IoT adopts a directional traveling wave approach that utilizes the voltage and current modal components obtained from Discrete Hilbert Transform to identify the fault features via ultra-lightweight IoT hardware. Furthermore, the main contributions of this work include (1) a novel TWP-IoT for microgrid and distribution networks that can achieve the time-of-arrival fault detection and localization with composite wave impedance and conductance using Discrete Hilbert Transform, (2) a cost-effective smart IoT prototype with functionalities outperforming commercial relays, and (3) a real-time hardware-in-the-loop prototype based on RTDS that verifies the robustness and efficacy of TWP-IoT subject to a diverse set of working conditions. TWP-IoT is found to have excellent performance under a wide spectrum of internal and external fault conditions across a myriad of microgrid locations, which is unattainable by today’s TWP products.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

On fast simulation of dynamical system with neural vector enhanced numerical solver

The large-scale simulation of dynamical systems is critical in numerous scientific and engineering disciplines. However, traditional numerical solvers are limited by the choice of step sizes when estimating integration, resulting in a trade-off between accuracy and computational efficiency. To address this challenge, we introduce a deep learning-based corrector called Neural Vector (NeurVec), which can compensate for integration errors and enable larger time step sizes in simulations. Our extensive experiments on a variety of complex dynamical system benchmarks demonstrate that NeurVec exhibits remarkable generalization capability on a continuous phase space, even when trained using limited and discrete data. NeurVec significantly accelerates traditional solvers, achieving speeds tens to hundreds of times faster while maintaining high levels of accuracy and stability. Moreover, NeurVec’s simple-yet-effective design, combined with its ease of implementation, has the potential to establish a new paradigm for fast-solving differential equations based on deep learning.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Computer Science Research Needs for Parallel Discrete Event Simulation (PDES)

Historically, scientific computing efforts have demonstrated the clear need for, and effective use of, supercomputing with traditional time-stepped simulations. Nevertheless, there are several areas in the mission spaces of the U.S. Department of Energy and other agencies waiting to tap advanced computing research using a different, discrete event style of modeling, simulation, and analysis. These span a wide spectrum of applications including energy grid resilience, urban planning and policy, transportation science, building technologies, emergency response and planning, environmental impact analysis, computational epidemiology, Internet communications, cyber security, and cyber-physical systems, to name only a few. Even within traditional scientific applications, the role of discrete event modes of execution is increasing in the form of new event-based mathematical solvers such as quantized state integration methods and discrete-continuous hybrid system solvers. Co-design of advanced supercomputing hardware systems is another area that exploits discrete event simulation at its core for effective analyses. Complex systems, entity behaviors and interconnections play a significant role in all these applications, which are mapped to large-scale models with discrete event formulations. To make advancements in all the aforementioned scientific areas, many technical aspects need to be more thoroughly studied and deeply understood in parallel discrete event simulation (PDES). The unique dynamics inherent in a discrete event modeling approach, by their very nature, intersect and influence the entire stack of the computing system, including (a) the unique nature of the instruction sets exercised in PDES workloads without a predominance of high-precision floating point operations, (b) virtual time-constrained multi-threaded execution of many logical processes per processor, (c) extremely variable and difficult to predict network traffic characteristics, (d) interfaces and inter-dependencies with machine learning and artificial intelligence codes at higher software layers, and (e) highly challenging load balancing needs, especially in effectively accounting for accelerated/extremely heterogeneous computing in current and future high-performance computing systems. Efficient and accurate parallel execution of PDES workloads is also dominated by challenges in dealing with their asynchronous concurrency fundamentally present at the model level. Conservative synchronization, optimistic/speculative synchronization, and their hybrid schemes open new questions in fundamental computer science with respect to reversibility of computation and prediction (lookahead) of behaviors inherent within model codes. On the implementation front, there are relatively few scalable, general-purpose parallel discrete event simulators in the world, and even fewer have been studied on emerging hardware platforms. To enable scientific advances using PDES, the research needs in computer science must also be pursued and met in the intersection of the algorithmic and hardware-aware aspects of scalable PDES engines. This report is aimed at capturing a computer science-oriented view of this important area of research in PDES, presenting a sample of important applications with their inherent discrete event technology elements. Needs are outlined in core areas of parallel discrete event research as well as cross-cutting directions in computer science research that positively impact scientific advancements across several important application areas. A selection of priority research opportunities in advanced computing for PDES is identified to serve as reference for key research topics and their order of importance for scientific advancements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Local Lagrangian reduced-order modeling for the Rayleigh-Taylor instability by solution manifold decomposition

The Rayleigh-Taylor instability is a classical hydrodynamic instability of great interest in various disciplines of science and engineering, including astrophysics, atmospheric sciences and climate, geophysics, and fusion energy. Analytical methods cannot be applied to explain the long-time behavior of the Rayleigh-Taylor instability, and therefore, numerical simulation of the full problem is required. However, in order to capture the growth of amplitude of perturbations accurately, both the spatial and temporal discretizations need to be extremely fine for traditional numerical methods, and long-time simulation may become prohibitively expensive. In this paper, we propose efficient reduced order model techniques to accelerate the simulation of the Rayleigh-Taylor instability in compressible gas dynamics. Here, we introduce a general framework for decomposing the solution manifold to construct the temporal domain partition and temporally-local reduced order model construction with varying Atwood number. We propose two practical approaches in this framework, namely decomposition by physical time and by penetration distance. Numerical results are presented to examine the performance of the proposed approaches.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Fast Multigrid Reduction-in-Time for Advection via Modified Semi-Lagrangian Coarse-Grid Operators

Many iterative parallel-in-time algorithms have been shown to be highly efficient for diffusion-dominated partial differential equations (PDEs) but are inefficient or even divergent when applied to advection-dominated PDEs. We consider the application of the multigrid reduction-in-time (MGRIT) algorithm to linear advection PDEs. Here, the key to efficient time integration with this method is using a coarse-grid operator that provides a sufficiently accurate approximation to the so-called ideal coarse-grid operator. For certain classes of semi-Lagrangian discretizations, we present a novel semi-Lagrangian-based coarse-grid operator that leads to fast and scalable multilevel time integration of linear advection PDEs. The coarse-grid operator is composed of a semi-Lagrangian discretization followed by a correction term, with the correction designed so that the leading-order truncation error of the composite operator is approximately equal to that of the ideal coarse-grid operator. Parallel results show substantial speed-ups over sequential time integration for variable-wave-speed advection problems in one and two spatial dimensions, and using high-order discretizations up to order five. The proposed approach establishes the first practical method that provides small and scalable MGRIT iteration counts for advection problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Development and Analysis of Optimal Multilevel Solvers on Advanced Computers. Final Report

Constrained optimization in the context of time dependent, partial differential equations (PDE) leads to a symmetric, block-tridiagonal system of nonlinear equations that must be solved repeatedly in an iterative solution strategy. The blocks represent spatial discretization, while the connection between the blocks represents a forward and backward integration in time. The focus of this project is to apply a parallel-in-time (PiT) solution technique to the large block-triangular system.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Partitioned exponential methods for coupled multiphysics systems

Multiphysics problems involving two or more coupled physical phenomena are ubiquitous in science and engineering. This work develops a new partitioned exponential approach for the time integration of multiphysics problems. After a possible semi-discretization in space, the class of problems under consideration is modeled by a system of ordinary differential equations where the right-hand side is a summation of two component functions, each corresponding to a given set of physical processes. The partitioned-exponential methods proposed herein evolve each component of the system via an exponential integrator, and information between partitions is exchanged via coupling terms. Here, the traditional approach to constructing exponential methods, based on the variation-of-constants formula, is not directly applicable to partitioned systems. Rather, our approach to developing new partitioned-exponential families is based on a general-structure additive formulation of the schemes. Two method formulations are considered, one based on a linear-nonlinear splitting of the right hand component functions, and another based on approximate Jacobians. The paper develops classical (non-stiff) order conditions theory for partitioned exponential schemes based on particular families of T-trees and B-series theory. Several practical methods of third order are constructed that extend the Rosenbrock-type and EPIRK families of exponential integrators. Several implementation optimizations specific to the application of these methods to reaction-diffusion systems are also discussed. Numerical experiments reveal that the new partitioned-exponential methods can perform better than traditional unpartitioned exponential methods on some problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗