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 217 records · Page 12

An FFT-based micromechanical model for gradient enhanced brittle fracture

Damage models incorporated within FFT-based micromechanical methods have received much attention recently because of the need to better understand and predict brittle and ductile fracture. An important aspect of a damage model is non-local regularization, which removes the mesh dependence of the predictions that otherwise become physically unacceptable upon grid refinement. In this work, the Helmholtz-type equation for non-local gradient regularization of a damage model on a distorted grid is solved using an FFT-based approach. Further, the resulting system of equations is solved using the Jacobi iterative method. The model is applied to simulate brittle fracture of an intermetallic. The influence of the time and space discretization, the length-scale parameter, and intermetallic crystallographic orientation on crack evolution is studied.

36 MATERIALS SCIENCE↗

Neuromorphic intermediate representation: A unified instruction set for interoperable brain-inspired computing

Abstract Spiking neural networks and neuromorphic hardware platforms that simulate neuronal dynamics are getting wide attention and are being applied to many relevant problems using Machine Learning. Despite a well-established mathematical foundation for neural dynamics, there exists numerous software and hardware solutions and stacks whose variability makes it difficult to reproduce findings. Here, we establish a common reference frame for computations in digital neuromorphic systems, titled Neuromorphic Intermediate Representation (NIR). NIR defines a set of computational and composable model primitives as hybrid systems combining continuous-time dynamics and discrete events. By abstracting away assumptions around discretization and hardware constraints, NIR faithfully captures the computational model, while bridging differences between the evaluated implementation and the underlying mathematical formalism. NIR supports an unprecedented number of neuromorphic systems, which we demonstrate by reproducing three spiking neural network models of different complexity across 7 neuromorphic simulators and 4 digital hardware platforms. NIR decouples the development of neuromorphic hardware and software, enabling interoperability between platforms and improving accessibility to multiple neuromorphic technologies. We believe that NIR is a key next step in brain-inspired hardware-software co-evolution, enabling research towards the implementation of energy efficient computational principles of nervous systems. NIR is available atneuroir.org

Science & Technology - Other Topics↗

Unveiling the strong interaction among hadrons at the LHC

One of the key challenges for nuclear physics today is to understand from first principles the effective interaction between hadrons with different quark content. First successes have been achieved using techniques that solve the dynamics of quarks and gluons on discrete space-time lattices. Experimentally, the dynamics of the strong interaction have been studied by scattering hadrons off each other. Such scattering experiments are difficult or impossible for unstable hadrons and so high-quality measurements exist only for hadrons containing up and down quarks. Here we demonstrate that measuring correlations in the momentum space between hadron pairs produced in ultrarelativistic proton–proton collisions at the CERN Large Hadron Collider (LHC) provides a precise method with which to obtain the missing information on the interaction dynamics between any pair of unstable hadrons. Specifically, we discuss the case of the interaction of baryons containing strange quarks (hyperons). We demonstrate how, using precision measurements of proton–omega baryon correlations, the effect of the strong interaction for this hadron–hadron pair can be studied with precision similar to, and compared with, predictions from lattice calculations. The large number of hyperons identified in proton–proton collisions at the LHC, together with accurate modelling of the small (approximately one femtometre) inter-particle distance and exact predictions for the correlation functions, enables a detailed determination of the short-range part of the nucleon-hyperon interaction.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Perturbative Stability and Error-Correction Thresholds of Quantum Codes

