Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Time Stepping”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Time-stepping DPG formulations for the heat equation

For a wide range of PDEs, the discontinuous Petrov–Galerkin (DPG) methodology of Demkowicz and Gopalakrishnan provides discrete stability starting from a coarse mesh and minimization of the residual in a user-controlled norm, among other appealing features. Research on DPG for transient problems has mainly focused on spacetime discretizations, which has theoretical advantages, but practical costs for computations and software implementations. The sole examination of time-stepping DPG formulations was performed by Führer, Heuer, and Gupta, who applied Rothe’s method to an ultraweak formulation of the heat equation to develop an implicit time-stepping scheme; their work emphasized theoretical results, including error estimates in time and space. Here, we follow Führer, Heuer, and Gupta in examining the heat equation; our focus is on numerical experiments, examining the stability and accuracy of several formulations, including primal as well as ultraweak, and explicit as well as implicit and Crank–Nicolson time-stepping schemes. We are additionally interested in communication-avoiding algorithms, and we therefore include a highly experimental formulation that places all the trace terms on the right-hand side of the equation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Fast Time-Stepping Strategy for Dynamical Systems Equipped with a Surrogate Model

Simulation of complex dynamical systems arising in many applications is computationally challenging due to their size and complexity. Model order reduction, machine learning, and other types of surrogate modeling techniques offer cheaper and simpler ways to describe the dynamics of these systems but are inexact and introduce additional approximation errors. In order to overcome the computational difficulties of the full complex models, on one hand, and the limitations of surrogate models, on the other, this work proposes a new accelerated time-stepping strategy that combines information from both. This approach is based on the multirate infinitesimal general-structure additive Runge--Kutta framework. The inexpensive surrogate model is integrated with a small time step to guide the solution trajectory, and the full model is treated with a large time step to occasionally correct for the surrogate model error and ensure convergence. Here, we provide a theoretical error analysis, and several numerical experiments, to show that this approach can be significantly more efficient than using only the full or only the surrogate model for the integration.

Surrogate models↗
DOE OSTI2022

H-AMR: A New GPU-accelerated GRMHD Code for Exascale Computing with 3D Adaptive Mesh Refinement and Local Adaptive Time Stepping

General relativistic magnetohydrodynamic (GRMHD) simulations have revolutionized our understanding of black hole accretion. Here, we present a GPU-accelerated GRMHD code H-AMR with multifaceted optimizations that, collectively, accelerate computation by 2–5 orders of magnitude for a wide range of applications. First, it introduces a spherical grid with 3D adaptive mesh refinement that operates in each of the three dimensions independently. This allows us to circumvent the Courant condition near the polar singularity, which otherwise cripples high-resolution computational performance. Second, we demonstrate that local adaptive time stepping on a logarithmic spherical-polar grid accelerates computation by a factor of ≲10 compared to traditional hierarchical time-stepping approaches. Jointly, these unique features lead to an effective speed of ~10 9 zone cycles per second per node on 5400 NVIDIA V100 GPUs (i.e., 900 nodes of the OLCF Summit supercomputer). We illustrate H-AMR's computational performance by presenting the first GRMHD simulation of a tilted thin accretion disk threaded by a toroidal magnetic field around a rapidly spinning black hole. With an effective resolution of 13,440 × 4608 × 8092 cells and a total of ≲22 billion cells and ~0.65 × 10 8 time steps, it is among the largest astrophysical simulations ever performed. We find that frame dragging by the black hole tears up the disk into two independently precessing subdisks. The innermost subdisk rotation axis intermittently aligns with the black hole spin, demonstrating for the first time that such long-sought alignment is possible in the absence of large-scale poloidal magnetic fields.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Grid generation, coupling strategies, and spatially-dependent time stepping for ocean-tidal/estuary systems and other ESM components (Final Report)

There are many multiple scale issues in the ocean modeling, including different mesh resolutions (local) and different physical processes (global). In order to gain efficiency and fidelity in modern ESMs, it is vital to develop high quality, highly nonuniform meshes and spatially-dependent time stepping strategies for coupling various climate system components. The USC/FSU team has worked on the design, analysis, and implementation of fast CVT grid generation and novel time- stepping schemes that could address all the requirements for global and regional ocean models on highly nonuniform meshes.

58 GEOSCIENCES↗
DOE OSTI2023

Automatic Time Step Control to Resolve Hydromechanically Driven Fault Reactivation, Spontaneous Nucleation, and Seismic Arrest

