Search NASA⌕ Search

SEARCH · Search NASA

Results for “Discrete Element 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 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Taylor states in stellarators: A fast high-order boundary integral solver

We present a boundary integral equation solver for computing Taylor relaxed states in non-axisymmetric solid and shell-like toroidal geometries. The computation of Taylor states in these geometries is a key element for the calculation of stepped pressure stellarator equilibria. The integral representation of the magnetic field in this work is based on the generalized Debye source formulation, and results in a well-conditioned second-kind boundary integral equation. The integral equation solver is based on a spectral discretization of the geometry and unknowns, and the computation of the associated weakly-singular integrals is performed with high-order quadrature based on a partition of unity. The resulting scheme for applying the integral operator is then coupled with an iterative solver and suitable preconditioners. Several numerical examples are provided to demonstrate the accuracy and efficiency of our method, and a direct comparison with the leading code in the field is reported.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Impact of Heat Dissipation Profiles on Power Electronics Packaging Design

This work focuses on understanding the thermal impacts of using discrete power devices and limitations of applying conventional thermal design methods. Empirically, a thermal system is designed based on selecting a heat sink with the required thermal resistance from the manufacturer datasheet. This method, as an approximate estimation, has been proven effective as a rough design of Si-based power module. However, wide bandgap (WBG) bare dies bring additional thermal design concerns that have been overlooked. The benefits of WBG devices, such as smaller chip sizes and higher power ratings, on the other hand, lead to thermal concentration issues. Detailed analyses and impacts of the thermal concentration are presented in this paper. Finally, a more accurate model involving Finite Element Analysis (FEA) and Genetic Algorithm optimization is also proposed for a more accurate thermal design.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Learning compact physics‐aware delayed photocurrent models using dynamic mode decomposition

Abstract Radiation‐induced photocurrent in semiconductor devices can be simulated using complex physics‐based models, which are accurate, but computationally expensive. This presents a challenge for implementing device characteristics in high‐level circuit simulations where it is computationally infeasible to evaluate detailed models for multiple individual circuit elements. In this work we demonstrate a procedure for learning compact delayed photocurrent models that are efficient enough to implement in large‐scale circuit simulations, but remain faithful to the underlying physics. Our approach utilizes dynamic mode decomposition (DMD), a system identification technique for learning reduced‐order discrete‐time dynamical systems from time series data based on singular value decomposition. To obtain physics‐aware device models, we simulate the excess carrier density induced by radiation pulses by solving numerically the ambipolar diffusion equation, then use the simulated internal state as training data for the DMD algorithm. Our results show that the significantly reduced‐order delayed photocurrent models obtained via this method accurately approximate the dynamics of the internal excess carrier density—which can be used to calculate the induced current at the device boundaries—while remaining compact enough to incorporate into larger circuit simulations.

Hanson, Joshua↗
DOE OSTI2019

Analysis and Entropy Stability of the Line-Based Discontinuous Galerkin Method

We develop a discretely entropy-stable line-based discontinuous Galerkin method for hyperbolic conservation laws based on a flux differencing technique. By using standard entropy-stable and entropy-conservative numerical flux functions, this method guarantees that the discrete integral of the entropy is non-increasing. This nonlinear entropy stability property is important for the robustness of the method, in particular when applied to problems with discontinuous solutions or when the mesh is under-resolved. This line-based method is significantly less computationally expensive than a standard DG method. Numerical results are shown demonstrating the effectiveness of the method on a variety of test cases, including Burgers’ equation and the Euler equations, in one, two, and three spatial dimensions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Galerkin formulation of path integrals in lattice field theory

We present a mathematical framework for Galerkin formulations of path integrals in lattice field theory. The framework is based on using the degrees of freedom (DOFs) associated to a Galerkin discretization as the fundamental lattice variables. We formulate standard concepts in lattice field theory, such as the partition function and correlation functions, in terms of the DOFs. For example, using continuous finite element spaces, we show that the two-point spatial correlation function can be defined between any two points on the domain (as opposed to at just lattice sites) and furthermore, this two-point function satisfies a weak propagator (or Green’s function) identity, in analogy to the continuum case, as well as a convergence estimate obtained from the standard finite element techniques. Furthermore, this framework leads naturally to higher-order formulations of lattice field theories by considering higher-order finite element spaces for the Galerkin discretization. We consider analytical and numerical examples of scalar field theory to investigate how increasing the order of piecewise polynomial finite element spaces affect the approximation of lattice observables. Finally, we sketch an outline of this Galerkin framework in the context of gauge field theories.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Design and Analysis of Multifidelity Finite Element Simulations