Topologically ordered phases are stable to local perturbations, and topological quantum error-correcting codes enjoy thresholds to local errors. We connect the two notions of stability by constructing classical statistical mechanics models for decoding general Calderbank-Shor-Steane codes and classical linear codes. Our construction encodes correction success probabilities under uncorrelated bit-flip and phase-flip errors, and simultaneously describes a generalized ℤ 2 lattice-gauge theory with quenched disorder. We observe that the clean limit of the latter is precisely the discretized imaginary-time path integral of the corresponding quantum code Hamiltonian when the errors are turned into a perturbative 𝑋 or 𝑍 magnetic field. Motivated by error-correction considerations, we define general order parameters for all such generalized ℤ 2 lattice-gauge theories, and show that they are generally lower bounded by success probabilities of error correction. For CSS codes satisfying the low-density parity-check condition and with a sufficiently large code distance, we prove the existence of a low-temperature ordered phase of the corresponding lattice-gauge theories, particularly for those lacking Euclidean spatial locality and/or when there is a nonzero code rate. We further argue that these results provide evidence for stable phases in the corresponding perturbed quantum Hamiltonians, obtained in the limit of continuous imaginary time. To do so, we distinguish space- and timelike defects in the lattice-gauge theory. A high free-energy cost of spacelike defects corresponds to a successful “memory experiment” and suppresses the energy splitting among the ground states, while a high free-energy cost of timelike defects corresponds to a successful “stability experiment” and points to a nonzero gap to local excitations.

quantum error correction↗

Generative Ensemble Regression: Learning Particle Dynamics from Observations of Ensembles with Physics-informed Deep Generative Models

Here, we propose a new method for inferring the governing stochastic ordinary differential equations (SODEs) by observing particle ensembles at discrete and sparse time instants, i.e., multiple “snapshots.” Particle coordinates at a single time instant, possibly noisy or truncated, are recorded in each snapshot but are unpaired across the snapshots. By training a physics-informed generative model that generates “fake” sample paths, we aim to fit the observed particle ensemble distributions with a curve in the probability measure space, which is induced from the inferred particle dynamics. We employ different metrics to quantify the differences between distributions, e.g., the sliced Wasserstein distances and the adversarial losses in generative adversarial networks. We refer to this method as generative “ensemble-regression” (GER), in analogy to the classic “point-regression,” where we infer the dynamics by performing regression in the Euclidean space. We illustrate the GER by learning the drift and diffusion terms of particle ensembles governed by SODEs with Brownian motions and Lévy processes up to 100 dimensions. We also discuss how to treat cases with noisy or truncated observations. Apart from systems consisting of independent particles, we also tackle nonlocal interacting particle systems with unknown interaction potential parameters by constructing a physics-informed loss function. Finally, we investigate scenarios of paired observations and discuss how to reduce the dimensionality in such cases by proving a convergence theorem that provides theoretical support.

97 MATHEMATICS AND COMPUTING↗

Verification Problems for Smooth Step Amplitude Load Curves in DYNA3D/Paradyn

This report documents the addition of three new verification tests in the LOADCURVE directory of the DYNA3D/Paradyn Software Quality Assurance test suite. Each test consists of a single element, where the velocities of each node are specified by either the newly added smooth step tabular load curve or another load curve option. The first test assesses the initialization and interpolation of the newly inputted load curve option through tabulated abscissa-ordinate pairs of data. The second test uses the same set of abscissa-ordinate data points and applies offset and scaling parameters available within the load curve definition. The third test defines the smooth step load curve in an original input deck, and assesses its correct redefinition using a restart file. The simulation velocities are compared to their true values at discrete points in time, and each test is verified up to numerical precision. These results confirm that the smooth step load curve option is functioning correctly and as intended.

97 MATHEMATICS AND COMPUTING↗

An Efficient Numerical Algorithm for Solving Coupled Time-Dependent Ginzburg-Landau Equation for Superconductivity and Elasticity

A decoupled finite element algorithm is developed for simulating the vortex dynamics on an elastic superconductor which couples the time-dependent Ginzburg- Landau equation with the complex-valued superconducting order parameter and the vector-valued magnetic potential, and the elasticity equation. We present an iterative algorithm for the decoupled system arising from the time and spatial discretization using a combination of preconditioner, algebraic multigrid method (AMG) and preconditioned conjugate gradient method (PCG). The iterative algorithm allows us to perform large-scale three-dimensional simulations of mesoscale pattern formation during superconducting phase transitions with arbitrary elastic boundary conditions. Here, the performance and efficiency of the algorithm are numerically verified by several benchmark problems, exhibiting up to two orders of magnitude improvement depending on the scale of discrete system compared to the exact solver.

Efficiency↗