Abstract A physical understanding of the progression from flow‐driven (quasi‐static) poromechanical deformation to dynamic fault rupture is critical to the resilient operations of several engineering systems. These processes are bridged by a progression from fault reactivation to the spontaneous nucleation of unstable sliding. Toward addressing this challenge, novel automatic time step size control methods are developed to enable accurate and efficient simulation of these dynamics and transitions from the first principles. The controllers combine local models for discretization error and Coulomb failure conditions to automatically adjust the time step size across several orders of magnitude. The methods do not require additional empirical or theoretical input and can resolve the pre‐rupture, interseismic, and seismic periods to the allowed accuracy. The computational results reveal that the proposed methods automatically capture the onset of reactivation and nucleation for homogeneous and heterogeneous fields. Hydrodynamic and structural heterogeneity lead to disparate critical nucleation sizes compared to those predicted by theory. The results highlight its potential in predicting induced seismicity in realistic subsurface engineering systems and at practical scales.

Environmental Sciences & Ecology↗
DOE OSTI2020

Super-time-stepping schemes for parabolic equations with boundary conditions

In this work, we present a super-time-stepping scheme for numerically solving parabolic partial differential equations with Dirichlet boundary conditions (BC). Using the general Forward Euler scheme, one can show that by taking varying step sizes there is the potential of propagating the solution forward in time by a greater amount than with uniform step sizes, while maintaining the same order of accuracy. As shown in previous works, if one further requires that the scheme have the Convex Monotone Property (CMP), then there exists a scheme which results in linear, monotone stability of the solution. This monotone stability is highly desirable in many physical situations, such as thermal diffusion, where the physical system will not oscillate, but will behave monotonically. However, the schemes devised in previous works do not include situations that have a boundary condition, and the inclusion of boundary conditions will henceforth be our focus. It is shown that a particular Runge-Kutta-Gegenbauer class of schemes [5] will maintain the CMP even in the presence of Dirichlet BC.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Efficient and Scalable Time-Stepping Algorithms and Reduced-Order Modeling for Ocean System Simulations (Scientific/Technical Report)

This report provides a description of major accomplishments and results obtained by the University of South Carolina/Florida State University/Los Alamos National Laboratory team participating in the project "Efficient and Scalable Time-Stepping Algorithms and Reduced-Order Modeling for Ocean System Simulations" and the list of publications produced from the project.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Adaptive Time Step Control for Multirate Infinitesimal Methods

Multirate methods have been used for decades to temporally evolve initial-value problems in which different components evolve on distinct time scales, and thus use of different step sizes for these components can result in increased computational efficiency. Generally, such methods select these different step sizes based on experimentation or stability considerations. For problems that evolve on a single time scale, adaptivity approaches that strive to control local temporal error are widely used to achieve numerical results of a desired accuracy with minimal computational effort, while alleviating the need for manual experimentation with different time step sizes. However, there is a notable gap in the publication record on the development of adaptive time step controllers for multirate methods. In this paper, we extend the single-rate controller work of Gustafsson [ACM Trans. Math. Software, 20 (1994), pp. 496-517] to the multirate method setting. Specifically, we develop controllers based on polynomial approximations to the principal error functions for both the "fast" and "slow" time scales within multirate infinitesimal (MRI) methods. We additionally investigate a variety of approaches for estimating the errors arising from each time scale within MRI methods. We then numerically evaluate the proposed multirate controllers and error estimation strategies on a range of multirate test problems, comparing their performance against an estimated optimal performance. Through this work, we combine the most performant of these approaches to arrive at a set of multirate adaptive time step controllers that robustly achieve desired solution accuracy with minimal computational effort.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Efficient co-solution of time step size and independent state in simulations of fluid-driven fracture propagation with embedded meshes

Here we present an efficient time-continuation scheme for fluid-driven fracture propagation problems in the extended finite element method framework. The approach applies a monolithic solution strategy to a fully coupled and implicit approximation of hydro-mechanical systems in conjunction with simultaneous linear elastic propagation of multiple fractures. At the end of each time step, the process ensures that the weakest fracture tip is in an equilibrium propagation regime. Furthermore, the solution process provides an initialization procedure for the newly created fracture spaces and an a priori estimate of the stress intensity factor growth rate, improving simulation robustness, and efficiency. The solution process is validated using the Kristianovich-Geertsma-de Klerk analytical solution under the toughness- and viscosity-dominated regimes. It is also extended to and demonstrated on problems with multiple fractures undergoing simultaneous propagation with stress shadow interactions. Numerical examples demonstrate that the solution process can reduce the required computational cost by one order of magnitude compared to other existing methods.

42 ENGINEERING↗
DOE OSTI2025

On High-Order/Low-Order and Micro-Macro Methods for Implicit Time-Stepping of the BGK Model

In this paper, a high-order/low-order (HOLO) method is combined with a micro-macro (MM) decomposition to accelerate iterative solvers in fully implicit time-stepping of the Bhatnagar–Gross–Krook (BGK) equation for gas dynamics. The MM formulation represents a kinetic distribution as the sum of a local Maxwellian and a perturbation. In highly collisional regimes, the perturbation away from initial and boundary layers is small and can be compressed to reduce the overall storage cost of the distribution. The convergence behavior of the MM methods, the usual HOLO method, and the standard source iteration method is analyzed on a linear BGK model. Both the HOLO and MM methods are implemented using a discontinuous Galerkin (DG) discretization in phase space, which naturally preserves the consistency between high- and low-order models required by the HOLO approach. Furthermore, the accuracy and performance of these methods are compared on the Sod shock tube problem and a sudden wall heating boundary layer problem. Overall, the results demonstrate the robustness of the MM and HOLO approaches and illustrate the compression benefits enabled by the MM formulation when the kinetic distribution is near equilibrium.