Abstract The numerical accuracy of finite element analysis (FEA) depends on the number of finite elements used in the discretization of the space, which can be varied using the mesh size. The larger the number of elements, the more accurate the results are. However, the computational cost increases with the number of elements. In current practice, the experimenter chooses a mesh size that is expected to produce a reasonably accurate result, and for which the computer simulation can be completed in a reasonable amount of time. Improvements to this approach have been proposed using multifidelity modeling by choosing two or three mesh sizes. However, mesh size is a continuous parameter, and therefore, multifidelity simulations can be performed easily by choosing a different value for the mesh size for each of the simulations. In this article, we develop a method to optimally find the mesh sizes for each simulation and satisfy the same time constraints as a single or a double mesh size experiment. A range of different mesh sizes used in the proposed method allows one to fit multifidelity models more reliably and predict the outcome when meshes approach infinitesimally small, which is impossible to achieve in actual simulations. We illustrate our approach using an analytical function and a cantilever beam finite element analysis experiment.

Engineering↗
DOE OSTI2018

Fully discrete schemes for monotone optimal control problems

In this article, we study an infinite horizon optimal control problem with monotone controls. We analyze the associated Hamilton–Jacobi–Bellman (HJB) variational inequality which characterizes the value function and consider the totally discretized problem using Lagrange elements to approximate the state space Ω. The convergence orders of these approximations are proved, which are in general (h+(k/(√h))){sup γ} where γ is the Hölder constant of the value function u, h and k are the time and space discretization parameters, respectively. A special election of the relations between h and k allows to obtain a convergence of order k{sup (2/3)γ}, which is valid without semiconcavity hypotheses over the problem’s data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

On Practical Aspects of Variational Consistency in Contact Dynamics

Usage of contact mechanics methodologies is a pervasive modeling requirement in dynamic simulations. While for some trivial problems, solutions taken from analytical geometry are available, use of a finite element framework is common to achieve formulation generality. This work explores two dynamic contact formulations: one based on the traditional node-to-segment (NTS) approach, and a variationally consistent segment-to-segment (STS) mortar formulation. The NTS formulation employed here enforces the constraints kinematically (i.e., the interpenetration is enforced to the solver tolerance), whereas the mortar approach uses Lagrange multipliers to enforce the contact constraints. Both approaches are implemented in the open-source finite element framework Multiphysics Object-Oriented Simulation Environment (MOOSE). The results highlight two relevant contact-interface-related dynamic phenomena in finite element simulations. First, stabilization of contact constraints is discussed, taking into account the evolution of the total energy in a benchmark problem. Second, the influence of finite element discretization on both of the aforementioned contact formulations is analyzed by exercising a large-deformation example with continuous relative sliding. Variationally consistent contact approaches such as the mortar formulation lead to improved energy preservation and avoid spurious excitation of the system's frequencies. This is especially relevant in settings where inertia and vibrations are of importance.

42 ENGINEERING↗
DOE OSTI2021

AIR Algebraic Multigrid for a Space-Time Hybridizable Discontinuous Galerkin Discretization of Advection(-Diffusion)

This article investigates the efficiency, robustness, and scalability of approximate ideal restriction (AIR) algebraic multigrid as a preconditioner in the all-at-once solution of a space-time hybridizable discontinuous Galerkin discretization of advection-dominated flows. The motivation for this study is that the time-dependent advection-diffusion equation can be seen as a “steady” advection-diffusion problem in $(d+1)$-dimensions and AIR has been shown to be a robust solver for steady advection-dominated problems. Numerical examples demonstrate the effectiveness of AIR as a preconditioner for advection-diffusion problems on fixed and time-dependent domains, using both slab-by-slab and all-at-once space-time discretizations, and in the context of uniform and space-time adaptive mesh refinement. A closer look at the geometric coarsening structure that arises in AIR also explains why AIR can provide robust, scalable, space-time convergence on advective and hyperbolic problems, while most multilevel parallel-in-time schemes struggle with such problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

fPINNs: Fractional Physics-Informed Neural Networks