On a nonlocal Cahn–Hilliard model permitting sharp interfaces

A nonlocal Cahn–Hilliard model with a non-smooth potential of double-well obstacle type that promotes sharp interfaces in the solution is presented. To capture long-range interactions between particles, a nonlocal Ginzburg–Landau energy functional is defined which recovers the classical (local) model as the extent of nonlocal interactions vanish. In contrast to the local Cahn–Hilliard problem that always leads to diffuse interfaces, the proposed nonlocal model can lead to a strict separation into pure phases of the substance. In this work, the lack of smoothness of the potential is essential to guarantee the aforementioned sharp-interface property. Mathematically, this introduces additional inequality constraints that, in a weak formulation, lead to a coupled system of variational inequalities which at each time instance can be restated as a constrained optimization problem. We prove the well-posedness and regularity of the semi-discrete and continuous in time weak solutions, and derive the conditions under which pure phases are admitted. Moreover, we develop discretizations of the problem based on finite element methods and implicit–explicit time-stepping methods that can be realized efficiently. Finally, we illustrate our theoretical findings through several numerical experiments in one and two spatial dimensions that highlight the differences in features of local and nonlocal solutions and also the sharp interface properties of the nonlocal model.

97 MATHEMATICS AND COMPUTING↗

The role of stiffness in training and generalization of ResNets

Neural ordinary differential equations (NODEs) have recently regained popularity as large-depth limits of a large class of neural networks. In particular, residual neural networks (ResNets) are equivalent to an explicit Euler discretization of an underlying NODE, where the transition from one layer to the next is one time step of the discretization. The relationship between continuous and discrete neural networks has been of particular interest. Notably, analysis from the ordinary differential equation viewpoint can potentially lead to new insights for understanding the behavior of neural networks in general. In this work, we take inspiration from differential equations to define the concept of stiffness for a ResNet via the interpretation of a ResNet as the discretization of a NODE. Here, we then examine the effects of stiffness on the ability of a ResNet to generalize, via computational studies on example problems coming from climate and chemistry models. We find that penalizing stiffness does have a unique regularizing effect, but we see no benefit to penalizing stiffness over L 2 regularization (penalization of network parameter norms) in terms of predictive performance.

97 MATHEMATICS AND COMPUTING↗

Reproducibility of Radiokrypton in Deep Desert Aquifers: Insights from a Decade of Research

Great technical advances have been achieved since the first atom-trap trace analysis (ATTA) -based radiokrypton application in Egypt, where 1 Myr old groundwater was discovered. Beyond advances in ATTA measurement capabilities, including reduction in sample size, analysis duration, and analytical uncertainty, major progress has been achieved over the past two decades in the sample collection and preparation techniques. These advances paved the expansion of ATTA-based noble gas applications to many other aquifers worldwide, illuminating the nature and flow pattern of deep groundwater systems. While the potential of this new analytical technique for old groundwater dating is well recognized, another important aspect yet to be examined is the reproducibility of radiokrypton in aquifers over time, i.e., how representative is a discrete groundwater sample, collected at a specific time and location, for the natural groundwater system? The likelihood of a negative answer is increased by flow-field disturbance in aquifers following massive groundwater abstraction. Here, in this work, we present repeated 81 Kr sampling and measurements in twenty-one sites over Israel, mostly of deep (up to 1 km) wells tapping confined aquifers in the arid to hyperarid Negev desert. The results demonstrate that radiokrypton measurements are indeed reproducible, even in cases where samples were collected as long as nine years apart and from highly productive (∼1 Mm 3 /yr order) pumping wells. Furthermore, many of the repeated measurements in this study (17 out of the 21 sites) were conducted with different ATTA Instruments in two different laboratories using slightly different sampling, preparation, and analysis techniques, yet with an overall good agreement. The consistency in the ATTA-based 81 Kr-dating results over time highlights the robustness of this state-of-the-art technique as a tool to unravel groundwater flow patterns and encourages further applications to many other yet-to-be-explored deep aquifers.

atom-trap trace analysis↗