BGK model↗
DOE OSTI2020

Data for publication Wan et al. (2020, JAMES), Improving time-step convergence in an atmosphere model with simplified physics: the impacts of closure assumption and process coupling

This dataset contains simple condensation mdoel output and CAM4 model output that were used to produce figures in the following paper: Wan, H., Woodward, C. S., Zhang, S., Vogl, C. J., Stinis, P., Gardner, D. J., Rasch, P. J., Zeng, X., Larson, V. E., and Singh, B. (2020): Improving time-step convergence in an atmosphere model with simplified physics: the impacts of closure assumption and process coupling, Journal of Advances in Modeling Earth Systems, https://doi.org/10.1029/2019MS001982

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

TransformerG2G: Adaptive time-stepping for learning temporal graph embeddings using transformers

Dynamic graph embedding has emerged as a very effective technique for addressing diverse temporal graph analytic tasks (i.e., link prediction, node classification, recommender systems, anomaly detection, and graph generation) in various applications. Such temporal graphs exhibit heterogeneous transient dynamics, varying time intervals, and highly evolving node features throughout their evolution. Hence, incorporating long-range dependencies from the historical graph context plays a crucial role in accurately learning their temporal dynamics. In this paper, we develop a graph embedding model with uncertainty quantification, TransformerG2G, by exploiting the advanced transformer encoder to first learn intermediate node representations from its current state (t) and previous context (over timestamps [t–1,t–l], l is the length of context). Moreover, we employ two projection layers to generate lower-dimensional multivariate Gaussian distributions as each node's latent embedding at timestamp t. We consider diverse benchmarks with varying levels of "novelty" as measured by the TEA (Temporal Edge Appearance) plots. Here, our experiments demonstrate that the proposed TransformerG2G model outperforms conventional multi-step methods and our prior work (DynG2G) in terms of both link prediction accuracy and computational efficiency, especially for high degree of novelty. Furthermore, the learned time-dependent attention weights across multiple graph snapshots reveal the development of an automatic adaptive time stepping enabled by the transformer. Importantly, by examining the attention weights, we can uncover temporal dependencies, identify influential elements, and gain insights into the complex interactions within the graph structure. For example, we identified a strong correlation between attention weights and node degree at the various stages of the graph topology evolution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations

In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac–Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) (Ceruti et al. in BIT Numer Math 62(4):1149–1174, 2022) for DLRA. First, a prediction (basis update) step is made computing the approximate column and row spaces at the next time level. Second, a Galerkin evolution step is invoked using an implicit solves for the small core matrix. Finally, a truncation is made according to a prescribed error threshold. Since the DLRA is evolving the differential equation projected on to the tangent space of the low rank manifold, the error estimate of the BUG integrator contains the tangent projection (modeling) error which cannot be easily controlled by mesh refinement. This can cause convergence issue for equations with cross terms. To address this issue, we propose a simple modification, consisting of merging the row and column spaces from the explicit step truncation method together with the BUG spaces in the prediction step. In addition, we propose an adaptive strategy where the BUG spaces are only computed if the residual for the solution obtained from the prediction space by explicit step truncation method, is too large. Here, we prove stability and estimate the local truncation error of the schemes under assumptions. We benchmark the schemes in several tests, such as anisotropic diffusion, solid body rotation and the combination of the two, to show robust convergence properties.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Entropy–Preserving and Entropy–Stable Relaxation IMEX and Multirate Time–Stepping Methods

In this work, we propose entropy-preserving and entropy-stable partitioned Runge–Kutta (RK) methods. In particular, we extend the explicit relaxation Runge–Kutta methods to IMEX–RK methods and a class of explicit second-order multirate methods for stiff problems arising from scale-separable or grid-induced stiffness in a system. The proposed approaches not only mitigate system stiffness but also fully support entropy-preserving and entropy-stability properties at a discrete level. The key idea of the relaxation approach is to adjust the step completion with a relaxation parameter so that the time-adjusted solution satisfies the entropy condition at a discrete level. The relaxation parameter is computed by solving a scalar nonlinear equation at each timestep in general; however, as for a quadratic entropy function, we theoretically derive the explicit form of the relaxation parameter and numerically confirm that the relaxation parameter works the Burgers equation. Several numerical results for ordinary differential equations and the Burgers equation are presented to demonstrate the entropy-conserving/stable behavior of these methods. We also compare the relaxation approach and the incremental direction technique for the Burgers equation with and without a limiter in the presence of shocks.

97 MATHEMATICS AND COMPUTING↗