Physics-informed neural networks (PINNs), introduced, are effective in solving integer-order partial differential equations (PDEs) based on scattered and noisy data. PINNs employ standard feedforward neural networks (NNs) with the PDEs explicitly encoded into the NN using automatic differentiation, while the sum of the mean-squared PDE residuals and the mean-squared error in initial-boundary conditions is minimized with respect to the NN parameters. Here we extend PINNs to fractional PINNs (fPINNs) to solve space-time fractional advection-diffusion equations (fractional ADEs), and we study systematically their convergence, hence explaining both fPINNs and PINNs for the first time. Specifically, we demonstrate their accuracy and effectiveness in solving multidimensional forward and inverse problems with forcing terms whose values are only known at randomly scattered spatio-temporal coordinates (black-box (BB) forcing terms). A novel element of the fPINNs is the hybrid approach that we introduce for constructing the residual in the loss function using both automatic differentiation for the integer-order operators and numerical discretization for the fractional operators. This approach bypasses the difficulties stemming from the fact that automatic differentiation is not applicable to fractional operators because the standard chain rule in integer calculus is not valid in fractional calculus. To discretize the fractional operators, we employ the Grünwald--Letnikov (GL) formula in one-dimensional fractional ADEs and the vector GL formula in conjunction with the directional fractional Laplacian in two- and three-dimensional fractional ADEs. We first consider the one-dimensional fractional Poisson equation and compare the convergence of the fPINNs against the finite difference method (FDM). We present the solution convergence using both the mean L 2 error as well as the standard deviation due to sensitivity to NN parameter initializations. Using different GL formulas we observe first-, second-, and third-order convergence rates for small size training sets but the error saturates for larger training sets. We explain these results by analyzing the four sources of numerical errors due to discretization, sampling, NN approximation, and optimization. The total error decays monotonically (below 10 –5 for a third-order GL formula) but it saturates beyond that point due to the optimization error. We also analyze the relative balance between discretization and sampling errors and observe that the sampling size and the number of discretization points (auxiliary points) should be comparable to achieve the highest accuracy. As we increase the depth of the NN up to certain value, the mean error decreases and the standard deviation increases, whereas the width has essentially no effect unless its value is either too small or too large. We next consider time-dependent fractional ADEs and compare white-box (WB) and BB forcing. We observe that for the WB forcing, our results are similar to the aforementioned cases; however, for the BB forcing fPINNs outperform FDM. Subsequently, we consider multidimensional time-, space-, and space-time-fractional ADEs using the directional fractional Laplacian and we observe relative errors of 10 –3 ~ 10 –4 . Lastly, we solve several inverse problems in one, two, and three dimensions to identify the fractional orders, diffusion coefficients, and transport velocities and obtain accurate results given proper initializations even in the presence of significant noise.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Second-order invariant domain preserving approximation of the compressible Navier–Stokes equations

Here, we present a fully discrete approximation technique for the compressible Navier–Stokes equations that is second-order accurate in time and space, semi-implicit, and guaranteed to be invariant domain preserving. The restriction on the time step is the standard hyperbolic CFL condition, i.e. τ ≲ O ( h ) / V where V is some reference velocity scale and h the typical meshsize.

42 ENGINEERING↗
DOE OSTI2018

Ice-Sheet / Ocean Interaction Model for Greenland Fjords Using High-Order Discontinuous Galerkin Methods (Final Report)

This report summarizes the development and validation of the Non-hydrostatic Unified Model of the Ocean (NUMO). The overarching science goal of the project was to advance Earth System science by proposing a more realistic representation of physical processes in a Greenland fjord. To achieve this objective, we proposed to build a new, separate, high-resolution ocean model to realistically represent the complex three-dimensional physics of the fjord, its bathymetry, coastlines using continuous/discontinuous Galerkin (CG/DG) methods. The report describes the technical details of model components, i.e., choice of equations set, time integration scheme, boundary conditions, spatial discretization methods, mesh generation. We show a suite of validation results for test cases ranging from the Kovasznay flow, through the lock-exchange, simplified two-dimensional fjord, to a three-dimensional density current on a slope. Results are compared with the literature. The report is concluded with a discussion of efforts taken to perform a simulation of Sermilik Fjord with realistic bathymetry data.

58 GEOSCIENCES↗
DOE OSTI2020

High-order matrix-free incompressible flow solvers with GPU acceleration and low-order refined preconditioners

In this work, we present a matrix-free flow solver for high-order finite element discretizations of the incompressible Navier-Stokes and Stokes equations with GPU acceleration. For high polynomial degrees, assembling the matrix for the linear systems resulting from the finite element discretization can be prohibitively expensive, both in terms of computational complexity and memory. For this reason, it is necessary to develop matrix-free operators and preconditioners, which can be used to efficiently solve these linear systems without access to the matrix entries themselves. The matrix-free operator evaluations utilize GPU-accelerated sum-factorization techniques to minimize memory movement and maximize throughput. The preconditioners developed in this work are based on a low-order refined methodology with parallel subspace corrections, as described for diffusion problems in [1]. The saddle-point Stokes system is solved using block-preconditioning techniques, which are robust in mesh size, polynomial degree, time step, and viscosity. For the incompressible Navier-Stokes equations, we make use of projection (fractional step) methods, which require Helmholtz and Poisson solves at each time step. The performance of our flow solvers is assessed on several benchmark problems in two and three spatial dimensions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Protein model quality assessment using rotation–equivariant transformations on point clouds