A Full-Induction Magnetohydrodynamics Solver for Liquid Metal Fusion Blankets in Vertex-CFD

Multiphysics modeling of liquid metal fusion blankets, which produce tritium and convert energy of neutrons created via fusion reactions into heat, is crucial for predicting performance, ensuring structural integrity, and optimizing energy production. While traditional blanket modeling of liquid metal flows during normal steady operating conditions commonly employs the inductionless approximation of the magnetohydrodynamics (MHD) equations, transient scenarios, when the plasma-confining magnetic field varies on millisecond time scales, require a full-induction MHD approach that dynamically evolves the magnetic field via the time-dependent induction equation. This paper presents the formulation, implementation, and initial verification of a full-induction MHD solver integrated within the open-source Vertex-CFD framework, which aims to achieve tight multiphysics coupling, a flexible software design enabling easy extension and addition of physics models, and performance portability across computing platforms. The solver utilizes finite element spatial discretization, implicit Runge–Kutta time integration, and an inexact Newton method to solve the resulting discrete nonlinear system, leveraging Trilinos packages for efficient computation. Verification against selected benchmark problems demonstrates accuracy and robustness of the solver. Furthermore, when the solver is applied to an idealized blanket model in 2.5D and full 3D, results obtained with Vertex-CFD are in good agreement with recently published quasi-2D simulations. These findings establish a computational foundation for future simulations of transient MHD phenomena in liquid metal blankets with Vertex-CFD, and open avenues for future extensions and performance optimizations.

Endeve, Eirik [ORNL] (ORCID:0000000312519507)↗

Time integrator agnostic charge conserving finite element PIC

Developing particle-in-cell (PIC) methods using finite element basis sets, and without auxiliary divergence cleaning methods, was a longstanding problem until recently. It was shown that if consistent spatial basis functions are used, one can indeed create a methodology that was charge conserving, albeit using a leapfrog time stepping method. While this is a significant advance, leapfrog schemes are only conditionally stable and time step sizes are closely tied to the underlying mesh. Ideally, to take full advantage of advances in finite element methods (FEMs), one needs a charge conserving PIC methodology that is agnostic to the time stepping method. This is the principal contribution of this paper. In what follows, we shall develop this methodology, prove that both charge and Gauss’ laws are discretely satisfied at every time step, provide the necessary details to implement this methodology for both the wave equation FEM and Maxwell solver FEM, and finally demonstrate its efficacy on a suite of test problems. The method will be demonstrated by single particle evolution, non-neutral beams with space-charge, and adiabatic expansion of a neutral plasma, where the Debye length has been resolved, and real mass ratios are used.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Space-time crystals from particle-like topological solitons

Time crystals are unexpected states of matter that spontaneously break time-translation symmetry either in a discrete or continuous manner. However, spatially mesoscale space-time crystals that break both space and time symmetries have not been reported. Here we report a continuous space-time crystal in a nematic liquid crystal driven by ambient-power, constant-intensity unstructured light. Our numerically constructed four-dimensional configurations exhibit good agreement with these experimental findings. Although meeting the established criteria to identify time-crystalline order, both experiments and computer simulations reveal a space-time crystallization phase formed by particle-like topological solitons. The robustness against temporal perturbations and spatiotemporal dislocations shows the stability and rigidity of the studied space-time crystals, which relates to their locally topological nature and many-body interactions between emergent spontaneously twisted, particle-like solitonic building blocks. Their potential technological utility includes optical devices, photonic space-time crystal generators, telecommunications and anti-counterfeiting designs, among others.

Liquid crystals↗

Modelling multiple occurrences of activities during a day: An extension of the MDCEV model

The increased interest in time use among transport researchers has led to a search for flexible but tractable models of time use, such as Bhat's Multiple Discrete Continuous Extreme Value (MDCEV) model. MDCEV formulations typically model aggregate time allocation into different activity types during a given period, such as the amount of time spent working and shopping in a day. While these applications provide valuable insights into activity participation, they ignore disaggregate activity-episodes, that is the fact that people might split their total time spent working in multiple separate blocks, with breaks or other activities in between. Insights into this splitting into episodes are necessary for predicting trips and understanding time use satiation. We propose a modified MDCEV model where an activity-episode, rather than an activity type, is the basic choice alternative, using a modified utility function to capture the reduced likelihood of individuals performing a very large number of episodes of the same activity. Results from two large revealed preference datasets exhibit equivalent forecast accuracy between the traditional and proposed approach at an aggregate level, but the latter also provides insights on the number and duration of activity-episodes with significant accuracy.

97 MATHEMATICS AND COMPUTING↗

Real-time inference and extrapolation with Time-Conditioned UNet: Applications in hypersonic flows, incompressible flows, and global temperature forecasting

Neural Operators are fast and accurate surrogates for nonlinear mappings between functional spaces within training domains. Extrapolation beyond the training domain remains a grand challenge across all application areas. We present Time-Conditioned UNet (TC-UNet) as an operator learning method to solve time-dependent PDEs continuously in time without any temporal discretization, including in extrapolation scenarios. TC-UNet incorporates the temporal evolution of the PDE into its architecture by combining a parameter conditioning approach with the attention mechanism from the Transformer architecture. After training, TC-UNet makes real-time inferences on an arbitrary temporal grid. We demonstrate its extrapolation capability on a climate problem by estimating the global temperature for several years and also for inviscid hypersonic flow around a double cone. We propose different training strategies involving temporal bundling and sub-sampling. We demonstrate performance improvements for several benchmarks, performing extrapolation for long time intervals and zero-shot super-resolution time.

Deep learning↗

Addendum: Unified framework for open quantum dynamics with memory

This Addendum presents a detailed analysis of the discretization error in time-integration and time-derivative that appear in the Nakajima-Zwanzig equation. This was brought to our attention by Makri et al. [arXiv:2410.08239]. Our analysis in the Addendum shows that the relationship derived in our earlier work [Nat. Commun. 15, 8087 (2024)] is valid within the choice of discretization and is not contaminated by the discretization error.

Science & Technology - Other Topics↗

Space-Time Finite Element Tensor Network Approach for the Time-Dependent Convection–Diffusion–Reaction Equation with Variable Coefficients

In this paper, we present a new space-time Galerkin-like method, where we treat the discretization of spatial and temporal domains simultaneously. This method utilizes a mixed formulation of the tensor-train (TT) and quantized tensor-train (QTT) (please see Section Tensor-Train Decomposition), designed for the finite element discretization (Q1-FEM) of the time-dependent convection–diffusion–reaction (CDR) equation. We reformulate the assembly process of the finite element discretized CDR to enhance its compatibility with tensor operations and introduce a low-rank tensor structure for the finite element operators. Recognizing the banded structure inherent in the finite element framework’s discrete operators, we further exploit the QTT format of the CDR to achieve greater speed and compression. Additionally, we present a comprehensive approach for integrating variable coefficients of CDR into the global discrete operators within the TT/QTT framework. The effectiveness of the proposed method, in terms of memory efficiency and computational complexity, is demonstrated through a series of numerical experiments, including a semi-linear example.

convection–diffusion–reaction equation↗

Nonoverlapping Localized Exponential Time Differencing Methods for Diffusion Problems

In this paper, we propose nonoverlapping localized exponential time differencing (ETD) methods for diffusion problems. The model time-dependent diffusion equation is first reformulated on subdomains based on the nonoverlapping domain decomposition, in which Neumann boundary conditions are imposed on the interfaces for the subdomain problems and Dirichlet type conditions are enforced to form a space-time interface problem. After spatial discretization by standard central finite differences and temporal integration with the first or second order ETD methods, the fully discrete interface problem is obtained. Such an interface problem is then solved iteratively either at each time step or over the whole time interval: the former involves the solution of stationary problems in each subdomain at each iteration while the latter involves the solution of time-dependent subdomain problems at each iteration. For both approaches, we prove that localized ETD solutions conserve mass exactly and converge in time to the exact space semidiscrete solution. Numerical experiments in two dimensions are also presented to illustrate the performance of the proposed methods.

Mass conservation↗