Machine learning research concerning protein structure has seen a surge in popularity over the last years with promising advances for basic science and drug discovery. Working with macromolecular structure in a machine learning context requires an adequate numerical representation, and researchers have extensively studied representations such as graphs, discretized 3D grids, and distance maps. As part of CASP14, we explored a new and conceptually simple representation in a blind experiment: atoms as points in 3D, each with associated features. These features—initially just the basic element type of each atom—are updated through a series of neural network layers featuring rotation-equivariant convolutions. Starting from all atoms, we further aggregate information at the level of alpha carbons before making a prediction at the level of the entire protein structure. We find that this approach yields competitive results in protein model quality assessment despite its simplicity and despite the fact that it incorporates minimal prior information and is trained on relatively little data. As a result, its performance and generality are particularly noteworthy in an era where highly complex, customized machine learning methods such as AlphaFold 2 have come to dominate protein structure prediction.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Multilevel Hierarchical Decomposition of Finite Element White Noise with Application to Multilevel Markov Chain Monte Carlo

In this work we develop a new hierarchical multilevel approach to generate Gaussian random field realizations in an algorithmically scalable manner that is well suited to incorporating into multilevel Markov chain Monte Carlo (MCMC) algorithms. This approach builds off of other partial differential equation (PDE) approaches for generating Gaussian random field realizations; in particular, a single field realization may be formed by solving a reaction-diffusion PDE with a spatial white noise source function as the right-hand side. While these approaches have been explored to accelerate forward uncertainty quantification tasks, e.g., multilevel Monte Carlo, the previous constructions are not directly applicable to multilevel MCMC frameworks which build fine-scale random fields in a hierarchical fashion from coarse-scale random fields. Our new hierarchical multilevel method relies on a hierarchical decomposition of the white noise source function in $L^2$ which allows us to form Gaussian random field realizations across multiple levels of discretization in a way that fits into multilevel MCMC algorithmic frameworks. After presenting our main theoretical results and numerical scaling results to showcase the utility of this new hierarchical PDE method for generating Gaussian random field realizations, this method is tested on a four-level MCMC algorithm to explore its feasibility.

algebraic multigrid↗
DOE OSTI2021

Plastic work constrained elastoplastic topology optimization

An elastoplastic topology optimization framework for limiting plastic work generation while maximizing stiffness is presented. The kinematics and constitutive model are based on finite strain linear isotropic hardening plasticity, and the balance laws are solved using a total Lagrangian finite element formulation. Aggregation of the specific plastic work combined with an adaptive normalization scheme efficiently constrains the maximum specific plastic work. The optimization problem is regularized using an augmented partial differential equation filter, and is solved by the method of moving asymptotes where path-dependent sensitivities are derived using the adjoint method. The numerical examples show a clear dependence on the optimized maximum stiffness structures for different levels of constrained specific plastic work. It is also shown that due to the history dependency of the plasticity, the load path significantly influences the structural performance and optimized topology.

42 ENGINEERING↗
DOE OSTI2019

A fast Fourier transform-based mesoscale field dislocation mechanics study of grain size effects and reversible plasticity in polycrystals

A numerical implementation of a non-local polycrystal plasticity theory based on a mesoscale version of the field dislocation mechanics theory (MFDM) of Acharya and Roy (2006) is presented using small-strain elasto-viscoplastic fast Fourier transform-based (EVPFFT) algorithm developed by Lebensohn et al. (2012). In addition to considering plastic flow and hardening only due to SSDs (statistically stored dislocations) as in the classic EVPFFT framework, the proposed method accounts for the evolution of GND (geometrically necessary dislocations) densities solving a hyperbolic-type partial differential equation, and GND effects on both plastic flow and hardening. This allows consideration of an enhanced strain-hardening law that includes the effect of the GND density tensor. The numerical implementation of a reduced version of the MFDM is presented in the framework of the FFT-based augmented Lagrangian procedure of Michel et al. (2001). A Finite Differences scheme combined with discrete Fourier transforms is applied to solve both incompatibility and equilibrium equations. The numerical procedure named MFDM-EVPFFT is used to perform full field simulations of polycrystal plasticity considering different grain sizes and their mechanical responses during monotonic tensile and reversible tension-compression tests. Using Voronoi tessellation and periodic boundary conditions, voxelized representative volume elements (RVEs) with different grain sizes are generated. With MFDM-EVPFFT, a Hall-Petch type scaling law is obtained in contrast with the conventional crystal plasticity EVPFFT. In the case of reversible plasticity, a stronger Bauschinger effect is observed with the MFDM-EVPFFT approach in comparison with conventional EVPFFT. Here, the origin of these differences is analyzed in terms of heterogeneity, GND density and stress evolutions during the compression stage.

36 MATERIALS SCIENCE↗